Problem 2040. Additive persistence
Inspired by Problem 2008 created by Ziko.
In mathematics, the persistence of a number is the number of times one must apply a given operation to an integer before reaching a fixed point; where further application does not change the number any more (Wikipedia).
Problem 2008 is an example of multiplicative persistence. Can you code an additive persistence ?
2718->2+7+1+8=18->1+8=9. So the persistence of 2718 is 2.
You can use the tips : num2str(666)-'0'=[6 6 6].
Solution Stats
Problem Comments
-
1 Comment
Mehmet OZC
on 11 Dec 2013
Tip was so instructive... Thanks
Solution Comments
Show commentsProblem Recent Solvers170
Suggested Problems
-
2270 Solvers
-
1232 Solvers
-
Who knows the last digit of pi?
654 Solvers
-
Convert a Cell Array into an Array
1640 Solvers
-
Find out sum of all elements of given Matrix
496 Solvers
More from this Author43
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!