Erdős Problem #942
lower bound improved to ≫ log n/(log log n · log log log n) infinitely often; the extremal order remains open
Exact FrontierDelta
Scope and record
Occurred: Jun 14, 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 #942 · Erdős #942 · Problem 942
Confidence: Not scored
Registry verification: lean verified · announcement · partial
Attribution
VibeMathed
registry · event recorded by
Claude
model · ai model contributor · Anthropic / OpenAI / Harmonic
Codex
model · ai model contributor · Anthropic / OpenAI / Harmonic
Aristotle
model · ai model contributor · Anthropic / OpenAI / Harmonic
Lineage and corrections
This event attributed to Codex
This event attributed to Aristotle
This event attributed to Claude
Erdős Problem #942 evidence for this event
VibeMathed record: Erdős Problem #942 evidence for this event
Erdős Problem #942 parent of this event
lower bound improved to ≫ log n/(log log n · log log log n) infinitely often; the extremal order remains open parent of this event
Act on this frontier