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 comments
Loading...
Problem Recent Solvers82
Suggested Problems
-
Project Euler: Problem 7, Nth prime
1751 Solvers
-
380 Solvers
-
Generate N equally spaced intervals between -L and L
943 Solvers
-
Split a string into chunks of specified length
2057 Solvers
-
Put Two 1D matrices into one 1D matrix
141 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!