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 numeric mean of the prime numbers in a matrix.
9175 Solvers
-
Sum of first n terms of a harmonic progression
522 Solvers
-
558 Solvers
-
179 Solvers
-
1005 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!