How to solve this equation by using induction?
for n=k:
for n=k+1:
Is it correct by now? If yes, what should I do next?
![]() |
How to solve this equation by using induction?
for n=k:
for n=k+1:
Is it correct by now? If yes, what should I do next?
This proof is MUCH easier if you increment p instead of n.
For proof by induction, we take the given equation as true. Then we replace p with p+1:
But the first p terms of the left side are the left side of the given equation (which we assume is true for proof by induction), so we can replace those terms with the right side of the given equation and write:
Now if we can show that the two sides are indeed equal, we will have succeeded in proof by induction.
First, let's get rid of the 1/(n+1):
Now we can lose the -(n+1)! Terms on both sides and get a common denominator of (p+1)!:
Now we get rid of the denominator and factor out a (n+p+1)! Term on the left side:
Q.E.D.
Nice demonstration, it's the first time I see a proof by induction :)
All times are GMT -7. The time now is 07:49 PM. |