Asked by Anonymous
Prove the following by mathematical induction.
2^(n-1)≤n!
2^(n-1)≤n!
Answers
Answered by
oobleck
P(1), since 2^0 ≤ 1
Now, assume P(k). Then, with n = k+1, we need to show that
2^(k) ≤ (k+1)!
But, we know that
2^k = 2*2^(k-1) ≤ 2*k! ≤ (k+1)*k! ≤ (k+1)! for 2≤k
so, P(k+1) if P(k)
Now, assume P(k). Then, with n = k+1, we need to show that
2^(k) ≤ (k+1)!
But, we know that
2^k = 2*2^(k-1) ≤ 2*k! ≤ (k+1)*k! ≤ (k+1)! for 2≤k
so, P(k+1) if P(k)
There are no AI answers yet. The ability to request AI answers is coming soon!
Submit Your Answer
We prioritize human answers over AI answers.
If you are human, and you can answer this question, please submit your answer.