VibeMathedMath problems solved by AI
All problems

Erdős Problem #709

Erdős problem #709 · erdosproblems.com/709

How long must an interval be to contain distinct representatives xix_i, with aixia_i \mid x_i, for every nn-element set of moduli A={a1,,an}A = \{a_1, \dots, a_n\}?

Result
Proved(see note)
Status
Partial result
AI contribution
AI-discovered
Method
Argument
Field
Extremal Divisibility
Posed by
Year posed
1959
Years open
67y
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

What was actually shown

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

What the AI did

Produced by the GPT-5.6 starships pipeline with Claude Fable 5 as reviewer.

Verification

Lean-checked construction; community status pending.

Source

erdosproblems.com/709

Discussion