Number Persistence - MATLAB Cody - MATLAB Central

Problem 2008. Number Persistence

Difficulty:
(70)
Rate

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.

Solve

Solution Stats

67.41% Correct | 32.59% Incorrect
Last Solution submitted on Nov 24, 2024

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers81

Suggested Problems

More from this Author12

Problem Tags

persistence

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!