2000 character limit reached
A Question of Erdős and Graham on Covering Systems
Published 25 Jan 2025 in math.NT and math.CO | (2501.15170v2)
Abstract: Erd\H{o}s and Graham (Erd\H{o}s and Graham, 1980) asked if there exists an such that the divisors of greater than 1 are the moduli of a distinct covering system with the following property: If there exists an integer which satisfies two congruences in the system, and $a'\mod d'$, then $\gcd(d,d')=1$. We show that such an does not exist. This problem is part of Problem # 204 on the website www.erdosproblems.com, compiled and maintained by Thomas Bloom.
Paper Prompts
Sign up for free to create and run prompts on this paper.