International Journal of Mathematical Sciences and Computing (IJMSC)
IJMSC Vol. 10, No. 3, 8 Sep. 2024
Cover page and Table of Contents: PDF (size: 353KB)
Author(s)
K. L. Verma
1,*
Index Terms
Weird numbers, Number theory, kernel, generalized algorithm, converges
Abstract
In this paper, using computer algebra system a new generalized algorithm is developed to study and generalize the Kaprekar’s operation which can be used for desired numbers of iterations and is also applicable to any n-digits number which is greater than or equal to two. Existing relevant results are verified with the available results in literature and further extended to examine the difference (kernel) of the obtained number during the process with the number obtained in preceding iteration after each step. Sum of the digits of an acquired number obtained after each step is also noticed and found that sum of its digits is divisible by 9. A detailed investigation is conducted for all two-digit number and the output acquired is exhibited in tabular form which has not been studied in earlier. An 8-digits number also considered and found that it does not converges to a unique kernel like 3-digits and 4-digits, but follows a regular pattern after initial iteration. Analytical illustrations are provided along with pictorial representations for 2-digits, 3-digits 4-digits and 8-digits number. This algorithm can further be employed for numbers having any number of digits.
Cite This Paper
K. L. Verma, "Generalized Algorithm on idiosyncrasy of Numbers", International Journal of Mathematical Sciences and Computing(IJMSC), Vol.10, No.3, pp. 1-7, 2024. DOI: 10.5815/ijmsc.2024.03.01
Reference
[1]D. R. Kaprekar, “An Interesting Property of the Number 6174”, Scripta Mathematica, vol. 21, p. 304. December 1955.
[2]D. R. Kaprekar, “On Kaprekar Numbers”, Journal of Recreational Mathematics, vol. 13(2), pp. 81–82, 1980.
[3]Y. A. Ludington, “A variation on the two-digit Kaprekar routine”, English Zbl 0776.11004, Fibonacci Q., 31(2), pp. 81–82, 1993.
[4]C. W. Trigg, “Kaprekar’s Routine with Two-Digit Integers”, English) Zbl 0776.11004, Fibonacci Q., vol. 9(2), pp. 189–193,1971.
[5]A. L. Ludington, “A Bound on Kaprekar Constants,” J. Reine Agnew. Math., vol. 310, pp.196–203, 1979.
[6]M. Jeger, “The Kaprekar-number 6174. A computer approach in the field of elementary number theory,” Die Kaprekar-Zahl 6174, Ein Computer-Approach auf dem Felde der elementaren Zahlentheorie, MathEduc, 1984.
[7]K. E Eldridge, S. Sagong, “The Determination of Kaprekar Convergence and Loop Convergence of All Three-Digit Numbers,” The American Mathematical Monthly, vol.95(2), pp.105–112, 1988.
[8]R. P. Kumar,“On the number 495 - a constant similar to Kaprekar’s constant,” Ein ComputerApproach aufem Felde der elementaren Zahlentheorie, MathEduc, 2002.
[9]K. L. Verma, “On the weirdness of some numbers in Mathematics,” Proceedings of International Conference on Mathematics in Space and Applied Sciences (ICMSAS-2019), pp. 117–123. 2019.
[10]Y. Nishiyama, “The weirdness of number 6174,” The American Mathematical Monthly, vol.80(3), pp.363–373, 2012.
[11]S. Naranan, “Kaprekar Constant”, 275653923 34.5, https://www.researchgate.net.
[12]M. P. Kailas, N . P. Shah, Kaprekar, “Numbers and its Analog Equations,” International Journal of Mathematical Archive, vol. 7(6), pp. 126–134, 2016.