Gear2d
- 49
- 0
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
The Attempt at a Solution
2k+1 = 2 * 2k
>2(k+1)2 by inductive hypothesis => How? And what happened the +1 in [(k + 1) + 1]2 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?
= (k+2)2 + (k2 - 2)
>(k+2)2 => why do you ignore the (k2 - 2)?
Last edited: