Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. Theorem 4, printed p. 1747, physical PDF p. 9. Harrington explicitly attributes this theorem to Chen; this page records Harrington's restatement rather than assigning a new proof to Harrington.

Conventions

For a positive integer rr, define

Yr={k>0:2∤k, k−2n has at least r distinct prime factors for every positive integer n},Y_r=\left\{k>0:2\nmid k,\ k-2^n\text{ has at least }r \text{ distinct prime factors for every positive integer }n\right\},

and

Gr={k>0:2∤k, k2n+1 has at least r distinct prime factors for every positive integer n}.G_r=\left\{k>0:2\nmid k,\ k2^n+1\text{ has at least }r \text{ distinct prime factors for every positive integer }n\right\}.

Statement

"If there exists a (2,1)(2,1)-primitive mm-covering system, then the sets Ym+1Y_{m+1} and Gm+1G_{m+1} each contain an infinite arithmetic progression." (p. 1747)

Harrington combines this restated implication with Theorem 2 to obtain Corollary 1: Y4Y_4 and G4G_4 each contain an infinite arithmetic progression.

Proof scope. Harrington's paper states this as a result proved by Chen and does not reproduce its proof at this point. Chen's original paper was not checked for this card.