Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Zhi-Wei Sun, Covering the integers by arithmetic sequences II, Trans. Amer. Math. Soc. 348 (1996), no. 11, 4279–4320, DOI. Theorem II is on p. 7 of the 48-page author copy described on the source card, which does not carry the journal pagination. Like Theorem I, it collects results the paper proves in more general forms later.
Conventions
The conventions are those of Theorem I: with , ; is the greatest common divisor; the denominator of a rational with and is . The paper's conditions (7) and (8) (p. 5) are
Statement
Let be an exact -cover of with .
(i) Let and let be a rational such that exactly one has (for example ). Then for every there is with and
(ii) Assume (8) with . Then for all , and for each there is with
(the paper's (14)).
(iii) If , then for all and there is with and
(the paper's (15)); the equality is exact, not modulo .
(iv) Assume (7) with . For every positive integer , the binomial coefficient is a sum of denominators greater than of rationals
The paper writes the range as ; the inequality for an exact -cover under (7) with is the consequence of Sun's earlier improvement of the Newman–Znám result recalled on p. 5.
Proof route and dependencies
As the paper's remarks state:
- (i) from Corollary 11 applied to the complementary set (remark, p. 39);
- (ii) is equivalent to Corollary 5(ii) (remark, p. 14), proved on p. 13 from Theorem 1 and an earlier theorem of Sun;
- (iii) is Corollary 9 with (p. 24); the paper contrasts it with a conjecture of Z. H. Sun that its Examples 1 and 2 refute (pp. 14–15);
- (iv) from Corollary 12, since (p. 40).
No proof is reconstructed here.
Bears on
No row. The statements concern exact -covers in general, and no problem page uses them. The exclusion of exact covers with distinct moduli (Problem 947) is recorded under part (iv) of Theorem I.