Covering the Set of Integers by Congruence Classes of Distinct Moduli

From MaRDI portal





A set of congruences is called a covering set if every integer belongs to at least one of the congruences. Various questions have been raised about covering sets. Two of the most interesting ones are whether there exists a covering set of distinct moduli where the moduli are arbitrarily large, and whether there exists a covering set of distinct odd \((\ge 3)\) moduli. The author constructed a covering set of distinct moduli the least of which is 20 (the best bound known previously is 9). He also mentioned that a slightly weaker result was obtained independently and by other methods by \textit{C. E. Krukenberg} in his doctoral thesis [Covering sets of the integers. University of Illinois, Urbana-Champaign, Ill. (1971), ProQuest LLC, Ann Arbor, MI, 1971. 104 p.].











This page was built for publication: Covering the Set of Integers by Congruence Classes of Distinct Moduli

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5638380)