Wiki
Wiki

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

Updated


Statement

Let N>0N>0, and let ai(moddi)a_i\pmod {d_i} be finitely many congruence classes with positive integer moduli di∣Nd_i\mid N. If they cover {0,…,N−1}\{0,\ldots,N-1\}, then

N≤∑iNdi,1≤∑i1di.N\le\sum_i\frac N{d_i},\qquad 1\le\sum_i\frac1{d_i}.

Distinctness and oddness are not needed here.

Complete proof

Replace each residue by its representative rir_i in [0,di)[0,d_i). Its representatives in [0,N)[0,N) are exactly ri+kdir_i+k d_i for 0≤k<N/di0\le k<N/d_i. Indeed these values are in range, and Euclidean division shows that every value in the class has this form. The class therefore contains N/diN/d_i points. The cardinality of a finite union is at most the sum of the individual cardinalities, so covering all NN points gives the first inequality. Division by N>0N>0 gives the second.

For a covering of Z\mathbb Z, take any positive common multiple NN and use periodicity.

Source and dependencies

Canonical v1, p. 4, Lemma 4.1 and its residue-counting input card_filter_mod_le. This supplies the complete elementary counting proof underlying the source's finite, rational and integer formulations. No external non-elementary theorem or Lean execution is used in this deduction.

Bears on