Ask your own question, for FREE!
Mathematics 13 Online
OpenStudy (anonymous):

Prove that 4n

OpenStudy (caozeyuan):

induction maybe works

OpenStudy (anonymous):

Is an induction problem I forgot to put that.

OpenStudy (freckles):

I assumed you have no trouble with the base case?

OpenStudy (anonymous):

no

OpenStudy (freckles):

So you know to suppose \[4k<k! \text{ is true for integer } k>8\] and show \[4(k+1)<(k+1)! \]

OpenStudy (anonymous):

I can't seem to get the first part \[4^{k+1}=4\times \] , but i know the others

OpenStudy (anonymous):

< (k+1) ⋅k!= (k+1)!, which proves the statement for n= k+1

OpenStudy (freckles):

oh is that an exponent ?

OpenStudy (freckles):

it is 4^k<k! ?

OpenStudy (freckles):

\[4^k <k! \\ \text{ try multiplying both sides by (k+1)} \\ 4^k(k+1)<(k+1)!\] hint k+1>4 for all integer k>8

OpenStudy (freckles):

that is... \[?<4^k(k+1)<(k+1)!\]

OpenStudy (freckles):

what should be in place of that question

OpenStudy (freckles):

what do we want to show what can we show with this

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!