Given n, calculate the number 2^n (where n>=0) and iterate until the sum of the digits is a single-digit number.
Example:
Input n = 7
Output sum = 2
because 2^7 = 128, and 1+2+8=11 and 1+1=2.
Solution Stats
Problem Comments
7 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers34
Suggested Problems
-
Back to basics 8 - Matrix Diagonals
963 Solvers
-
Matrix indexing with two vectors of indices
774 Solvers
-
17592 Solvers
-
529 Solvers
-
148 Solvers
More from this Author2
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
I clarified the problem statement and fixed one test case to make the problem solvable as originally intended.
Anyone else running into an issue with 2^111? I'm getting 2^111 = 2596148429267413814265248164610048, which sums to 143, which sums to 8. The test suite says 9.
The last test is not correct. Could you check it ?
Yes, this is a sequence (1 2 4 8 7 5 1 2 4 8 7 5 ...)
The test with n = 111 is still incorrect.
is should be 8 for n = 111. am I missing something?
The last test case has been fixed.