Arrival times for the four-digit Kaprekar map in even bases

For the four-digit Kaprekar map in base B=m·2^n with m≥5 odd and n≥1, we determine the exact distribution of the number of steps an input needs to reach a given union of the cycles inherited from base m, which include all cycles but at most one. Its generating polynomial is an explicit sum over O_m(n) arithmetic progressions. As n grows through a residue class modulo the order of 2 modulo m, the arrival time divided by n converges to a law with atoms only at 1,2,3,4,5 and at infinity. For the bases 5·2^n, the proportion of inputs reaching the fixed point tends to 1033/1125 when n≡0 and to 94/125 when n≡2 (mod 4); Devlin and Zeng had conjectured 3/4 and 15/16. When instead the odd part grows, the number of steps needed to reach any cycle is within total variation 26/m of max(1,n+2−G), where G is geometric with ratio 1/4, uniformly in n and for every m. Preprint. The LaTeX source, reproduction bundle and data are archived in the record Kaprekar dynamics: papers, verification code and data (doi:10.5281/zenodo.24329321), 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

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24358743
Primary Topic
Smarandache Functions and Recreational Number Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Arrival times for the four-digit Kaprekar map in even bases

Rustem Galyavin
Zenodo (CERN European Organization for Nuclear Research)
Smarandache Functions and Recreational Number Theory
preprint

Arrival times for the four-digit Kaprekar map in even bases

Rustem Galyavin
preprint en

Abstract

For the four-digit Kaprekar map in base B=m·2^n with m≥5 odd and n≥1, we determine the exact distribution of the number of steps an input needs to reach a given union of the cycles inherited from base m, which include all cycles but at most one. Its generating polynomial is an explicit sum over O_m(n) arithmetic progressions. As n grows through a residue class modulo the order of 2 modulo m, the arrival time divided by n converges to a law with atoms only at 1,2,3,4,5 and at infinity. For the bases 5·2^n, the proportion of inputs reaching the fixed point tends to 1033/1125 when n≡0 and to 94/125 when n≡2 (mod 4); Devlin and Zeng had conjectured 3/4 and 15/16. When instead the odd part grows, the number of steps needed to reach any cycle is within total variation 26/m of max(1,n+2−G), where G is geometric with ratio 1/4, uniformly in n and for every m. Preprint. The LaTeX source, reproduction bundle and data are archived in the record Kaprekar dynamics: papers, verification code and data (doi:10.5281/zenodo.24329321), 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]

Zenodo (CERN European Organization for Nuclear Research)
Smarandache Functions and Recreational Number Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon