Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Lemma 5, printed pp. 145–146 (PDF pp. 3–4).
Statement. Let be a positive integer and let be a nonempty pairwise disjoint family. Suppose that, for a real and an integer ,
There is a prime such that for at least indices. For this same prime there is an integer such that
for at least indices. The prime may already divide .
Complete proof
Factor into its distinct prime divisors . Then . For , the generalized Chinese remainder theorem says that disjointness of the two residue classes is equivalent to
Both moduli are multiples of , while . Thus , and
So some divides . The assertion also holds for , since . It includes the singleton-family case without a separate argument.
The sets of indices for these divisibilities cover all indices. One prime therefore divides for at least indices. For each of them write with integer . Among their residue classes , one occurs at least times. If its residue is , put . Those indices have the required common residue modulo .
Both pigeonhole inequalities are weak, as they must be. No squarefree assumption is used: dividing the two moduli by their common factor is what makes the new prime step valid even when .