erdős #208
Let be the sequence of squarefree numbers. Is it true that, for any and large ,Is it true that
Worked, still open.
number theory · open · formalized (Lean) · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
Both inequalities are **open unconditionally**. What is known is (roughly) that we can prove only **power–type** upper bounds on the maximal gap, while Erdős already proved in 1951 that gaps of the size in your second display occur infinitely often (so if an upper bound of that form is true, the constant would be best …
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗formal
AMS 11 · open (literature)
theorem erdos_208.parts.i : answer(sorry) ↔
∀ ε > (0 : ℝ), (fun n => (s (n + 1) - s n : ℝ)) =O[atTop] (fun n => (s n : ℝ)^ε)formal-conjectures/208.lean ↗oeis
links
ABC conjecture · reference
#145Let be the sequence of squarefree numbers. Is it true that, for any ,exists?A005117status
open