Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Section 4.2, printed pp. 387–388 (PDF pp. 7–8). The argument expands the residue, coprimality and termination details implicit in the published chain.
Statement and invariants
Let be a nonempty finite family of distinct moduli greater than one, with pairwise disjoint classes , distinct square-free kernels, and one common value . There exist positive integers , pairwise coprime integers , and nested nonempty families
with , , such that, writing and ,
and for every stage,
Every is divisible by and satisfies . On , all residues agree modulo each , , hence modulo .
Why the residual family intersects
Suppose stages through have been constructed, put , and consider
All its members have exactly prime factors and are coprime to . If this number is zero, every residual modulus is one, so and the process stops. Otherwise every residual modulus exceeds one.
For distinct residual moduli , if then . Their original residues agree modulo , so the generalized Chinese remainder theorem makes the progressions intersect, a contradiction. Thus the residual prime supports form an intersecting family. They are distinct because the original kernels were distinct and the same prime support of was removed from each. A singleton residual family with positive support also satisfies this condition; it is not stopped prematurely.
Choosing a core and its complete exponents
Apply Lemma 3.5 to the residual kernels. It produces a set-minimal intersecting family of square-free cores, and every is divisible by a core. Fix one such core for every , for example the least one. Since , some integer has
The sum need only range over the finitely many occurring sizes, a nonempty set. If every such class were smaller than its displayed share, their total would be smaller than . By Lemma 3.4, there are at most cores of size . Some one core therefore divides at least
assigned residual moduli; we used .
Write the primes of as . Partition those moduli by their positive exponent tuples at these primes. The sum of the weights over all positive tuples is . Weighted pigeonholing gives an occurring tuple with class size at least
Set . These are the full exponents of the selected primes in each residual modulus of the class. Thus , , and . The bound and (3) give the first inequality in (2) for the corresponding original moduli, which define .
All selected primes lie outside , so is coprime to the earlier blocks. The full-exponent property also proves on . This is stronger than merely choosing the square-free product .
Residues and termination
Partition by . There are residue classes, so some nonempty class has at least members. Previously fixed residues remain fixed under restriction. This gives the second inequality in (2) and restores every invariant at stage .
Each stage removes prime supports from every remaining modulus. The process can therefore continue for at most stages. It stops exactly when no residual support remains, at which point each remaining modulus equals . Distinctness of the moduli and nonemptiness then give and (1).
Source precision. The introductory example on p. 386 says that agreement modulo 6 for moduli divisible by 2 and 3 forces a shared prime other than 2 and 3. Without controlling the full exponents, that is false: and are disjoint, their residues agree modulo 6, and their moduli use only 2 and 3. The full-block invariant above is the one actually needed and produced by Section 4.2. The October 2012 manuscript explicitly lists the previous residue agreements in condition (2); the journal list omits that clause, but the nested construction preserves it.
Use. The full upper-bound computation is in Theorem 1. Theorem 2 changes only the core-frequency step under its separate conjectural input.