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
-
2720 Solvers
-
Project Euler: Problem 1, Multiples of 3 and 5
3158 Solvers
-
Generate a vector like 1,2,2,3,3,3,4,4,4,4
11316 Solvers
-
Matrix multiplication across rows
325 Solvers
-
206 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!