Source authenticated

Erdős Problem #709

upper bound improved to f(n) ≤ 14n^{3/7} with an explicit logarithmic lower bound; matching bounds remain open

Exact FrontierDelta

Prior state unknown→proved

Scope and record

Occurred: Jul 13, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: lean-verified. Publication: announcement. AI contribution: ai-discovered. Editorial metadata: CC BY 4.0; linked content retains its own rights.

Canonical aliases: Erdős Problem #709 · Erdős #709 · Problem 709

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)

upper bound improved to f(n) ≤ 14n^{3/7} with an explicit logarithmic lower bound; matching bounds remain open parent of this event

VibeMathed record: Erdős Problem #709 evidence for this event

Erdős Problem #709 evidence for this event

Erdős Problem #709 parent of this event

Act on this frontier

Verify, challenge, or extend the result.

Help verify Open canonical problem Explore evidence graph