Just like the solution to problem 13 the answer to problem 16 of Project Euler has become trivial with .NET 4.0. And since I am lazy I intend to exploit the tools I am given. The problem description reads

2^{15}= 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.

What is the sum of the digits of the number 2^{1000}?

If there didn’t exist a BigInteger class in .NET, then we would have needed to implement a way of storing the large result, which would need 1000 bits of storage, or around the size of 32 integers.

## Solution

However, with the class that can hold arbitrarily large in integers the task is trivial, and I decided to solve it in the following way

int result = 0; BigInteger number = BigInteger.Pow(2, 1000); while (number > 0) { result += (int) (number % 10); number /= 10; }

I have chosen an implementation where I slice of the last digit in a while loop with the modulo operator. We could have chosen to convert it to a string, split it and convert it back. This just seemed more in line with the Project Euler spirit.

The result of the code is

The sum og digits of 2^1000 is: 1366 Solution took 0 ms

## Wrapping up

Intentionally this was a very short blog post, since I didn’t have much to say. As usually the source code is available for download here.

Hello Everyone,

I have a simple code in C# which does not make use of BigInteger..

I have not commented about what I have done in code so that you can find out whats going on in the code.. The code is very simple..

Hi Amey

Thanks for the comment and the alternative solution. I always love to see and hear from other people.

I like your solution, since it doesn’t use anything special, so it would be implementable in most traditional languages. On the other hand I have no problems using the tools that the chosen language provides me for solving the problem at hand.

I have made a solution that is somewhat similar, but where I store 14 digits in each array entry. That uses less memory, but you need to chop up each number in the end, so I am not sure whether or not it is better performance wise.

If I should make any comments on the code, I would add the carry in line 19 instead. I know it won’t make any problems, but it seems easier to understand for me.

/Kristian

Hi Kristian,

I have been reading your blog here for a few weeks now and I am so glad I found it. I love your solutions to the problems, here is my version (not as cool as yours).

BigInteger

.Pow(2, 1000)

.ToString()

.Aggregate(0,

(total, next) => total + (int)Char.GetNumericValue(next))

Hi Mark

Thanks for the compliment and thanks for sharing your code. I am not very strong with LINQ, so I always enjoy when people are sharing their LINQ solutions with me. That gives me a little to pull from whenever I am trying.

/Kristian

You know, that problem was not meant to be solved with the BigInteger class, unless u can easily implement multiplication of big numbers yourself.

I only partly agree with you. I know it is close to trivial when you can handle it that way, but given a toolbox you should also use the best available tool to get the job done.

…and yes I can implement multiplication on large integers if needed.

Hi Kristian,

can you please post solution in C

thanks.

No I don’t know C well enough to write solutions in that. But you should be able to program something like Ameys solutions yourself.

How about doing it with Binary to BCD (Binary Coded Decimal) conversion?

-pow(2,100) is easy to do with setting the most significant bit of 1

-and then converting the binary bit to BCD bit,

-and after that just summing up decimal values of BCD binary.

As you know each four bits BCD represents each digit of the decimal number.

I wander if it will be faster…

I am not familiar with that method, but the last question makes me say “try it, compare the results and share it here”.

Table 1

Pattern (sequence 7-5-1-2-4-8; period 6) in the distribution of digital roots for 2^p; (p>1).

Re: Project Euler – Problem 16

“Power digit sum”

http://img11.hostingpics.net/pics/139975pe16tab1pwrdig.jpg

______

Sources:

1) Digital root

http://en.wikipedia.org/wiki/Digital_root

2) Modulo operation

http://en.wikipedia.org/wiki/Modulo_operation

3) Pitoun’s sequence: a(n+1) is digital root of a(0)+…+a(n).

http://oeis.org/A029898

(And references cited therein)

4) Kristian’s algorithm for Project Euler – Problem 16

http://www.mathblog.dk/files/euler/Problem16.cs

5) Microsoft Visual C# 2010 Express

(Reference added: System.Numerics)

6) Big Integer Calculator

http://www.javascripter.net/math/calculators/100digitbigintcalculator.htm

___

Note :

From Ref. 6:

2^100=

1267650600228229401496703205376; 31 digits

Sum of digits: 115

Digital root: 7

http://www.javascripter.net/math/calculators/100digitbigintcalculator.htm

Here is my approach in C.

#include

using namespace std;

main(){

int a[400]={0,1};

int n,i,j;

cin>>n;

for(i=0;i<n;i++){

int carry=0;

for(j=0;j0;i–)

cout<<a[i];

int sum=0;

for(i=0;i<400;i++)

sum=sum+a[i];

cout<<endl<<sum;

}

A small code which can calculate the power of 2 upto 2^10000 +….

#include

using namespace std;

main(){

int a[400]={0,1};

int n,i,j;

cin>>n;

for(i=0;i<n;i++){

int carry=0;

for(j=0;j0;i–)

cout<<a[i];

int sum=0;

for(i=0;i<400;i++)

sum=sum+a[i];

cout<<endl<<sum;

}