A number's persistence is the number of steps required to reduce it to a single digit by multiplying all its digits to obtain a second number, then multiplying all the digits of that number to obtain a third number, and so on until a one-digit number is obtained.
For example, 66 has a persistence of three because it requires three steps to reduce it to one digit: 66-36-18-8.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers83
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6696 Solvers
-
19287 Solvers
-
Back to basics 8 - Matrix Diagonals
966 Solvers
-
939 Solvers
-
Convert given decimal number to binary number.
2284 Solvers
More from this Author12
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!