Root block digits carry
ProvedErdosProblems.Erdos1049.PaperR13.root_block_digits_carryerdos-1049formalizationlambert-series
In the displayed carry range ell≤a mod ell+h<2ell, the quotient and remainder of a+t ell+h are a/ell+t+1 and a mod ell+h−ell.
Preamble
import Definitions.Def_ErdosProblems_Erdos1049_QBinomialUnitIdentity import Definitions.Def_ErdosProblems_Erdos1049_ZudilinConeArithmetic import Definitions.Def_ErdosProblems_Erdos1049_PaperOmegaIndicatorR7 import Definitions.Def_ErdosProblems_Erdos1049_SourcePolynomialR11 import Definitions.Def_ErdosProblems_Erdos1049_SourceBClearingR12 import Definitions.Def_ErdosProblems_Erdos1049_GaussianDegreeR12 import Definitions.Def_ErdosProblems_Erdos1049_SourceFiniteTransformR12 import Definitions.Def_ErdosProblems_Erdos1049_SourceHomogeneousR12 import Definitions.Def_ErdosProblems_Erdos1049_RootUnityLocalCancellationR13 import Definitions.Def_ErdosProblems_Erdos1049_SourceBMonomialR12 import Definitions.Def_ErdosProblems_Erdos1049_SourceBTopDegreeR13 import Definitions.Def_ErdosProblems_Erdos1049_SourceRootCarriesR13 import Definitions.Def_ErdosProblems_Erdos1049_SourceRootBlocksR13 import Mathlib import Mathlib.Algebra.BigOperators.Group.Finset.Basic import Mathlib.Algebra.BigOperators.Ring.Finset import Mathlib.Algebra.Order.Floor.Ring import Mathlib.Algebra.Polynomial.Coeff import Mathlib.Algebra.Polynomial.Eval.Defs import Mathlib.Data.Fintype.Pigeonhole import Mathlib.Data.Nat.Choose.Basic import Mathlib.Data.Real.Basic import Mathlib.Data.ZMod.Basic import Mathlib.Data.ZMod.Coprime import Mathlib.RingTheory.Polynomial.Cyclotomic.Basic import Mathlib.Tactic namespace PaperR11 end PaperR11 namespace PaperR12 end PaperR12 open ErdosProblems open ErdosProblems.Erdos1049 open ErdosProblems.Erdos1049.PaperR13 open Polynomial PaperR11 PaperR12 Finset open scoped BigOperators open ErdosProblems.Erdos1049.PaperR13 open ErdosProblems.Erdos1049.PaperR11 open ErdosProblems.Erdos1049.PaperR12
Formal statement
theorem ErdosProblems.Erdos1049.PaperR13.root_block_digits_carry (a t h ell : ℕ) (hell : 0 < ell)
(hlo : ell ≤ a % ell + h) (hhi : a % ell + h < 2 * ell) :
(a + t * ell + h) / ell = a / ell + t + 1 ∧
(a + t * ell + h) % ell = a % ell + h - ell := by sorry
Source
Pinned Lean source: https://github.com/wcook04/plectis-erdos-lean/blob/c93c2e4dd86a2e317e0cb650ea244fee1afd59c2/ErdosProblems/Erdos1049/SourceRootBlocksR13.lean#L42-L57
Paper exposition and prior-art bibliography: https://github.com/wcook04/plectis-erdos/blob/551bae6dc6e732cf85172d66323c8d2bc77ba962/paper/1049/erdos-1049-rational-base-lambert.tex#L1252-L1257
Correspondence: Erdős #1049 formal source; the rational-base Lambert-series method follows Zudilin, without a novelty or universal rational-base claim.