My brain has escaped my head: Prove that 2n > n+1
thats only for values of n greater than 1
ooh.. I'm just having trouble proving 2^n >n using induction (_ _) Can you help me? A few clues will do..
@shubhamsrg helped me earlier... but I stopped at 2n > n+! cause I don't know (more like I forgot) how to use the right words to prove them... I'm sorry...
oh you are using induction! hmm so we assume 2^k > k to be true now we need to prove 2^(k+1) > k+1 2. 2^k > k+1 2^k + 2^k > k+1 2^k - k > 1 - 2^k LHS is always >0, which we have assumed to be true and RHS is always <0 , which we know easily hence the above inequality is always true
Thanks!! Really, thanks a lot. Sorry for the trouble I caused you. I'm really grateful because you (the two of you, I mean) helped me T_T
glad to have helped
Join our real-time social learning platform and learn together with your friends!