# Use induction to verify the inequality

• September 16th 2012, 09:04 AM
AltF4
Use induction to verify the inequality
The problem:
Use induction to verify the inequality
2n+1 <= 2n | n >= 3

My work thus far:
Base case n = 3:
2(3) + 1 <= 23
7 <= 8

Inductive step:
Assume 2n+1 <= 2n is true for some n >= 3.
Prove 2(n+1) + 1 <= 2(n+1)(2n+1)+2 <= 2*2n
...

I am not sure what to do from here. Replacing the 2n leaves me with 4n+2 and replacing the 2n+1 leaves me with 2n+2. I thought that with inequalities I am suppose to replace terms in the greater expression with terms from the lesser expressions so that the resulting expression equals the lesser expression or vice versa. However, with this neither replacement results in an equivalent expressions.
• September 16th 2012, 09:29 AM
Plato
Re: Use induction to verify the inequality
Quote:

Originally Posted by AltF4
The problem:
Use induction to verify the inequality
2n+1 <= 2n | n >= 3

My work thus far:
Inductive step:
Assume 2n+1 <= 2n is true for some n >= 3.
Prove 2(n+1) + 1 <= 2(n+1)(2n+1)+2 <= 2*2n...

\begin{align*}2^{N+1}&=2\cdot 2^N \\&\ge 2(2N+1)\\&=4N+2\\&>2(N+1)+1\end{align*}