At school I like you met, first for n=2 then 3 then n generally this factorization of ##\left(x^n-1\right)##
$$\left( x^{n}-1\right) =\left( x-1\right) \left( x^{n-1}+x^{n-2}+...+x+1\right) $$
Quite separately I had earlier learned how to sum a geometric series. Till much after school and having almost forgotten both I never made any relation between the two - have you? Of course the expression in the last bracket above is just the geometric series, for n terms starting at 1, common ratio ##x## and up to the nth term ##\sum ^{n-1}_{r=0}x^{r}##. If we were giving a formula for the sum of the geometric series we might prefer it up to the ##x^n## term; the formula would then be
$$\sum ^{n}_{r=0}x^{r}=\dfrac {x^{n+1}-1}{x-1}$$
Particularly useful is the case ##0<x<1, n= \infty##
$$\sum ^{\infty }_{r=0}x^{r}=\dfrac {1}{1-x}$$
You may meet this in not-served-on-a-plate contexts, e.g in statistical mechanics you wil meet things like
$$ \sum ^{\infty }_{n=1}e^{-(nh\nu /kT)}$$
(where the letters
h, ν, k, T, are physical constants or parameters) which, duly alerted, I hope you can now sum.
.
Stefk said:
I guess I need to get acquainted with that sort of reasoning, and also with induction techniques as mentioned by
@Ray Vickson, that I don't completely follow either. I planned to read a book later on the different kind of proofs ("How to prove it", Velleman), maybe should I read it sooner? Anyway, thank you both for your answers, I'm far beyond the objective of Lang's chapter and I'll definitely get back at this discussion when I'm ready!
I don't know that there is really such a thing as "induction techniques". What I notice from questions here is that students' questions indicate them frequently stumbling over two things: induction and limits. I even wondered whether the difficulty with limits should be avoided from teaching by avoiding limits, as some people suggest; however then I realized the difficulty in both cases was mainly not with the induction or limits concepts, but just in doing the ordinary algebra that the excercises in them require. There are usualLy pretty clear pointers, you start with some equation f(n) = 0 that you consider true, you then know you have, using this last fact, to prove f(n+1) = 0. A couple of examples help, but maybe, as in your case, some of the wording or symbolic representation wrapped around these two things fails at first to mean a lot to the unpracticed.
I don't know it but Velleman sounds like a good book; I have often recommended 'How to solve it' by Polya, but focus probably different.