# Erdős Problem 486: Logarithmic density for sets avoiding modular subsets

A statement in qed.bot, the register of claims of AI work in mathematics. The register grades the evidence attached to each claim; it never rules on whether a proof is correct.

- Identifier: erdos:486
- Collection: Erdős
- Page: https://qed.bot/s/erdos-486
- Formal record: solved; at its source: open
- Machine-checked: no independent check has verified it
- Fidelity F2: The statement corpus cites this proof against its own statement.
- Source: https://www.erdosproblems.com/486

## AI claims

No AI contribution is recorded against this statement.

## Claimed on erdosproblems.com

Proof claims posted on erdosproblems.com, which says that listing a claim is no guarantee of proof correctness. Nobody has examined them, and none counts in the register's totals.

- Shouqiao Wang, using GPT-5.6 Sol: a full proof claimed, 16 Jul 2026. Autonomy A?, evidence V0. https://www.erdosproblems.com/forum/thread/486/proof-claims#proof-claim-63

## Formal statements

- FormalConjectures/ErdosProblems/486.lean, https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/486.lean

Cite as: qed.bot, "Erdős Problem 486: Logarithmic density for sets avoiding modular subsets", https://qed.bot/s/erdos-486, as of 30 Sep 2026. The register's data is published under CC BY 4.0: https://creativecommons.org/licenses/by/4.0/