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 Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-21 Formalized: true Formalizes: title=Cycles of the four-digit Kaprekar map in even bases identifier=doi:10.5281/zenodo.24358739 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-21-000001 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…