Cycles of the four-digit Kaprekar map in even bases

In base ten, repeatedly subtracting the ascending arrangement of four digits from the descending one sends every input whose digits are not all equal to Kaprekar's constant 6174. We determine all cycles of this map in every even base. Writing the base as m·2^n with m odd and m≥5, the cycles are the lifts of the cycles of the odd base m, obtained by scaling their difference pairs by 2^n, together with at most one more: a cycle of length n+1 when 2^n≡1 (mod m), and a cycle of length 2(n+1) when m=5 and n≡2 (mod 4); for m=5 this recovers a theorem of Hasse and Prichett. The cases m=1 and m=3 are described completely. In particular, the even bases with exactly one cycle are 3·2^(2k+1), 5·2^(2k+1) and 7·2^n with 3∤n, as recorded from numerical evidence by Chen, Ono, Schwartz and Thakur. The classification is verified in Lean 4. Preprint. Revised 18 November 2026 to credit earlier work; first released 17 November 2026. The LaTeX source, reproduction bundle and data are archived in the record Kaprekar dynamics: papers, verification code and data (doi:10.5281/zenodo.24343078), 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.24358738
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

Cycles of the four-digit Kaprekar map in even bases

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

Cycles of the four-digit Kaprekar map in even bases

Rustem Galyavin
preprint en

Abstract

In base ten, repeatedly subtracting the ascending arrangement of four digits from the descending one sends every input whose digits are not all equal to Kaprekar's constant 6174. We determine all cycles of this map in every even base. Writing the base as m·2^n with m odd and m≥5, the cycles are the lifts of the cycles of the odd base m, obtained by scaling their difference pairs by 2^n, together with at most one more: a cycle of length n+1 when 2^n≡1 (mod m), and a cycle of length 2(n+1) when m=5 and n≡2 (mod 4); for m=5 this recovers a theorem of Hasse and Prichett. The cases m=1 and m=3 are described completely. In particular, the even bases with exactly one cycle are 3·2^(2k+1), 5·2^(2k+1) and 7·2^n with 3∤n, as recorded from numerical evidence by Chen, Ono, Schwartz and Thakur. The classification is verified in Lean 4. Preprint. Revised 18 November 2026 to credit earlier work; first released 17 November 2026. The LaTeX source, reproduction bundle and data are archived in the record Kaprekar dynamics: papers, verification code and data (doi:10.5281/zenodo.24343078), 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