A common arrival-time law for five-digit Kaprekar dynamics
Fix five digit slots and let the integer base tend to infinity. For a uniformly chosen nonconstant ordered input, the first arrival time at a terminal cycle, divided by the base, converges, as the base grows through all integers, to one continuous law. We express that law through a fold and a counted shear on two digit differences, give a finite rational algorithm for its distribution function at rational arguments, and obtain certified moment bounds. Along each residue class of the base modulo three, the limiting time is independent of the terminal-cycle label, whose weights depend on that class. We determine the exact basin of the additional even-base two-cycle and prove that the maximum arrival time is B/3+√B/3+O(1). A conditional limit in a band of probability of order B^(-1) identifies the overshoot responsible for the square-root scale. The proofs separate the limiting geometry and weighted lattice arguments from explicit finite integer-affine checks, which are supplied with executable encodings; the reduction to the pair map, the core finite claims and the terminal enumeration are also verified in Lean 4. Preprint. The LaTeX source, reproduction bundle and data are archived in the record Kaprekar dynamics: papers, verification code and data (doi:10.5281/zenodo.24330159), and the code is at github.com/galyavin/kaprekar-dynamics. Prepared with substantial AI assistance under the author's direction and close supervision; the author takes responsibility for the contents. Contact: [email protected]
Authors
- Rustem Galyavin
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.5281/zenodo.24358745
- Primary Topic
- Mathematical Dynamics and Fractals
- Type
- preprint