Off-centre Kaprekar cycles with positive basin density
Year: 2026
Type: preprint
Abstract: Choose an ordered nonconstant word of fixed odd length n uniformly in base B, allowing leading zeros. At the centred profile the normalized differences between the ith largest and ith smallest digits, together with the endpoints 0 and 1, are equally spaced. At each of 47 explicitly listed lengths n there are B_n and c_n > 0 such that, for every base B ≥ B_n, with probability at least c_n the orbit of the word ends on a Kaprekar cycle whose peak normalized distance from the centred profile exceeds a fixed δ_n > 0; for the inputs constructed in the proofs, every state of the orbit stays at least that far. The 47 lengths are all those whose folded order (the least r with 2^r ≡ ±1 (mod n)) lies between three and thirteen and which admit a gap profile, invariant under folded doubling, that satisfies certain strict inequalities; each is certified by a finite computation, and larger folded orders are not treated. At each of lengths 45 and 91, for each p ∈ {24, 132}, the probability of reaching a cycle of least period p near the same profile is bounded below by a positive constant for all sufficiently large bases. At thirteen digits two disjoint sets of inputs, each of probability bounded below for all large bases divisible by seven, reach the same period-177 cycle in those bases. Every phase of this last cycle has normalized radius at most 24/B, which tends to zero. The proof constructs full-rank integer families by inserting guarded translations into finite reference trajectories and then realizes the resulting orbits as actual subtractions with exact input weights. Preprint. The LaTeX source, reproduction bundle and data are archived in the record Kaprekar dynamics: papers, verification code and data (doi:10.5281/zenodo.24399274), 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. Author's website: galyavin.com. Contact: [email protected]
Author: Galyavin, Rustem
Language: English
Subfield: Mathematical Physics
Field: Mathematics
Domain: Physical Sciences
Keyword: digit permutations
Open Access status: green
OpenAlex ID: W7237218612
