Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (pp. 1--4). A cover of is a finite system of residue classes , , whose union is ; it is minimal if no proper subsystem covers. A positive integer is a covering number (Definition 1.1, p. 2) if some cover of has its moduli distinct, greater than one and dividing ; a covering number is primitive (Definition 1.2, p. 4) if none of its proper divisors is a covering number. For a predicate , is if holds and otherwise (p. 3).
Theorem 1.1 (p. 3). Let be distinct primes and positive integers. If
then is a covering number.
Remark 1.1 (p. 3). The empty product is , so (1.3) at forces and .
Corollary 1.1 (p. 3). For any distinct primes with there are positive exponents making a covering number. The paper takes for and checks (1.3) by a telescoping product; the paper calls the Erdős--Selfridge conjecture the converse of this corollary.
Source. Zhi-Wei Sun, On covering numbers, Integers 7 (2007), no. 2, A33, also printed in Combinatorial Number Theory (de Gruyter, Berlin, 2007), 443--453. Labels and pages here are those of arXiv:math/0601017v2 (9 September 2006), the edition read, which is named on the source card.
Read depth. Claims checked: the statement, Remark 1.1 and Corollary 1.1 were read clause by clause on the page images of the print, and the proof was followed. Nothing here is independently reviewed.
Proof pointer
Pp. 5--7. Write . Condition (1.3) says has at least divisors, which supply distinct cofactors . For each and each the classes with moduli , , cover the integers divisible by but not by ; stacking these over and covers every integer not divisible by , and one more class , available because gives one spare divisor, covers the rest. All moduli are distinct. The paper credits the basic ideas to Znám and to its author's 1990 paper (Remark 2.1, p. 6).
Dependencies
None beyond the divisor-count formula .
Bears on
No problem directly. It is the construction behind Theorem 1.2 and Theorem 1.3, and Conjecture 1.1 proposes its converse for primitive covering numbers.