Nice Proof of a Geometric Progression Sum
sputsoft.com
sputsoft.com
(1 - r)(1 + r + r^2 + ... + r^n) = 1 - r^(n + 1), because all other terms cancel out.
If |r| < 1, the right part tends to 1, QED.
Call the sum of the terms Sn, though we don't know what it is.
Sn = 1 + r +r^2 + . . . + r^n
Multiply each side by r
(Sn)(r) = r + r^2 + . . . + r^(n+1)
Subtract the former from the latter
Sn - (Sn)(r) = 1 - r^(n+1)
Sn(1 - r) = 1 - r^(n+1)
Sn = (1 - r^(n+1)) / (1 - r)
And there we have the closed form expression for Sn. As n goes to infinity, it approaches 1 / (1-r)
(r^(n+1)-r^m)/(r-1)
Which is trivially deducible from your method or the parent's method. For some reason I tend to dislike geometric proofs. This is probably because I find it very easy to make proof fallacies visually, more so than symbolically. However, this geometric proof is also less useful than the symbolic because it is much harder to use it to prove the summation at values smaller than infinity, whereas the symbolic works just as well for n.