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
-
The Goldbach Conjecture, Part 2
2413 Solvers
-
Least common multiple of many numbers
255 Solvers
-
Number of 1s in the Binary Representation of a Number
479 Solvers
-
Change the sign of even index entries of the reversed vector
643 Solvers
-
391 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!
