Difference sets and shifted primes
Number Theory
2007-05-28 v1
Abstract
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.
Keywords
Cite
@article{arxiv.0705.3749,
title = {Difference sets and shifted primes},
author = {Jason Lucier},
journal= {arXiv preprint arXiv:0705.3749},
year = {2007}
}