When does 1+2/3+(2/3)2+…b first exceed 0.9999S∞?
Question
Find the least number of terms of the geometric series
1+32+(32)2+…b
that must be taken so that the sum of these terms exceeds 99.99% of the sum to infinity of the series.
Solution
The sum of n terms of a GP is Sn=1−ra(1−rn). For the GP above, a=1 and r=32.
Since in our case ∣r∣<1, we can say the sum to infinity of the GP is S∞=1−2/31=3.
We need to find the smallest n so that Sn>10099.99×3=2.9997.
Let’s try to solve Sn=2.9997. We have
Sn=1−2/31×(1−(2/3)n)=3(1−(32)n)=2.9997.
Rearranging now tells us (32)n=0.0001. Taking logs to base e, we have
n=ln(2/3)ln0.0001=22.7....,
and so the value of n we seek is 23.
Alternatively, we could solve (32)n=0.0001 by taking logs to base 32.
If you haven’t studied logs yet, you could find the threshold where (32)n becomes small enough by trialling different n values.