Hi,
I have a very simple induction problem that i'd like help solving.
Prove that for all positive Integers n, that :
I know that the first step is to replace n with n+1 but then what?
/Jones
Hello,
The first step is to prove it is true for n=1.
The second step is to state the inductive hypothesis, that is to say assuming that
The third step is to prove that it is true if you "replace" n by n+1, that is to say :
Now, use the inductive hypothesis to substitute
----------------------------------------------
Another way would have been to note that and use telescoping series (Telescoping series - Wikipedia, the free encyclopedia)