arXiv Analytics

Sign in

arXiv:0705.3749 [math.NT]AbstractReferencesReviewsResources

Difference sets and shifted primes

Jason Lucier

Published 2007-05-25Version 1

We show that if A is a subset of {1, ..., n} such that it has no pairs of elements whose difference is equal to p-1 with p a prime number, then the size of A is O(n(loglog n)^(-clogloglogloglog n)) for some positive constant c.

Comments: 22 pages
Categories: math.NT
Subjects: 11P55, 11B83
Related articles: Most relevant | Search more
arXiv:1801.06384 [math.NT] (Published 2018-01-19)
Difference sets and the slice rank bounding method
arXiv:1406.4801 [math.NT] (Published 2014-06-03, updated 2014-06-19)
Two statements that are equivalent to a conjecture related to the distribution of prime numbers
arXiv:1512.08382 [math.NT] (Published 2015-12-28)
The Least Prime Number in a Beatty Sequence

Links

Toolbox