Problem 2008. Number Persistence
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 commentsProblem Recent Solvers78
Suggested Problems
-
Remove the polynomials that have positive real elements of their roots.
1592 Solvers
-
Matrix indexing with two vectors of indices
709 Solvers
-
Find the maximum number of decimal places in a set of numbers
2588 Solvers
-
Find the index of n in magic(n)
233 Solvers
-
353 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!