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
-
5707 Solvers
-
Determine if a Given Number is a Triangle Number
367 Solvers
-
Back to basics 23 - Triangular matrix
966 Solvers
-
Generate a random matrix A of (1,-1)
295 Solvers
-
360 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!