Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Croot, published paper, p. 234, Theorem 1; proof on pp. 235–237.
Put .
Statement. For every , for all sufficiently large , any pairwise disjoint family with distinct squarefree moduli satisfies
Complete relative proof. Let
Discard the moduli with . By Lemma 2, their number is at most . Also discard moduli all of whose prime divisors are at most . The external smooth-number estimate in Lemma 1 with bounds their number by the same expression.
Let be the remaining moduli. If it is empty, the two discarded-class bounds already suffice. Otherwise apply the complete selection lemma with parameters . It gives and a new prime . At least distinct integers at most are multiples of . Therefore
Cancel . Since ,
The logarithmic cost is
Hence . Adding the two discarded-class bounds changes the exponential coefficient only by . For every fixed , that error and the fixed multiplicative constants are eventually absorbed into , proving the statement.
Source corrections and scope. The denominator in one counting display on p. 236 should be . Non-strict finite counting inequalities are enough. The final estimate uses the new prime guaranteed by the corrected stopping rule in the linked selection lemma. The entire same-paper argument is included; only the exact analytic smooth-number theorem remains external.
Bears on. Problem 202: an upper bound with coefficient on the scale , only for families whose moduli are all squarefree; and the general-modulus upper bound, whose proof reduces to this theorem.