Erdős Problem #394

Erdős problem #394 · erdosproblems.com/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.

Result

Proved

Status

Candidate (review pending)

AI contribution

AI-discovered

Method

Argument

Field

Number Theory, Multiplicative

Posed by

—

Year posed

—

Years open

—

Solved

2026-07-13

Model

GPT-5.6 starships (Claude Fable 5 reviewer)

Vendor

OpenAI / Anthropic

Collaborators

—

Verification

Lean-verified

Publication

Announced

Significance

10 / 100*

Disclosed cost

—

Wikipedia

No dedicated article