Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Corollary 1.3 (p. 5, quoted). "There are infinitely many positive integers such that among the subsets of only can be the set of all the moduli in a cover of with distinct moduli."
The proof shows this for every with an odd prime, and that for these the set itself is the set of moduli of a cover: every minimal cover of whose moduli have least common multiple has , and is a covering number by Theorem 1.4 (i). The paper presents the corollary as an affirmative answer to a question in Erdős's 1980 survey (Ann. Discrete Math. 6, 89--115).
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 was read on the page image of the print, and the proof was followed. Simpson's theorem is cited in the paper, not proved. Nothing here is independently reviewed.
Proof pointer
P. 5. Take a minimal cover with distinct moduli greater than one and least common multiple . Simpson's theorem, a conjecture of Znám, gives with , here , while has exactly elements. So the moduli are all of . Primitivity of (Theorem 1.4 (i)) makes every minimal cover with moduli in have least common multiple exactly .
Dependencies
Theorem 1.4 (i); R. J. Simpson, Regular coverings of the integers by arithmetic progressions, Acta Arith. 45 (1985), 145--152, whose card is Simpson 1985.
Bears on
Problem 1189: for each odd prime the divisors of greater than one form a covering set of which no proper subset is a covering set, so the problem's last question, whether infinitely many have their divisors above one forming an irreducible covering set, has the answer yes. The paper does not address the problem's other questions.