Home page for accesible maths Math 101 Chapter 1: Sequences and Series

Style control - access keys in brackets

Font (2 3) - + Letter spacing (4 5) - + Word spacing (6 7) - + Line spacing (8 9) - +

1.39 Proof

Proof. We show that the sum to nn terms is

sn=a1-rn1-r.s_{n}=a{{1-r^{n}}\over{1-r}}.

We take the nthn^{th} partial sum, and then multiply by rr, so

sn=a+ar+ar2++arn-1s_{n}=a+ar+ar^{2}+\dots+ar^{n-1}
rsn=ar+ar2++arn-1+arn;rs_{n}={\quad}ar+ar^{2}+\dots+ar^{n-1}+ar^{n};

so by subtracting we obtain

(1-r)sn=a-arn;(1-r)s_{n}=a-ar^{n};

hence when r1r\neq 1, we obtain

sn=a1-rn1-r.s_{n}=a{{1-r^{n}}\over{1-r}}.

Now for -1<r<1-1<r<1, we have rn0r^{n}\rightarrow 0 as nn\rightarrow\infty, so

sna1-r  (n)s_{n}\rightarrow{{a}\over{1-r}}\qquad(n\rightarrow\infty)

and s=a/(1-r).s=a/(1-r).