Proof of Binomial theorem


By Brad Rodgers (P1930) on Sunday, June 18, 2000 - 12:54 am :

I just saw a proof of the binomial theorem using the Taylor series. Is there some other proof of this series that doesn't involve f'(x)=nxn -1, where f(x)=xn , a result obtained using the binomial theorem?

Brad


By Dan Goodman (Dfmg2) on Sunday, June 18, 2000 - 01:15 am :

You can prove this by induction assuming n is a positive integer, which I think you know about. If this is the theorem you're trying to prove, then just work out (x+a)(x+a)n , assuming the binomial theorem is true for n to expand (x+a)n . The actual proof is an exercise for the reader I think, however write another message if you're looking for a more general form of the binomial theorem (negative n or noninteger n).


By Brad Rodgers (P1930) on Sunday, June 18, 2000 - 04:16 am :

Thanks, I shouldn't have overlooked that. But anyways, what is the more general form? (I didn't know that you could apply the theorem to non-integer values of n.)

Brad


By Dan Goodman (Dfmg2) on Wednesday, June 21, 2000 - 03:19 am :
Well, for n > 0, you get


(x+a)-n= ¥
å
k=0 
(-1)k n+k-1Ck xk a-n-k

And for non-integer n, you get for |x| < 1 that:

(x+1)n=1+n x+(n(n-1)/2)x2+(n(n-1)(n-2)/6)x3+¼