Delphi.science

Cycles of the four-digit Kaprekar map in even bases

Source: github.com/galyavin/kaprekar-cycles-lean/tree/da1c63f6fe2a2…

Rustem Galyavin

Palomar Registrypalomar/PALOMAR-2026-11-21-000006Nov 21, 2026math.NTscore 0

The four-digit Kaprekar map in base B sends an integer 0 = 1 and m >= 5, each cycle of the folded map on odd difference pairs lifts to a cycle of the same length. There is one additional cycle of length n+1 if 2^n is 1 modulo m, or one of length 2(n+1) if m = 5 and n is 2 modulo 4. The two conditions are mutually exclusive and the list is exhaustive. For m = 3, odd n gives one cycle of length 3(n+1), and even n gives two cycles of lengths n+1 and 2(n+1). Base two has two fixed points. In base 2^n for odd n >= 3 there are (n-1)/2 cycles of each length n and n+2. For even n >= 2 there are…

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-21-000006
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-21-000006/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-21-000006/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'