Erdős Problem #204 — Disjoint covering systems with divisor moduli

At least 45 years old · documented by

Does there exist a natural number nn and a function a:N→Za:\mathbb{N}\to\mathbb{Z} such that, writing D={d∈N:d∣n and d>1}D=\{d\in\mathbb{N}:d\mid n\text{ and }d>1\}, both of the following hold? Every integer x∈Zx\in\mathbb{Z} is congruent to ad(modd)a_d\pmod d for some d∈Dd\in D; and for all distinct d,d′∈Dd,d'\in D, if there exists x∈Zx\in\mathbb{Z} satisfying both x≡ad(modd)x\equiv a_d\pmod d and x≡ad′(modd′)x\equiv a_{d'}\pmod {d'}, then gcd⁡(d,d′)=1\gcd(d,d')=1.

References

Progress summary

Refreshed
Claimed solved

A 2025 proof shows that no such covering system exists, so the existence question is settled negatively.

Erdős and Graham posed in 1980 the question of whether some nn has divisor-indexed residue classes that cover every integer while intersecting classes have coprime moduli. The question is listed as Problem 204204 in one source, with a separate source numbering it 208208.

January 2025 proof

Adenwalla proved that no integer nn admits such a covering: for classes indexed by all divisors dhmidnd hmid n with d>1d>1, the coprime-overlap condition prevents them from covering every integer. The result is stated as Theorem 3.23.2 and was subsequently reproduced in the 2026 volume of INTEGERS.

Current status (as of March 2026): The existence problem is resolved negatively; no such integer nn exists.

Sources

Solutions 0

No solutions have been posted yet.