Sum of the terms of a geometric progression

The objective is to add the first n terms of a geometric progression.

Example

We take the geometric progression of the first term a1=3 and ratio r=2. We denote Sn the sum of the first n terms, and we are going to calculate the value of Sn for n=1,2,3,,10.

The first ten terms are:

3,6,12,24,48,96,192,384,768,1.536

And the values of the sums:

S1=3

S2=3+6=9

S3=3+6+12=21

S4=3+6+12+24=45

S5=3+6+12+24+48=93

S6=3+6+12+24+48+96=189

S7=3+6+12+24+48+96+192=381

S8=3+6+12+24+48+96+192+284=765

S9=3+6+12+24+48+96+192+284+768=1.533

S10=3+6+12+24+48+96+192+284+768+1.536=3.069

As expected (we are adding positive terms), we obtain an increasing result. Then we ask ourselves: can it become infinitely big or will the numbers level off at some point?

Let's consider now the progression of the first term a1=7, and ratio r=13.

We write its first ten terms:

7,73,79,727,781,7243,7729,72.187,76.561,719.683

And we calculate the sums:

S1=7

S2=7+73=9,3

S3=7+73+79=10,1

S4=7+73+79+727=10,37037

S5=7+73+79+727+781=10,45679012

S6=7+73+79+727+781+7243=10,4855967

S7=7+73+79+727+781+7243+7729=10,4951989

S8=7+73+79+727+781+7243+7729+72.187=10,498699639

S9=7+73+79+727+781+7243+7729+72.187+76.561=10,49946654

S10=7+73+79+727+781+7243+7729+72.187+

+76.561+719.683=10,49982218

Note that the sums of the second progression are also increasing, but not rising as fast as in the previous example. In fact, it seems to be a manageable growth: for the obtained results, the amounts are getting closer to 10,5. Will it exceed this value at any point or, if not, will it become an upper bound of the values Sn? And, in this case, will we obtain an approximation to 10,5 as good as we want it if we add enough terms?

Let's consider now a theoretical case:

If a1,a2,,an are the first n terms of a geometric progression of ratio r. Then,

Sn=a1+a2++an=a1+a1r++a1rn1

Multiplying both members of the equality by r, the following is obtained:

rSn=a1r+a1r2++a1rn

By reducing, member by member, these two equalities, we obtain:

imagen

Namely, we have:

SnrSn=a1a1rn

So:

Sn(1r)=a1(1rn)Sn=a1(1rn)1r

Remembering the previous examples,

Example

If an=32n1, then, Sn=a1(1rn)1r=3(122)12=3(2n1)

In such a way that, if we allow n to grow indefinitely, Sn will not stop growing, since 2n can grow indefinitely if we choose an n big enough.

If in this expression we substitute n by any value, for example 10, we will obtain the result of adding the first 10 terms.

On the other hand, if bn=73n1, then, Sn=7(113n)113=212[1(13)n]

In this case, the base of the nth power is less than the unit, which means that as the value of n increases, (13)n decreases. Because of this, the value of Sn stabilizes if we choose n to be big enough.