Erdős Problem #450
How large must $y(\varepsilon, n)$ be so that every interval $(x, x+y)$ contains at most $\varepsilon y$ integers having a divisor in $(n, 2n)$? The candidate proof gives the sharp fixed-$\varepsilon$ order $y = \Theta_\varepsilon(n)$, uniformly in the translate.
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 #450 · Erdős #450 · Problem 450
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)