Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Problem 204

../

claims/: The 1 claim page of Problem 204, one per claimant's result; the problem's standing derives from them.


Statement. Are there nn such that there is a covering system with moduli the divisors of nn which is 'as disjoint as possible'?

That is, for all d∣nd\mid n with d>1d>1 there is an associated ada_d such that every integer is congruent to some ad(modd)a_d\pmod{d}, and if there is some integer xx with

x≡ad(modd) and x≡ad′(modd′)x\equiv a_d\pmod{d}\textrm{ and }x\equiv a_{d'}\pmod{d'}

then (d,d′)=1(d,d')=1.

Status. DISPROVED (LEAN). The label is the site's (DISPROVED (LEAN), page last edited 28 December 2025). Adenwalla proved that no such nn exists, in a paper refereed and published in INTEGERS 26 (2026), #A52; the acceptance evidence and the Lean qualification are on his claim page.

Source. erdosproblems.com/204, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #204, https://www.erdosproblems.com/204.

References.

  • [Ad25] S. Adenwalla, A Question of Erdős and Graham on Covering Systems. arXiv:2501.15170 (2025). Published as INTEGERS 26 (2026), #A52, doi:10.5281/zenodo.19949505.

Formalization. Statement in formal-conjectures.

Progress

Not yet compiled.

Known Results

Not yet compiled.

Linked library material

These entries are derived from explicit links on library pages. They are navigation only and do not by themselves record mathematical progress.