Addition of odd numbers (edited)

Let S N S \subset \mathbb{N} be the set of the first n n odd numbers greater than zero. If S j S_j is the j th j^{\text{th}} element of S S , find j n S j \displaystyle \sum_{j\le n} S_j for n = 1 0 15000 n = 10^{15000} .

Enter the number of zeros in this sum.


The answer is 30000.

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

Giorgos K.
Mar 20, 2018

Mathematica

Count[IntegerDigits@Sum[2k+1,{k,0,10^15000-1}],0]

returns 30000

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...