Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Kaprekar's routine
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Determination of Kaprekar numbers== In the following, "Kaprekar's constant {{mvar|k}}" refers to a number that become positive fixed point {{mvar|k}} as result of the Kaprekar's routine. In 1981, G. D. Prichett, et al. showed that the Kaprekar's constants are limited to two numbers, 495 (3 digits) and 6174 (4 digits).{{sfn|Prichett|1981}} They also classified the Kaprekar numbers into four types, but there was some overlap in the classification. In 2005, Y. Hirata calculated all fixed points up to 31 [[decimal]] digits and examined their distribution.{{sfn|Hirata|2005}} In 2024, Haruo Iwasaki{{sfn|Iwasaki|2024}} of the Ranzan Mathematics Study Group <small>(headed by Kenichi Iyanaga)</small> showed that in order for a natural number to be a Kaprekar number, it must belong to one of five mutually disjoint sets composed of combinations of the seven numbers 495, 6174, 36, 123456789, 27, 124578 and 09. Iwasaki also showed that this new classification using the five sets includes a corrected classification by Prichett, et al. As a result, if {{mvar|n}} is considered as a constant, then the number of decimal {{Mvar|n}}-digit Kaprekar numbers is determined by two types of equations: : (1) <math>n=3x \quad\quad (x\geq1)\,,</math> ......... For the sequence of {{mvar|x}} 3-digit constants 495 : (2) <math>n=4+2x \quad (x\geq0)\,,</math> ...... Sequence of 4-digit constant 6174 followed by {{mvar|x}} 2-digit constants 36 or by three types of Diophantine equations: : (3) <math>n=9x+2y \quad (x\geq1,\ y\geq0)\,,</math> ......... Sequence of {{mvar|x}} 123456789's and {{mvar|y}} 36's : (4) <math>n=9x+14y \quad (x\geq1,\ y\geq1)\,,</math> ...... Sequence of {{mvar|x}} 123456789's and {{mvar|y}} (36 495495 272727)s : (5) <math>n=6x+2y+9z+2u \quad (x\geq1,\ y\geq1,\ z\geq0,\ u\geq0)\,.</math> ... Sequence of 124578's, 09's, 123456789's and 36's It was found that the number of integer solutions (sets of {{Math|''x''~''u''}}) of the equations that can be established is the same as the number of solutions that express all of the {{Mvar|n}}-digit Kaprekar numbers.{{sfn|Iwasaki|2024}} The above equations confirm that there are no other Kaprekar's constants than 495 and 6174. There are no Kaprekar numbers for 1, 2, 5, or 7 digits, since they do not satisfy any of equations (1)~(5). For six-digit numbers, there are two solutions that satisfy equations (1) and (2).<ref>For six-digit numbers, i.e. {{mvar|n}}=6, (1) 6=3Γ2 and (2) 6=4+2Γ1. From these solutions (1) {{mvar|x}}=2 and (2) {{mvar|x}}=1, we obtain 495 495 and 6174 36, respectively. Applying {{mvar|f}} to these solutions gives us the numbers 549945 and 631764, that are Kaprekar numbers. In fact, {{mvar|f}} (549945)=549945, and {{mvar|f}} (631764)=631764.</ref> Furthermore, it is clear that even-digits with greater than or equal to 8,<ref>For even-digits greater than or equal to 8, there are at least two solutions that satisfy equations (2) and (5).</ref> and with 9 digits,<ref>For 9 digits, there are at least two solutions: (1) with {{mvar|x}}=3, and (3) with ({{mvar|x}}=1, {{mvar|y}}=0).</ref> or odd-digits with greater than or equal to 15 digits<ref>For 15 digits, there are at least two solutions: (1) with {{mvar|x}}=5, and (3) with ({{mvar|x}}=1, {{mvar|y}}=3). For odd digits 17 or greater, there are two solutions that satisfy equations (3) and (5).</ref> have multiple solutions. Although 11-digit and 13-digit numbers have only one solution, it forms a loop of five numbers and a loop of two numbers, respectively.<ref>The 11-digit number 86420987532 forms a loop with period of 5, and the 13-digit number 8733209876622 forms a loop with period of 2.</ref> Hence, Prichett's result that the Kaprekar's constants are limited to 495 (3 digits) and 6174 (4 digits)<ref>For three digits, we get 495 from the solution of (1) with {{mvar|x}}=1. And for four digits, we get 6174 from the solution of (2) with {{mvar|x}}=0.</ref> is verified. Therefore, the problem of determining all of the Kaprekar's constants and the number of these was solved.{{sfn|Iwasaki|2024}} An example below will explain the Iwasaki's result. '''Example''': In the case where decimal digits {{Math|1=''n'' = 23}}, since {{mvar|n}} is an odd number and is not a multiple of 3, the equations (1) and (2) do not hold, and the only equations that can hold are (3), (4) and (5). And if the operation (denoted by {{Math|1=''K''<sub>10</sub>}} ) defined above is applied once to the numbers corresponding to the solutions of these equations, seven Kaprekar numbers can be obtained. (3) The solution to {{Math|1=23 = 9''x'' + 2''y''}} is : {{Math|1=(''x'', ''y'') = (1, 7)}} : ...... Sequence of a 123456789 followed by seven 36's :: {{Math|1=''K''<sub>10</sub> (123456789 36363636363636) = 86433333331976666666532}}. (4) The solution to {{Math|1=23 = 9''x'' + 14''y''}} is : {{Math|1=(''x'', ''y'') = (1, 1)}} : ...... Sequence of 123456789 followed by 36 495495 272727 :: {{Math|1=''K''<sub>10</sub> (123456789 36 495495 272727) = 87765443219997765543222}}. (5) The solutions to {{Math|1=23 = 6''x'' + 2''y'' + 9''z'' + 2''u''}} are : {{Math|1=(''x'', ''y'', ''z'', ''u'') = (1, 4, 1, 0)}} : ...... Sequence of 124578, four 09's and 123456789 :: {{Math|1=''K''<sub>10</sub> (124578 09090909 123456789) = 99998765420987543210001}}, : {{Math|1=(''x'', ''y'', ''z'', ''u'') = (1, 3, 1, 1)}} : ...... Sequence of 124578, three 09's, 123456789 and 36 :: {{Math|1=''K''<sub>10</sub> (124578 090909 123456789 36) = 99987654320987654321001}}, : {{Math|1=(''x'', ''y'', ''z'', ''u'') = (1, 2, 1, 2)}} : ...... Sequence of 124578, two 09's, 123456789 and two 36's :: {{Math|1=''K''<sub>10</sub> (124578 0909 123456789 3636) = 99876543320987665432101}}, : {{Math|1=(''x'', ''y'', ''z'', ''u'') = (1, 1, 1, 3)}} : ...... Sequence of 124578, 09, 123456789 and three 36's :: {{Math|1=''K''<sub>10</sub> (124578 09 123456789 363636) = 98765433320987666543211}}, and : {{Math|1=(''x'', ''y'', ''z'', ''u'') = (2, 1, 1, 0)}} : ...... Sequence of two 124578's, 09 and 123456789 :: {{Math|1=''K''<sub>10</sub> (124578124578 09 123456789) = 98776554210988754432211}}.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)