Author:
Yamagami Atsushi,Matsui Yūki
Abstract
Let b ≥ 2 and n ≥ 2 be integers. For a b-adic n-digit integer x, let A (resp. B) be the b-adic n-digit integer obtained by rearranging the numbers of all digits of x in descending (resp. ascending) order. Then, we define the Kaprekar transformation T ( b , n ) ( x ) : = A - B . If T ( b , n ) ( x ) = x , then x is called a b-adicn-digit Kaprekar constant. Moreover, we say that a b-adic n-digit Kaprekar constant x is regular when the numbers of all digits of x are distinct. In this article, we obtain some formulas for regular and non-regular Kaprekar constants, respectively. As an application of these formulas, we then see that for any integer b ≥ 2 , the number of b-adic odd-digit regular Kaprekar constants is greater than or equal to the number of all non-trivial divisors of b. Kaprekar constants have the symmetric property that they are fixed points for recursive number theoretical functions T ( b , n ) .
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference8 articles.
1. On 2-adic Kaprekar constants and 2-digit Kaprekar distances
2. Another solitaire game;Kaprekar;Scr. Math.,1949
3. An interesting property of the number 6174;Kaprekar;Scr. Math.,1955
4. A variation on the two-digit Kaprekar routine;Young;Fibonacci Q.,1993
5. The Determination of Kaprekar Convergence and Loop Convergence of All Three-Digit Numbers
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Hunting for Kaprekar constants;AIP Conference Proceedings;2023