Gear2d said:
Homework Statement
I was reading my discrete math book and have this example of how they prove by induction that if 2x >(x+1)2 that 2k+1 >[(k + 1) + 1]2
Where r>5
No, that makes no sense. No formula in "x" will tell you anything about a different formula in "k". And there is no "r" in it! I suspect you mean that you are asked to prove that 2
n> (n+1)
2 for all n> 5. And one step in doing that will be to show that "if 2
k> (k+1)
2, then 2
k+1> ((k+1)+1)
2, the "induction hypothesis".
The Attempt at a Solution
2k+1 = 2 * 2k
>2(k+1)2 by inductive hypothesis => How?
The inductive hypothesis is that 2k> (k+1)2. To show that is true for the "next" k, you look at 2k+1= 2*2k. Since (the inductive hypothesis) 2k> (k+1)2, 2*2k> 2*(k+1)2. Putting those together, 2k+1> 2(k+1)2.
And what happened the +1 in [(k + 1) + 1]2
They aren't there yet! They are starting from the left and showing that it gives the other side.
Also shouldn't it be (k+2)2 if you but in k + 1 for x, so how is it 2(k+1)2
= 2k2 + 4k + 2
= k2 + 4k + 4 + (k2 - 2) => How?
Surely you know enough algebra to do that yourself.
2k
2+ 4k+ 2= k
2+ k
2+ 4k + 2= (k
2+ 4k+ 2)+ k
2 (I've just moved on "k
2" to the end)
Now, you should know that (k+ 1+ 1)
2= (k+2)
2= k
2+ 4k+ 4. What we already have, k
2+ 4k+ 2 needs to have 2 added to it to get that. Of course, in order to keep this true we also have to subtract 2:
k
2+ 4k+ 2+
2+ k
2-2
= (k+2)2 + (k2 - 2)
>(k+2)2 => why do you ignore the (k2 - 2)?
Because it is larger than 0! We aren't showing "= " we are showing ">". Since k> 5 (remember that) k
2- 2 is larger than 0 (in fact it is at least 23!). Adding a positive number to any number makes it larger.