Maximum distances in the four-digit Kaprekar process
From MaRDI portal
Publication:3390073
zbMath1492.11011arXiv2010.11756MaRDI QIDQ3390073
Publication date: 24 March 2022
Full work available at URL: https://arxiv.org/abs/2010.11756
Exact enumeration problems, generating functions (05A15) Recurrences (11B37) Radix representation; digital problems (11A63) Recreational mathematics (00A08)
Uses Software
Cites Work
- On 2-adic Kaprekar constants and 2-digit Kaprekar distances
- Searching for Kaprekar's constants: algorithms and results
- The Determination of Kaprekar Convergence and Loop Convergence of All Three-Digit Numbers
- Terminating cycles for iterated difference values of five digit integers.
- A bound on Kaprekar constants.
- A classification of Kaprekar constant
- Kaprekar's Routine with Five-Digit Integers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item