Binomial Theorem related proofs

h.shin
Messages
6
Reaction score
0

Homework Statement


Let a be a fixed positive rational number. Choose(and fix) a naural number M > a.
a) For any n\inN with n\geqM, show that (a^n)/(n!)\leq((a/M)^(n-M))*(a^M)/(M!)
b)Use the previous prblem to show that, given e > 0, there exists an N\inN such that for all n\geqN, (a^n)/(n!) < e


Homework Equations





The Attempt at a Solution


I just don't really know where to start. Any hints? or suggestions?
 
Physics news on Phys.org
Start by looking at simple examples. What if, say, a= 1/2, M= 1 and n= 2? What if M= 2 and n= 2?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Replies
2
Views
2K
Replies
1
Views
1K
Replies
5
Views
2K
Replies
8
Views
2K
Replies
13
Views
2K
Replies
5
Views
2K
Back
Top