Answer:
A sequence is an ordered list of numbers and series is the sum of a list of numbers (https://www.tutapoint.com/knowledge-center/view/difference-between-sequence-and-series).
The elements of a geometric sequence are a, ar, ...,arn, ..., where "a" represents the initial term and r is the ratio of any two successive elements of the series.
The sum of the finite number of terms is then a+ar+ar2+..+arn = a(1+r+...rn)= a(1-rn+1)/(1-r)
We can prove it using induction by n.
Induction base case n=1: a+ar= a(1+r)= a(1-r2)/(1-r) =a(1-r1+1)/(1-r) holds
Induction general step
We assume the summation holds for a positive n>1 and we need to prove it also holds for n+1.
Namely, we need to prove that: a+ar+ar2+..+arn+1 = a(1-rn+2)/(1-r)
Butd a+ar+ar2+..+arn+1 = (a+ar+ar2+..+arn) +arn+1 = a(1-rn+1)/(1-r) + arn+1 (using the induction hypothesis)
= a[(1-rn+1)/(1-r) + rn+1] =
=a(1-rn+1 + rn+1 - rn+2)/ (1-r) = a(1-rn+2)/(1-r) holds
Thus, the induction proof is now complete.
Going back to our problem, we have obtained that the formula for a geometric series is a(1-rn+1)/(1-r), when we sum the fist n terms as described above.
There are multiple situations when this formula is useful. For instance, when |r| < 1, rn+1 tends to 0 when n tends to infinity (or when it has a very big value), the sum of the geometric series becomes a/(1-r) only because rn+1 can be neglected.
The same conclusion holds if we sum up to (n-1)th term because in that case rn tends to 0 when n tends to infinity.
For instance, in a production environment, if we know that each day the no. of items is a fraction r of the previous day, then we can estimate the no. of items produced in n days or so.
Comments
Leave a comment