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 Solvers80
Suggested Problems
-
Determine if a Given Number is a Triangle Number
370 Solvers
-
Set the array elements whose value is 13 to 0
1351 Solvers
-
Sum the entries of each column of a matrix which satisfy a logical condition.
158 Solvers
-
find the maximum element of the matrix
487 Solvers
-
769 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!