2000 character limit reached
A further investigation on covering systems with odd moduli
Published 22 Jul 2025 in math.NT | (2507.16135v1)
Abstract: Erd\H{o}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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.