3 ms·
Neat illustration, but I'd present the proof to kids in the usual manner: (1 - r)(1 + r + r^2 + ... + r^n) = 1 - r^(n + 1), because all other terms cancel out.
by cousin_it 17y ago
Neat illustration, but I'd present the proof to kids in the usual manner:
(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.
- losvedir 17y agoI can never be quite sure that I'm remembering the proper closed form expression, so I always rederive it in a way that's basically what you have here, but a little less dense: 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)
- Locke1689 17y agoThis is the correct way to prove the summation. Although, I would point out that for r > 1, it's probably better to phrase it as ( r^(n+1) - 1)/(r-1). However, it's important to note that this is only true from a series starting from zero. For a series starting from m it is: (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.