A number theory problem by Paola Ramírez

1 + 2 + 3 + + 1 0 2016 \large 1+2+3+\cdots+10^{2016}

How many times appears 2 in the prime factor decomposition of the sum above?


The answer is 2015.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Margaret Yu
Jun 3, 2016

LaTeX: 1 + 2 + 3 + + 1 0 2016 \large 1+2+3+\cdots+10^{2016}

1 + 2 + 3 + + 1 0 2016 = 1 0 2016 × ( 1 0 2016 + 1 ) 2 1+2+3+ \cdots+10^{2016} = \frac{10^{2016} \times (10^{2016}+1)}{2}

Since ( 1 0 2016 + 1 ) (10^{2016}+1) is odd, then it doesn't have a factor which is a power of 2 aside from 1.

1 0 2016 2 = 5 2016 × 2 2016 2 = 5 2016 × 2 2015 \frac{10^{2016}}{2} = \frac{5^{2016} \times 2^{2016}}{2} = 5^{2016} \times 2^{2015}

Therefore, 2 appears 2015 \boxed{2015} times in the prime factor decomposition of the 1 + 2 + 3 + + 1 0 2016 1+2+3+ \cdots+10^{2016}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...