Prove n 2 + 3 " 2 n

for all n5.

A. State and prove the basis step.

!
P(5): 52 + 3 ! 2 5 is true because 28 < 32.


B. State the inductive step.

2
n 2 + 3 ! 2 n " ( n +1) + 3 ! 2 n+1


C. Prove the proposition in the inductive step.

(Note: this proof requires the following lemma, which you should also be able to
prove, and which is proven below: n3, 2n+ 1 2n)
Proof:
Assume that n 2 + 3 " 2 n form some n5.
Then
(n +1) 2 + 3
2
= n!
+ 2n +1+ 3

= n 2 + 3 + 2n +1
2 n + 2n +1 (inductive hyopthesis)
2 n + 2 n (because 2n +1 2 n for all n 3)
= 2 2 n

= 2 n +1



Proof of lemma: n3, 2n+ 1 2n
Basis step: 2(3) + 1 = 7 < 8 = 23

Inductive step
Assume 2n +1 2 n for some n3.
Then

2( n +1) +1
= 2n + 2 +1
= 2n +1+ 2
2n + 2

(inductive hypothesis)

< 2 n + 2 n (because 2 < 2 n if n > 1)

= 2 2 n
= 2 n +1