Given n, calculate the number 2^n (where n>=0) and iterate until the sum of the digits is a single-digit number.
Input n = 7
Output sum = 2
because 2^7 = 128, and 1+2+8=11 and 1+1=2.
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 ...)
Is it an Armstrong number?
03 - Matrix Variables 6
Union of two set decreasing order
UICBioE240 problem 1.2
UICBioE240 problem 1.17
Numbers with prime factors 2, 3 and 5.
Maximum of ND-array
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office