Ask
your own question, for FREE!
Mathematics
17 Online
Proof by induction. I would like to please have help on how to prove that: 2^n < n! for n > 4
Still Need Help?
Join the QuestionCove community and study together with friends!
it is true for n = 5 since \[2^5=32\] whereas \[5!=120\] now assume true for all \[k\leq n\] prove it is true for n + 1
that is prove \[2^{n+1}<(n+1)!\] i.e. \[2\times 2^n<(n+1)n!\] and since BY INDUCTION \[2^n<n!\] and \[2<n+1\] we know \[2\times 2^n<(n+1)n!\]i.e. \[2^{n+1}<(n+1)!\]
makes perfect sense :) thank you
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!
Join our real-time social learning platform and learn together with your friends!
Latest Questions
serenitystXrgazer:
Getting sent to anti gay christian covestion camp in a few weeks, any tips. guys i think im cooked.
Aubree:
Guys, what does love feel like? I've been getting a tight chest and when I talk to him my heart rate hangs out around 100-120 beats per min, and when he doe
thereneelg:
ok... anyone have advice?? ...I did Choir all throughout Middle school and have ALWAYS been put in Soprano those three years.
kamariana:
The Byzantine Procopius is known for (5 points) reconquering much of the old Roma
chuckD:
hellp!!! what does it mean to describe a scientist as skeptical Why is sceptical
DoltonCarlee:
So like do y'all know anything about the first world war?
thehearken:
anyone know how to explain this so its easier for me to understand? b(1)=2, b(n)=
52 minutes ago
0 Replies
0 Medals
5 hours ago
10 Replies
2 Medals
2 days ago
6 Replies
1 Medal
3 days ago
0 Replies
0 Medals
3 days ago
2 Replies
1 Medal
2 days ago
2 Replies
0 Medals
2 days ago
5 Replies
2 Medals