Completeness of two floor-doubling sequences

Primarily AI-generated textHuman understanding: no partsmath.NT — Number Theory

Contributed by Jensen Kohlmeyer, Liam Kruer ↗

Version 1 / Nov 21, 2026 / CC BY 4.0

Abstract

We prove that, whenever α,β>0\alpha,\beta>0 and α/β\alpha/\beta is irrational, every sufficiently large integer is a sum of distinct indexed terms of the two sequences (⌊2nα⌋)n≥0(\lfloor 2^n\alpha\rfloor)_{n\ge0} and (⌊2nβ⌋)n≥0(\lfloor 2^n\beta\rfloor)_{n\ge0}. This answers the doubling case of Erdős problem 354 affirmatively. Missing sums induce a nonproduct invariant coupling of symbolic tower systems. Two binary carry estimates force incompatible conclusions about digit transport and zero runs. The linked Lean proof checks the original indexed-sum formulation.

Author comments: Joint base-two manuscript accompanying Justin Sun Prize submission JSP-000294. Pinned Lean sources and verification: https://github.com/JENW1N/complete-math-solutions/tree/af9feb6c310f5cea035e4ec34400c43fec01817e/proofs/erdos354

Provenance statement

The manuscript acknowledges substantial OpenAI Codex assistance with mathematical exploration, the argument, the Lean formalization, and manuscript preparation. This TeX edition preserves the joint base-two proof and links the later pinned verification record.

References

  1. T. F. Bloom, Erdős Problem #354 , https://www.erdosproblems.com/354.link
  2. P. Erdős and R. L. Graham, Old and new problems and results in combinatorial number theory , Monographies de L'Enseignement Mathématique 28, Université de Genève, Geneva, 1980.
  3. The Formal Conjectures Authors, Formal Conjectures , file FormalConjectures/ErdosProblems/354.lean , https://github.com/google-deepmind/formal-conjectures. The exact revision used here is recorded in Section sec:formal .link
  4. R. L. Graham, On sums of integers taken from a fixed sequence , Proceedings of the Washington State University Conference on Number Theory (1971), 22--40. https://mathweb.ucsd.edu/~ronspubs/71_08_integer_sums.pdf.link
  5. N. Hegyvári, Some remarks on a problem of Erdős and Graham , Acta Math. Hungar. 53 (1989), 149--154.
  6. N. Hegyvári, On Boolean functions defined on bracket sequences , Discrete Math. Lett. 12 (2023), 45--49. https://doi.org/10.47443/dml.2022.209.DOI
  7. L. de Moura and S. Ullrich, The Lean 4 theorem prover and programming language (system description) , Automated Deduction---CADE 28 (2021). https://lean-lang.org/papers/lean4.pdf.link
  8. The mathlib Community, The Lean mathematical library , Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programming and Proofs (2020). https://arxiv.org/abs/1910.09336.link

Version history

  1. v1 · 13 pagesSubmitted by Liam KruerJoint base-two manuscript accompanying Justin Sun Prize submission JSP-000294. Pinned Lean sources and verification: https://github.com/JENW1N/complete-math-solutions/tree/af9feb6c310f5cea035e4ec34400c43fec01817e/proofs/erdos354CurrentNov 21, 2026