prove by Induction that n! ≥ 2^(n-1) n ≥ 1
Okay, so show us what you have attempted.
I managed to prove for n= 1 and is true
for n=k k!≥ 2^ (k-1) and I assumed that n=k to be true
then for n= k+1 its (k+1)! ≥ 2^[(k+1)-1]
proof for n=(k+1)
(k!)(k+1) ≥ _____?
the problem is that how do we reach the proof for (k+1)
hi kudzie adore! welcome to pf!
(try using the X2 button just above the Reply box )
hint: if an equation is true, then multiplying both sides by the same factor will still be true
Separate names with a comma.