Cody

Problem 43019. Iterative sum of digits of 2^n number

Solution 1040824

Submitted on 31 Oct 2016 by Justin Ng
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
n = 0; y_correct = 1; assert(isequal(your_fcn_name(n),y_correct))

2   Pass
n = 1; y_correct = 2; assert(isequal(your_fcn_name(n),y_correct))

3   Pass
n = 6; y_correct = 1; assert(isequal(your_fcn_name(n),y_correct))

4   Pass
n = 21; y_correct = 8; assert(isequal(your_fcn_name(n),y_correct))

5   Pass
n = 111; y_correct = 9; assert(isequal(your_fcn_name(n),y_correct))

Suggested Problems

More from this Author2

Community Treasure Hunt

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

Start Hunting!