Problem 252. Project Euler: Problem 16, Sums of Digits of Powers of Two

Solution 112161

Submitted on 13 Jul 2012 by Freddy

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test	Status	Code Input and Output
1	Pass	%% x = 0; y_correct = 1; assert(isequal(pow2_sumofdigits(x),y_correct))
2	Pass	%% x = 1; y_correct = 2; assert(isequal(pow2_sumofdigits(x),y_correct))
3	Pass	%% x = 15; y_correct = 26; assert(isequal(pow2_sumofdigits(x),y_correct))
4	Pass	%% x = 345; y_correct = 521; assert(isequal(pow2_sumofdigits(x),y_correct))
5	Pass	%% x = 999; y_correct = 1367; assert(isequal(pow2_sumofdigits(x),y_correct))
6	Pass	%% x = 2000; y_correct = 2704; assert(isequal(pow2_sumofdigits(x),y_correct))