Arithmetic selection of arrival times in eleven-digit Kaprekar dynamics
Year: 2026
Type: preprint
Abstract: Take a uniformly random nonconstant eleven-digit word in base B, allowing leading zeros, and let T_B be the number of Kaprekar subtractions to its first cyclic word. It is known that T_B/B is tight and that the normalized symmetric differences of the first cyclic word converge in probability through all bases. We show that the joint law of the normalized input and T_B/B nevertheless depends on the arithmetic of B. A fixed bounded test separates the subsequential limits along bases congruent to 0 and 1 modulo 6, so this joint law has no limit through all bases. On a small rectangle of initial gaps the conditional joint law converges along each class of Bmod 6 to six distinct explicit mixtures of affine clock graphs; hence the joint law converges along no arithmetic progression whose modulus is not divisible by 6. On a second box the conditional joint law converges along each of the classes B≡5 and B≡11 (mod 12), to two distinct explicit laws whose largest difference on [0,1]-valued tests is 17/7128. Hence, if the joint law converged along every class modulo N, then 12 would divide N. On this box a translation of the input matches arrival times at bases twelve apart. Whether the full joint law converges along the classes modulo 12 remains open. The proofs use computer-assisted certificates of affine routes and their lattice weights. Preprint. The LaTeX source, reproduction bundle and data are archived in the record Kaprekar dynamics: papers, verification code and data (doi:10.5281/zenodo.24371697), 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]
Author: Galyavin, Rustem
Language: English
Subfield: Mathematical Physics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236708886
