{"id":"palomar/PALOMAR-2026-11-21-000001","url":"https://github.com/galyavin/kaprekar-cycles-lean/tree/fd7c7adeeb25a5127104cb601d1caf0ddf29abfd","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-21-000001-v1.json","repo":"https://github.com/galyavin/kaprekar-cycles-lean","tags":["math.NT","math.DS","msc:11A63","msc:37P99"],"score":0,"title":"Even bases with exactly one four-digit Kaprekar cycle","trust":"high","domain":"math.NT","source":"palomar","authors":["Rustem Galyavin"],"reviews":0,"subject":"math.NT","summary":"The four-digit Kaprekar map in base B sends an integer 0 = 2 has exactly one cycle if and only if B = 3*2^(2k+1) or B = 5*2^(2k+1) for some k >= 0, or B = 7*2^n with n >= 1 and n not divisible by 3. In these three families the unique cycle has length 6(k+1), 1 and 3, respectively; base ten is 5*2^1, with the fixed point 6174. This is Corollary 2 of R. Galyavin, \"Cycles of the four-digit Kaprekar map in even bases\" (2026). It proves the pattern that Chen, Ono, Schwartz and Thakur recorded from numerical evidence (J. Integer Seq. 29 (2026), Remark 28). The map is stated directly as digit…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-21","reactions":{},"formalized":true,"formalizes":[{"title":"Cycles of the four-digit Kaprekar map in even bases","identifier":"doi:10.5281/zenodo.24358739","relationship":"formalizes"}]}