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 > k2*2^k > 2*k2^{k+1} > 2k

Answer with explanation:The given statement is which we have to prove by the principal of Mathematical Induction     [tex]2^{n}>n[/tex]1.→For, n=1L H S =2R H S=12>1L H S> R H SSo,the Statement is true for , n=1.2.⇒Let the statement is true for, n=k.       [tex]2^{k}>k[/tex]                    ---------------------------------------(1)3⇒Now, we will prove that the mathematical statement  is true for, n=k+1.      [tex]\rightarrow 2^{k+1}>k+1\\\\L H S=\rightarrow 2^{k+1}=2^{k}\times 2\\\\\text{Using 1}\\\\2^{k}>k\\\\\text{Multiplying both sides by 2}\\\\2^{k+1}>2k\\\\As, 2 k=k+k,\text{Which will be always greater than }k+1.\\\\\rightarrow 2 k>k+1\\\\\rightarrow2^{k+1}>k+1[/tex]Hence it is true for, n=k+1.So,we have proved the statement with the help of mathematical Induction, which is       [tex]2^{k}>k[/tex]