- #1
Jef123
- 29
- 0
1. Prove that n2 > n+1 for all n≥2
2. First, (2)^2>2+1...4>3
Now for the induction step, (n+1)2 > 2n+2
Can I just show that n2+2n+1 > 2n+1+1 because 2n+1 = 2n+1 for both sides and n2>1 for all n>1
I'm pretty sure what I did is not acceptable fro this to be considered proved
2. First, (2)^2>2+1...4>3
Now for the induction step, (n+1)2 > 2n+2
Can I just show that n2+2n+1 > 2n+1+1 because 2n+1 = 2n+1 for both sides and n2>1 for all n>1
I'm pretty sure what I did is not acceptable fro this to be considered proved