Erdős Problem a Daythe open tracker

Erdős Problem #208

OPENdatabase updated 2025-08-31

No proof or disproof is known, and it isn't known whether a finite computation could settle it.

What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).

The sequence of squarefree numbers, denoted by `s` as in Erdős problem 208.

Let \(s_1 < s_2 < \dots\) be the sequence of squarefree numbers. Is it true that for any \(\epsilon > 0\) and large \(n\), \(s_{n+1} - s_n \ll_\epsilon s_n^\epsilon\)?
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open · 2 further variants / known partial results in the Lean file. The authoritative wording is on erdosproblems.com/208.
Prizenone
Topicsnumber theory
Statement in LeanFormal Conjectures
Solution in Leanno
OEISA005117, A076259
Original pageerdosproblems.com/208
NOBODY HAS SENT US AN ATTEMPT YET

If you take a run at this one — with your own AI subscription or without — the guide says how, and the submission form gets you an honest read of what you found.