Source authenticated

Erdős Problem #959

superlinear lower bound M(n) ≥ n^{1 + 1/(50000 log log n)}, improving Ω(n log n); the exact order remains open

Exact FrontierDelta

Prior state unknownproved

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 #959 · Erdős #959 · Problem 959

Confidence: Not scored

Registry verification: lean verified · announcement · partial

Open the source record ↗

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)

Act on this frontier

Verify, challenge, or extend the result.

Erdős Problem #959 — Mathematical Frontier Network