Covering the Set of Integers by Congruence Classes of Distinct Moduli
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.].
- A covering system whose smallest modulus is 40
- On homogeneous covering congruences
- Homogeneous covering congruences and subgroup covers
- Covering systems of congruences, a negative result
- A covering system with least modulus 25
- Covering subsets of the integers by congruences
- On exactly covering systems of congruences having moduli occurring at most twice
- scientific article; zbMATH DE number 740352 (Why is no real title available?)
- On integers of the form 𝑘2ⁿ+1
- Solution of the minimum modulus problem for covering systems
- scientific article; zbMATH DE number 7640035 (Why is no real title available?)
- Covering Sets of Congruences
- scientific article; zbMATH DE number 7177936 (Why is no real title available?)
- On second-order linear sequences of composite numbers
- scientific article; zbMATH DE number 3365349 (Why is no real title available?)
- On covering numbers
- On integers of the forms \(k\pm 2^{n}\) and \(k2^{n}\pm 1\)
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)