2000 character limit reached
On a theorem of Sárközy for difference sets and shifted primes
Published 8 Jun 2019 in math.CA and math.NT | (1906.03477v2)
Abstract: We show that if the difference of two elements of a set $A \subseteq [N]$ is never one less than a prime number, then $|A| = O (N \exp (-c (\log N){1/3}))$ for some absolute constant $c>0$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.