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 Solvers81
Suggested Problems
-
Find the peak 3n+1 sequence value
2537 Solvers
-
Number of 1s in a binary string
10080 Solvers
-
Getting the absolute index from a matrix
250 Solvers
-
Matrix multiplication across rows
357 Solvers
-
178 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!