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 Solvers83
Suggested Problems
-
Test if a Number is a Palindrome without using any String Operations
258 Solvers
-
Project Euler: Problem 1, Multiples of 3 and 5
3733 Solvers
-
Project Euler: Problem 7, Nth prime
1779 Solvers
-
Arrange Vector in descending order
14033 Solvers
-
Find the maximum number of decimal places in a set of numbers
3604 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!
