Difference sets and the primes
classification
🧮 math.CA
math.NT
keywords
differenceabsoluteelementslessneverprimeprimessets
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.