Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Lemma 5, stated on PDF p. 2 of arXiv:math/0604347v2, with its proof on p. 3. The paper attributes the criterion to Huhn and Megyesi, On disjoint residue classes, Discrete Math. 41 (1982), 327--330, where it is stated without proof.
Statement
Let be congruence classes, and let be any multiple of
If
then these classes are not pairwise disjoint.
The printed conclusion names the classes "with " [sic], while the hypothesis runs over ; the proof on p. 3 works with the classes of the hypothesis, and that reading is the one stated here.
Equivalently, the moduli of pairwise disjoint classes satisfy for every such . The paper restates this for every subfamily of a least counterexample as item 7 of its Lemma 6 (p. 4).
Scope of the test. The condition involves only the moduli, not the residues. The paper notes (p. 2) that Huhn and Megyesi conjectured the converse, that moduli all of whose subsets pass the test always carry disjoint classes, and cites Z.-W. Sun, Solutions to two problems of Huhn and Megyesi, Chinese Ann. Math. Ser. A 13 (1992), 722--727, for the moduli , which pass the test together with all their subsets but are not the moduli of disjoint congruence classes.
Read depth. Claims checked: the statement and the remarks around it were read on the printed pages. The proof was not independently reviewed.
Proof pointer
P. 3. Each class modulo splits into classes modulo ; the hypothesis gives more than of these, so two coincide, and writing as an integer combination of and produces a common element of the two original classes.
Bears on
- Problem 202: the lemma is a necessary condition on the moduli of any family of pairwise disjoint congruence classes, including the families with distinct moduli that problem counts. The paper does not apply it to that problem's maximum.