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

Solution 3791213

Submitted on 23 Nov 2020 by Michael

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))

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

Start Hunting!