# Sum of Geometric Progression/Corollary 1/Proof 2

Jump to navigation
Jump to search

## Corollary to Sum of Geometric Progression

Let $a, a r, a r^2, \ldots, a r^{n-1}$ be a geometric progression.

Then:

- $\displaystyle \sum_{j \mathop = 0}^{n - 1} a r^j = \frac {a \left({r^n - 1}\right)} {r - 1}$

In the words of Euclid:

*If as many numbers as we please be in continued proportion, and there be subtracted from the second and the last numbers equal to the first, then, as the excess of the second is to the first, so will the excess of the last be to all those before it.*

(*The Elements*: Book $\text{IX}$: Proposition $35$)

## Proof

\(\displaystyle \sum_{0 \mathop \le j \mathop < n} a r^j\) | \(=\) | \(\displaystyle a + \sum_{1 \mathop \le j \mathop < n} a r^j\) | |||||||||||

\(\displaystyle \) | \(=\) | \(\displaystyle a + r \sum_{1 \mathop \le j \mathop < n} a r^{j-1}\) | Multiplication of Numbers Distributes over Addition | ||||||||||

\(\displaystyle \) | \(=\) | \(\displaystyle a + r \sum_{0 \mathop \le j \mathop < n - 1} a r^j\) | Exchange of Order of Summation | ||||||||||

\(\displaystyle \) | \(=\) | \(\displaystyle a + r \sum_{0 \mathop \le j \mathop < n} a r^j - a r^n\) |

Hence:

\(\displaystyle \left({1 - r}\right) \sum_{0 \mathop \le j \mathop < n} a r^j\) | \(=\) | \(\displaystyle a - a r^n\) | |||||||||||

\(\displaystyle \leadsto \ \ \) | \(\displaystyle \sum_{j \mathop = 0}^{n - 1} a r^j\) | \(=\) | \(\displaystyle \frac {a \left({1 - r^n}\right)} {1 - r}\) |

The result follows.

$\blacksquare$

## Sources

- 1997: Donald E. Knuth:
*The Art of Computer Programming: Volume 1: Fundamental Algorithms*(3rd ed.) ... (previous) ... (next): $\S 1.2.3$: Sums and Products: Example $3$. $(14)$