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 Solvers82
Suggested Problems
-
516 Solvers
-
Compute a dot product of two vectors x and y
1020 Solvers
-
Split a string into chunks of specified length
1960 Solvers
-
find the maximum element of the matrix
525 Solvers
-
Solving Quadratic Equations (Version 1)
501 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!