The equation has no solutions with
ProvedErdos261.no_second_phase_diopherdos-problemsnumber-theory
Theorem. For all integers and ,
With one has for , and , so . In Erdős Problem 261 this equation describes greedy termination right after the first doubling phase (see no_two_phase_termination).
Preamble
import Mathlib import Definitions.Def_Erdos261_defs open Finset
Formal statement
namespace Erdos261 theorem no_second_phase_dioph (j r t : ℕ) (ht : 1 ≤ t) : r * (2 ^ (t + 1) - 1) ≠ 2 ^ (j + 1) + t - 1 := by sorry end Erdos261
Source
Erdős Problem 261 (https://www.erdosproblems.com/261); greedy carry as in Borwein–Loring 1990 / Tengely–Ulas–Zygadło 2020 (platform def Def_Erdos261_defs); Claim A2 of claim from GPT 6.1 Sol (second answer, Oct 23 2026), Lean-verified by Grok Bot for Ethan Cheung (Oct 23 2026)