Wiki
Wiki

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 Z\mathbb Z is a finite system of residue classes ai(modni)a_i\pmod{n_i}, 1≤i≤k1\le i\le k, whose union is Z\mathbb Z; it is minimal if no proper subsystem covers. A positive integer nn is a covering number (Definition 1.1, p. 2) if some cover of Z\mathbb Z has its moduli distinct, greater than one and dividing nn; a covering number is primitive (Definition 1.2, p. 4) if none of its proper divisors is a covering number. For a predicate PP, [ ⁣[P] ⁣][\![P]\!] is 11 if PP holds and 00 otherwise (p. 3).

Theorem 1.1 (p. 3). Let p1,…,prp_1,\ldots,p_r be distinct primes and α1,…,αr\alpha_1,\ldots,\alpha_r positive integers. If

∏0<t<s(αt+1) ≥ ps−[ ⁣[r≠s] ⁣]for all s=1,…,r,(1.3)\prod_{0<t<s}(\alpha_t+1)\ \ge\ p_s-[\![r\ne s]\!]\qquad\text{for all }s=1,\ldots,r,\qquad(1.3)

then p1α1⋯prαrp_1^{\alpha_1}\cdots p_r^{\alpha_r} is a covering number.

Remark 1.1 (p. 3). The empty product is 11, so (1.3) at s=1s=1 forces p1=2p_1=2 and r≥2r\ge2.

Corollary 1.1 (p. 3). For any distinct primes p1=2<p2<⋯<prp_1=2<p_2<\cdots<p_r with r>1r>1 there are positive exponents α1,…,αr\alpha_1,\ldots,\alpha_r making p1α1⋯prαrp_1^{\alpha_1}\cdots p_r^{\alpha_r} a covering number. The paper takes αt=⌈(pt+1−[ ⁣[t≠r−1] ⁣])/(pt−1)⌉−1\alpha_t=\lceil(p_{t+1}-[\![t\ne r-1]\!])/(p_t-1)\rceil-1 for t<rt<r 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 ms=∏t<sptαtm_s=\prod_{t<s}p_t^{\alpha_t}. Condition (1.3) says msm_s has at least ps−[ ⁣[r≠s] ⁣]p_s-[\![r\ne s]\!] divisors, which supply distinct cofactors dj(s)d^{(s)}_j. For each ss and each α≤αs\alpha\le\alpha_s the classes with moduli dj(s)psαd^{(s)}_jp_s^{\alpha}, j<psj<p_s, cover the integers divisible by mspsα−1m_sp_s^{\alpha-1} but not by mspsαm_sp_s^{\alpha}; stacking these over α\alpha and ss covers every integer not divisible by p1α1⋯prαrp_1^{\alpha_1}\cdots p_r^{\alpha_r}, and one more class 0(moddpr(r)prαr)0\pmod{d^{(r)}_{p_r}p_r^{\alpha_r}}, available because s=rs=r 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 d(n)=∏(αt+1)d(n)=\prod(\alpha_t+1).

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.