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

Created by elias GR

Solve Later

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.

Solve

Solution Stats

Last solution submitted on May 17, 2018

Last 200 Solutions

Problem Comments

4 Comments

4 Comments

Show 1 older comment

goc3 on 5 Oct 2016

I clarified the problem statement and fixed one test case to make the problem solvable as originally intended.

James on 6 Oct 2016

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.

Binbin Qi on 11 Nov 2016

The last test is not correct. Could you check it ?

Jean-Marie Sainthillier on 30 May 2017

Yes, this is a sequence (1 2 4 8 7 5 1 2 4 8 7 5 ...)

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

Solution Stats

Last 200 Solutions

Problem Comments

Recent Solvers15

Suggested Problems

More from this Author2

Tags

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

Solution Stats

Last 200 Solutions

Problem Comments

Recent Solvers15

Suggested Problems

More from this Author2

Tags

Players