I haven't touched induction in a while now, and even after reviewing a bit I still can't figure out how to even start solving this problem :
now even when I start off putting (n=1) :
I end up with -1/2=1/2 (or maybe I should discard the minus on the left side?)
bottom line - I need help :)
I've looked at several examples and all had a series on the LHS and and some kind of single expression on the RHS. so now that I have a series on both sides I don't know how to work with it?
if I had a single expression on the RHS I would simply do :
n=k → n=k+1
and there won't be any problem, but I don't know how to approach having series on both sides?
from what you've told me I assume that for n=1 : right?
To use induction, follow these steps.
1. Formulate the statement to prove as: "For all natural numbers n >= n0, P(n)". Here n0 is typically 0 or 1 and P(n) is an expression containing n. It is very important to get P(n) right. In particular, for each particular n, P(n) must be a proposition, i.e., it must be either true or false. One common mistake is to make P(n) a number, like 1 + ... + n. This is a mistake because a number cannot be true or false.
2. Next, you need to know how to substitute various expressions for n in P(n). In particular, the base case is P(n0). For this, replace n everywhere in P(n) with n0. It may sound like this is a problem for kindergarten and I am making fun of you, but so many mistakes can be avoided if people write P(n) and substitute things for n correctly.
3. As has been said, prove P(n0). This is the base case.
4. Prove the following statement: "For all k, P(k) implies P(k + 1)". For this, fix an arbitrary k and assume P(k). I recommend writing, "Induction hypothesis" or "IH" followed by P(k). This is something you can use. Then write what you need to prove: "Need: P(k + 1)". Proceed by proving P(k + 1) and mark the place where you use the induction hypothesis.
In this case, you can proceed as follows...
We try to show that if P(k) is valid, it will cause P(k+1) to be valid also.
Starting with P(k), add to both sides.
If P(k) is valid, then
Now you need to show that the brackets contains
sorry to bother you like that, I got the solution but missed several parts in your way :
1. for P(k+1) isn't missing on the LHS:
so that later I could use P(k) LHS to RHS?
2. did you only apply actions to P(k) or did I get it wrong?
3. where did that last part come from - ?
anywise, thanks a lot! (Bow)
1. No, I only wrote the last term of the LHS.
Originally Posted by Laban
The LHS is
To write the P(k+1) proposition, we can just replace k with k+1,
but the series does then go as far as
2. We add the two new terms
to both sides of P(k).
The P(k+1) expression has k replaced with k+1 as we are obtaining an expression for the "next n" after n=k.
The idea is that we are trying to prove that "if" the expression is valid for "some n",
then being valid for that n (n=k), it must therefore also be valid for the "next n" (n=k+1).
Valid for n=1 causes the expression to be valid for n=2.
Valid for n=2 causes the expression to be valid for n=3.
Valid for n=3 causes the expression to be valid for n=4.
Valid for n=4 causes the expression to be valid for n=5.
This is what the P(k), P(k+1) steps are all about.
We are proving whether or not this chain of cause and effect runs through the expression.
Then it's like having a trail of dominoes standing in a line.
When you examine the first domino, you knock them all down
if the expression holds for the first value of n.
3. For the last part, I just moved the first term of the RHS, to the end, so that the RHS started at
so you get this :
but you still have this expression which is not part of what we wrote as P(k+1) but is an obvious part of the series - so do I just leave it as is (cause it's obvious) or do I need to discard of it to make the expression look exactly like how I wrote P(k+1)?
thanks a lot! that was really helpful (Yes)(Yes)