Erdős Problem #451
Erdős problem #451 · erdosproblems.com/451
Let be the least integer greater than for which has no prime factor in . How rapidly must grow?
- Result
- Proved(see note)
- Status
- Partial result
- AI contribution
- AI-discovered
- Method
- Argument
- Field
- Number Theory, Primes
- Posed by
- —
- Year posed
- 1979
- Years open
- 47y
- Solved
- 2026-06-18
- Model
- GPT-5.5 Pro
- Vendor
- OpenAI
- Collaborators
- —
- Verification
- Unreviewed
- Publication
- Preprint
- Significance
- 10 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What was actually shown
the conjectured superpolynomial growth is established; the sharper order remains open
Verification
Human-checked arXiv proof.