Work

Complete classification of decimal repdigit-shifted Kaprekar maps

Year: 2026
Type: preprint
Abstract: For n-digit decimal strings (leading zeros retained) and a digit c ∈ {0,…,9}, consider the shifted Kaprekar map F(x) = (Dₙ(x) − Aₙ(x) + c·Rₙ) mod 10ⁿ. Here Dₙ and Aₙ sort the digits in descending and ascending order, and Rₙ = (10ⁿ − 1)/9. Call (n,c) universal if every non-repdigit start reaches the same non-repdigit fixed point. We prove, with computer assistance, that for every n ≥ 5 the universal pairs are exactly (7,4), (13,7) and (22,7). Their fixed attractors are 3974085, 7642097543088 and 7654332108776443220988, and their sharp maximum iteration counts are 22, 27 and 49. The proof works on the multiplicities of paired digit differences, on which the map acts uniformly in the width. Explicit infinite fixed-point families and a persistent seven-cycle exclude every sufficiently large width. 375 explicit finite witnesses close the remaining negative cases. Complete quotient graphs (219, 5,004 and 167,959 states) settle the three positive cases. For n ≤ 4 the only universal pairs are the classical (3,0) and (4,0), with attractors 495 and 6174. For n ≥ 5 a universal shift must be 1, 4 or 7. The classification concerns only repdigit shifts c·Rₙ; other added constants (for example the non-repdigit constants of Savić 2026) are outside it and can behave differently. The release includes a standard-library-only Python verifier. It rechecks 114 unbounded fixed-state identities, seven unbounded cycle edges, 375 finite cases and all three positive graphs, and it enumerates every start for n ≤ 4 and every c. An optional independent Z3 audit is also included (199 queries, all UNSAT). These are reproducible computational checks, not peer review. Novelty and priority have not been established.
Language: English
Open Access status: green
OpenAlex ID: W7233590197
Cites:
Cited by:
Related to: