Maximum distances in the four-digit Kaprekar process

MaRDI QIDQ3390073zbMATH OpenFDO

Authors Pat Devlin, Tony Zeng

Publication date 24 March 2022

Full work available at URL https://arxiv.org/abs/2010.11756, http://math.colgate.edu/~integers/v97/v97.pdf

zbMATH Keywords

difference pairsdigitsfixed pointsiteration

Mathematics Subject Classification ID

Recreational mathematics (00A08) Exact enumeration problems, generating functions (05A15) Radix representation; digital problems (11A63) Recurrences (11B37)

Abstract: For natural numbers $x$ and $b$, the classical Kaprekar function is defined as $K_b(x)=D-A$, where $D$ is the rearrangement of the base-$b$ digits of $x$ in descending order and $A$ is ascending. The bases $b$ for which $K_b$ has a $4$-digit non-zero fixed point were classified by Hasse and Prichett, and for each base this fixed point is known to be unique. In this article, we determine the maximum number of iterations required to reach this fixed point among all four-digit base-$b$ inputs, thus answering a question of Yamagami. Moreover, we also explore---as a function of $b$---the fraction of four-digit inputs for which iterating $K_b$ converges to this fixed point.

Recommendations

• Searching for Kaprekar's constants: algorithms and results
• The Determination of Kaprekar Convergence and Loop Convergence of All Three-Digit Numbers
• Fixed points and cycles of the Kaprekar transformation. I: Odd bases
• Das Kaprekar-Problem in der Sicht der Computer-Mathematik. (Kaprekar's problem from the viewpoint of computer mathematics)
• On 3-adic Kaprekar loops

Cites work

• A bound on Kaprekar constants.
• A classification of Kaprekar constant
• scientific article; zbMATH DE number 3700926 (Why is no real title available?)
• scientific article; zbMATH DE number 179311 (Why is no real title available?)
• scientific article; zbMATH DE number 3572254 (Why is no real title available?)
• scientific article; zbMATH DE number 3636092 (Why is no real title available?)
• scientific article; zbMATH DE number 845724 (Why is no real title available?)
• Kaprekar's Routine with Five-Digit Integers
• On 2-adic Kaprekar constants and 2-digit Kaprekar distances
• Searching for Kaprekar's constants: algorithms and results
• Terminating cycles for iterated difference values of five digit integers.
• The Determination of Kaprekar Convergence and Loop Convergence of All Three-Digit Numbers

Cited in

(6)

• Das Kaprekar-Problem in der Sicht der Computer-Mathematik. (Kaprekar's problem from the viewpoint of computer mathematics)
• Searching for Kaprekar's constants: algorithms and results
• The Determination of Kaprekar Convergence and Loop Convergence of All Three-Digit Numbers
• Dihedral symmetry in Kaprekar's problem
• Fixed points and cycles of the Kaprekar transformation. I: Odd bases
• Four-digit Kaprekar dynamics in odd bases

Describes a project that uses

Uses Software

• Kaprekar Series Generator

This page was built for publication: Maximum distances in the four-digit Kaprekar process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3390073)