SOLUTION: Prove by induction that 2^n>2n gor every positive integer n>2.

Question 1188707: Prove by induction that 2^n>2n gor every positive integer n>2.

Answer by ikleyn(52790) (Show Source): You can put this solution on YOUR website!
.
Prove by induction that 2^n > 2n for every positive integer n > 2.
~~~~~~~~~~~~~~~~~

(1)  Base case n= 3.

     Then   = 8,  and 8 > 2*3 = 6;  so the base of induction is established.



(2)  The induction step from n to (n+1), for n > 2.


     So we assume that  > 2n  for some positive integer n > 2.


     We have   =  =  + .           (1)


     According to the induction assumption,   > 2n,  so we can continue the preceding line in this way

          =  =  +  > 2n + 2n.      (2)


     Next, we can continue this way

         2n + 2n = 2*(n+1) + 2(n-1),  and since  n > 2, the last addend is positive.


     THEREFORE,  2n + 2n > 2*(n+1)  for n > 2.         (3)


     Combining all these parts (1), (2) and (3) together, we have

           =  =  +  > 2n + 2n > 2*(n+1)  for n > 2.


     Thus the proof for the inductive step  n ---> (n+1)  is complete.



(3)  Due to the principle of Mathematical induction, the statement is proved for all positive integer n.

Solved.

RELATED QUESTIONS
Prove by induction that 2^n>2n {{{cross(gor)}}} for every positive integer... (answered by ikleyn)

Prove by mathematical induction that the statement below holds true for every integer... (answered by ikleyn)

Use mathematical induction to prove the statement is true for all positive integers n. (answered by Edwin McCravy)

Prove by mathematical induction,1^2+3^2+....(2n+1)^2=((n+1)(2n+1)(2n+3))/3 where 'n' is a (answered by ikleyn)

Prove by induction and through divisibility algorithm that 11^n - 6 is divisible by 5... (answered by ikleyn)

Use mathematical induction to prove the statement is true for all positive integers n. (answered by ikleyn)

Prove using induction that: for every non negative integer n,... (answered by robertb)

use mathematical induction to prove that the following statement is true for every... (answered by ikleyn)