Today when I was surfing the internet I stumbled across this video.This was fasinating.
Take any 3 digit number, rearrange the numbers to form the largest number and the smallest number possible.
Subtract the two, repeat the process and eventually you will end at the number 495.
If you do this with any 4 digit number you get 6174.
I really wanted to know the proof of this. Can anybody please share the proof?Please
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
The algebraic proof is pretty intricate, and I'm too tired for LATEX, so here's a table of values.
Log in to reply
If a−c=0 or a−c=1, the values leave 3 digit numbers and approach zero.
For four digit numbers, a similar proof can be used, but it might take more time.
Kaprekar's constant
I think it is a result by iteration.
Some number which don't get to 495:111,222,333,444,555,666,777,888,999
Log in to reply
@Zakir Husain : As you can see if you look in the reply to my comment, the numbers that don't converge to 495 are numbers where the difference between the biggest and smallest numbers are 1 or 0. For the numbers where this is 1 or 0, the sequence converges to 0.