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
-
The Goldbach Conjecture, Part 2
2381 Solvers
-
654 Solvers
-
What is the distance from point P(x,y) to the line Ax + By + C = 0?
545 Solvers
-
Cell Counting: How Many Draws?
2213 Solvers
-
392 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!