Erdős Problem #1188
Estimate the number $F(x)$ of minimal distinct covering systems whose moduli all lie in $[1, x]$. The candidate proof gives $\log\log F(x)/\log x \to 1$, i.e. $F(x) = \exp(x^{1+o(1)})$.
Exact FrontierDelta
Scope and record
Occurred: Jul 13, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: lean-verified. Publication: announcement. AI contribution: ai-discovered. Imported under CC BY 4.0.
Canonical aliases: Erdős Problem #1188 · Erdős #1188 · Problem 1188
Confidence: Not scored
Registry verification: lean verified · announcement · candidate
Attribution
VibeMathed
registry · event recorded by
GPT-5.6 starships (Claude Fable 5 reviewer)
model · ai model contributor · OpenAI / Anthropic
Lineage and corrections
This event attributed to GPT-5.6 starships (Claude Fable 5 reviewer)