Work

Linear-time access for eleven-digit Kaprekar dynamics

Year: 2026
Type: preprint
Abstract: Apply Kaprekar subtraction to a uniformly random nonconstant eleven-digit string in base B, allowing leading zeros, and let q_i be the difference between its i-th largest and i-th smallest digits. With probability tending to one as B → ∞ through all bases, the six gaps B − q_1, q_1 − q_2, …, q_4 − q_5, q_5 are simultaneously at least ⌈(B+1)/7⌉ + 64 at some step within 4509B subtractions. Consequently the first cyclic-word time divided by B is tight, and the symmetric differences of that first cyclic word, divided by B, converge in probability to (5,4,3,2,1)/6. The proof combines almost-everywhere entry for the continuous leading map with a stopped energy estimate for actual subtraction. Near one family of leading cycles, a change in the borrowed digit order contributes with the sign required for energy decrease. Exact cycles that never reach this gap condition occur in three residue classes of bases. Preprint. The LaTeX source, reproduction bundle and data are archived in the record Kaprekar dynamics: papers, verification code and data (doi:10.5281/zenodo.24358476), 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]
Language: English
Open Access status: green
OpenAlex ID: W7236795778
Cites:
Cited by:
Related to: 10