Take any three-digit number whose digits are not all the same. Arrange the digits in decreasing order, and then arrange them in increasing order. Now subtract. Repeat the process, using a 0 if necessary in the event that the difference consists of only two digits. For example, suppose that we choose a number whose digits are 1, 4, and 8, such as 841.
Notice that we have obtained the number 495, and the process will lead to 495 again. The number 495 is called a Kaprekar number. The number 495 will eventually always be generated if this process is applied to such a three-digit number.
Repeat the process for four digits, comparing results after several steps. What conjecture can be made for this situation?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.