Help me please with this problem!!
|dw:1372992799038:dw|
Let p(n) be the statement \(n!\ge 2^{n-1}\) Consider p(1), LS = 1! =1 RS = \(2^{1-1} = 2^0 = 1 = LS\) So, p(1) is true. Suppose p(k) is true for some positive integers k. LS of p(k+1) = (k+1)! = (k+1)(k!) \(\ge (k+1)(2^{k-1})\) (since we suppose \(k! \ge 2^{k-1}\) is true) Can you continue from here?
If you dont mind Castillo and you please guide me through this whole problem because these are really tough problems for me :(
Since k is a positive integer, k+1 must be greater than or equal to 2, what conclusion can you draw from here?
so are we taking (k+1)(k+1) is greater than or equal to 2?
Hmmm.. Think about it. If k=1, k+1 = 1+ 1 = 2 So, \((k+1)(2^{k-1}) = 2(2^{k-1}) = 2^k\) If k >1, k+1 > 2 So, what is the relation between \((k+1)(2^{k-1})\) and \(2^k\)?
omg I m just too confuse :( /i dont know what I ll do in exam
Which part are you confused at?
isnt it equivalence relation?
They are not equal... Options you can have: >, <, =.
ok so they are greater than 2^k
Yes. So, combine the two cases together. If k is a positive integer, \((k+1)(2^{k-1})\ge2^k\) So far so good?
yup
So, you can write the next step and it's done!
so If I m writing next step then I ll include this (k+1)(2^k-1)greater than 2^k right?
Yes.
ok thank you :) for your help.
Welcome :)
Join our real-time social learning platform and learn together with your friends!