Erdős Problem #394
For the least $t_k(n)$ with $n \mid t_k(n)(t_k(n)+1)\cdots(t_k(n)+k-1)$, do the conjectured logarithmic-saving and adjacent-length estimates hold on average? Both answered affirmatively, with $c = 1/2048$ admissible in the $t_2$ bound.
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 #394 · Erdős #394 · Problem 394
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)