Difference sets and the primes
Abstract
Suppose that A is a subset of 1,...,N such that the difference between any two elements of A is never one less than a prime. We show that |A| = O(N exp(-c(log N)1/4)) for some absolute c>0.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.