Erdős·erdos:486
Erdős Problem 486: Logarithmic density for sets avoiding modular subsets
No independent check recorded yet. A formal artifact, declaration or published object is attached, but no rebuild of it is recorded here.
Fidelity F2: The statement corpus cites this proof against its own statement.
number theory, primitive sets·Source
AI activity
How grades workNo AI contribution recorded against this statement.
Claimed on erdosproblems.com
1Proof claims posted on erdosproblems.com, which says that listing a claim “is no guarantee of proof correctness”. The register records who claims what, with which systems, and links to each claim there. Nobody has examined them, and none counts in the register's totals.
Fidelity
How fidelity is gradedF2 declared. The statement corpus cites this proof against its own statement.
Follow and discuss
All discussionFollow this problem
An email when it has a new claim, check, bounty or discussion. You confirm once and can stop with one click.
Discussion and bounties for this problem load here.
Seen recently
What the monitors picked up in the last thirty days, not yet graded.
Something wrong or missing here? Request a correction or add a claim, with its sources.
Claims and corrections from readers
All of themFormal material
Formal statements · 1
Also known as · 3
- https://www.erdosproblems.com/486
- https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/486.lean
- FormalConjectures/ErdosProblems/486.lean
Cite this record
qed.bot, “Erdős Problem 486: Logarithmic density for sets avoiding modular subsets”, https://qed.bot/s/erdos-486, as of 30 Sep 2026.