Waste less time on Facebook — follow Brilliant.

Kaprekar's constant

Take any four digit number (whose digits are not all identical), and do the following:

  1. Rearrange the string of digits to form the largest and smallest 4-digit numbers possible.
  2. Take these two numbers and subtract the smaller number from the larger.
  3. Use the number you obtain and repeat the above process. What happens if you repeat the above process over and over?

Amazing thing is this: every four digit number whose digits are not all the same will eventually hit 6174, in at most 7 steps, and then stay there!

Note by Akshat Sharda
1 year, 4 months ago

No vote yet
1 vote


There are no comments in this discussion.


Problem Loading...

Note Loading...

Set Loading...