qedbot

Erdős·erdos:266

Erdős Problem 266

problem formal record: solved source: disproved (Lean) F3 anchored

Machine-checked by Palomar.

Fidelity F3: The project checks its proof with Comparator against a statement from the Erdős collection of a corpus written separately from the proof, and held here.

irrationality·Source

AI activity

How grades work

No AI contribution recorded against this statement.

F3 anchored. The project checks its proof with Comparator against a statement from the Erdős collection of a corpus written separately from the proof, and held here.

Anchored to google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/266.lean

declares divergences from its source reviewed by its authors only source authors not contacted

Checks

1
  • verified·Palomar

    Registered by Palomar at ef01b238: Comparator confirmed 2 theorems prove the recorded statement within Palomar's axiom policy, replayed through Lean's kernel and the independent nanoda kernel

    project registered at a pinned commit·2026-10-12·commit ef01b23804a6

    PALOMAR-2026-08-20-000008

Declared by the projects

1

As each project's formalization.yaml states it.

Erdős problem #266: the Kovač–Tao disproof of Stolarsky's conjecturebenkeene/erdos266 · joined by anchor · Palomar

Read formalization.yaml

authors
Ben Keene
method
agent — Claude Fable 5 (Anthropic)
review
self-assessed (Ben Keene)
axioms
Classical.choice, Quot.sound, propext
sorry
0 unproved goals declared
results
2 main results named, checked with Comparator, with an alignment table
sources
On several irrationality problems for Ahmes series — formalizes, authors not-contacted; Erdős problem #266 (erdosproblems.com) — background; Formal Conjectures: ErdosProblems/266.lean — adapts
divergences
The arXiv abstract of [KoTa24] states the final construction for integer shifts (t in Z) only; the body of the paper proves more. Checked against arXiv v4 (14 Jul 2025): Erdos266.erdos_266_rational_shifts formalizes the statement of Theorem 2.11 — a strictly increasing sequence of positive integers whose shifted series converges to a rational for every t in Q avoiding {-a_n} — and Section 2.3 states explicitly that the conjecture is disproved "not only when t ranges over the integers" but for rational t. Erdos266.erdos_266 is the negative answer to Stolarsky's conjecture as recorded by Erdős–Graham (integer shifts t >= 1), implied by Theorem 2.11. "Converges to a rational" is rendered as HasSum toward the real embedding of a rational; for these series (all but finitely many terms positive) unconditional and ordered convergence agree.
checked by
Palomar

Follow and discuss

All discussion

Discussion and bounties for this problem load here.

Something wrong or missing here? Request a correction or add a claim, with its sources.

Formal material

Formal statements · 1
Cited proofs · 2
Also known as · 3
  • https://www.erdosproblems.com/266
  • https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/266.lean
  • FormalConjectures/ErdosProblems/266.lean

Cite this record

qed.bot, “Erdős Problem 266”, https://qed.bot/s/erdos-266, as of 20 Nov 2026.

This record as plain text, with each claim, its grades and its sources.