Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (pp. 1--2). is the set of positive primes and the set of positive integers. is the set of positive odd integers that cannot be written as with and ; so throughout. The paper records .
Theorem 1.1 (p. 2, quoted). "For any set of asymptotic density zero, is not a union of finitely many infinite arithmetic progressions and a set of asymptotic density zero."
Corollary 1.2 (p. 2). Taking : itself is not a union of finitely many infinite arithmetic progressions and a set of asymptotic density zero.
Erdős's Conjecture A (p. 2), which the paper states as "The set is the union of an infinite arithmetic progression of positive odd integers and a set of asymptotic density zero", is the case of one progression, so Corollary 1.2 refutes it.
Source. Yong-Gao Chen, A conjecture of Erdős on , arXiv:2312.04120v3 (2024). Labels and pages are those of arXiv v3: the statement on p. 2, the proof in Section 2, pp. 6--13. The edition read is identified on the source card.
Read depth. Claims checked: the setting and the statement were read clause by clause on the printed pages. The proof was read but not checked step by step. Nothing here is independently reviewed.
Proof pointer
Section 2, pp. 6--13, by contradiction. Suppose with of density zero; every is even, and by Erdős's progression in . The proof builds distinct primes (prime factors of Fermat numbers , of three numbers , and the remaining primes of ) and integers so that every has a prime factor among while and for . Then the progression lies in up to a density-zero set, so it meets some , and a Chinese-remainder shift at produces a positive proportion of in that progression, by Dirichlet's theorem, the second-moment bound the paper cites from earlier work, and Cauchy--Schwarz (pp. 8--10). The construction of the primes is on pp. 10--13.
Dependencies
Dirichlet's theorem on primes in progressions; the bound for the number of representations (the paper's (2.11), cited from Chen and Sun and from Romanoff); Erdős's 1950 progression in .
Bears on
- Problem 16: the problem asks whether the odd integers not of the form are the union of an infinite arithmetic progression and a set of density . Corollary 1.2, with as the paper fixes it, answers no, and Theorem 1.1 rules out finitely many progressions even after adding any density-zero set.