Prove that 2n + 1 ≤ 2n for n ≥ 3

Question

asked Jan 22, 2015 199k views

1 Answer

Exacerbatedexpert · Answer 1 · 2015-01-29T04:22:56+0000

In order for something to be proven, there can be no counterexamples to prove it false.

$4 \geq 3 \\ n=4 \\ 2(4)+1 \leq 2(4) \\ 8+1 \leq 8 \\ 9 \leq 8$

9 is not greater than or equal to 8, therefore this statement is false.

Prove that 2n + 1 ≤ 2n for n ≥ 3

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

Please log in or register to add a comment.

No related questions found

Categories

Other Questions