WOLFRAM NOTEBOOK

WOLFRAM|DEMONSTRATIONS PROJECT

Kaprekar Routine

​
number
156086
display
array plot
list plot
numbers
Take a k-digit number, n, and rearrange its digits in descending order. Call this number B. Now arrange the digits in ascending order and call that number b. Compute
B-b
and repeat the operation. This algorithm, known as the Kaprekar routine, always becomes cyclic. It was discovered in 1949 by D. R. Kaprekar for 4-digit numbers.
Wolfram Cloud

You are using a browser not supported by the Wolfram Cloud

Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.


I understand and wish to continue anyway »

You are using a browser not supported by the Wolfram Cloud. Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.