Seven-digit Kaprekar dynamics: global law, two clocks, parity
Choose a nonconstant ordered word of seven base-B digits uniformly, allowing leading zeros. Under repeated Kaprekar subtraction let T_B be its first arrival time at a cycle. Along the bases of either parity, the normalized starting differences and T_B/B have a joint weak limit. At almost every starting point the conditional time has two atoms. The faster time has probability 3/8 in odd bases and either 1/2 or 3/4 in even bases. Both marginal laws have support [0,1/4], and the even law has strictly smaller mean. We prove that every arrival time is at most 54B+614132 for B ≥ 400. All positive moments and all fixed exponential moments converge along each parity. At first arrival the normalized differences converge uniformly to (3/4,1/2,1/4). The proof combines an almost-everywhere entry theorem for a piecewise affine map with exact integer returns and a computer-assisted potential inequality. Preprint. The LaTeX source, reproduction bundle and data are archived in the record Kaprekar dynamics: papers, verification code and data (doi:10.5281/zenodo.24346853), 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.24358751
- Primary Topic
- Mathematical Dynamics and Fractals
- Type
- preprint