The paper investigates a variant of the odd covering problem, allowing one modulus to repeat among distinct odd integers.
Erdős first introduced the idea of covering systems in 1950. Since then, much of the work in this area has concentrated on identifying covering systems that meet specific conditions on their moduli. Among the central open problems in this field is the well-known odd covering problem. In this paper, we investigate a variant of that problem, where one odd integer is permitted to appear multiple times as a modulus in the covering system, while all remaining moduli are distinct odd integers greater than 1.
No takes yet. Share an insight, caveat, or question.
Bispels et al. (2026) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: