Use induction to prove that 2? ? ? for any integer n> 0 . indicate type of induction used.
i proved the base case using n = 1, and for my induction hypothesis, i said that we assume n = k for 2^k > k, but i am stuck trying to get to n = k + 1.
so far i have:
2^k > k
2*2^k > 2*k
2^{k+1} > 2k

Answer with explanation:

The given statement is which we have to prove by the principal of Mathematical Induction

1.→For, n=1

L H S =2

R H S=1

2>1

L H S> R H S

So,the Statement is true for , n=1.

2.⇒Let the statement is true for, n=k.

                   ---------------------------------------(1)

3⇒Now, we will prove that the mathematical statement  is true for, n=k+1.

Hence it is true for, n=k+1.

So,we have proved the statement with the help of mathematical Induction, which is

98%

step-by-step explanation:

1/8 3/16 3/4

step-by-step explanation:

you put them as all the same denominator and multiply