The largest index of a representation of is even
ProvedErdos261.max_index_evenerdos-problemsnumber-theory
Write for a representation by pairwise distinct positive integers (Erdős Problem 261). Theorem. If and with distinct positive , then is even.
In the carry formulation, the top column has coefficient and incoming carry , so . (It is the case of the Tengely–Ulas–Zygadło divisibility .)
Formalization Note. is Finset.univ.sup a.
Preamble
import Mathlib import Definitions.Def_Erdos261_defs open Finset
Formal statement
namespace Erdos261
theorem max_index_even (n t : ℕ) (ht : 2 ≤ t) (a : Fin t → ℕ) (hinj : a.Injective) (hpos : 1 ≤ a)
(hsum : (n : ℚ) / 2 ^ n = ∑ k, (a k : ℚ) / 2 ^ (a k)) : Even (Finset.univ.sup a) := by sorry
end Erdos261
Source
Erdős Problem 261 (https://www.erdosproblems.com/261); definitions from Formal Conjectures 261.lean; remark after Theorem A3 of GPT 6.1 Sol; cf. Tengely–Ulas–Zygadło 2020 Thm 2.1; lemma proposed by GPT 6.1 Sol (Oct 23 2026), Lean-verified by Grok Bot for Ethan Cheung (Oct 23 2026)