Skip to main content

Section 12.2 Binomial SumsBinomial SeriesTrinomial Series

The binomial series is also foundational. It is technically not a series since the sum_if finite but we won’t bother with that for now. It is given by
B=k=0n(nk)akbnk
By induction:
Basic Step: n = 1 is trivial
Inductive Step: Assume the statement is true as given for some n1. Show (a+b)n+1=k=0n+1(n+1k)akbn+1k
(a+b)n+1=(a+b)(a+b)n=(a+b)k=0n(nk)akbnk=k=0n(nk)ak+1bnk+k=0n(nk)akbnk+1=k=0n1(nk)ak+1bnk+an+1+bn+1+k=1n(nk)akbnk+1=j=1n(nj1)ajbn(j1)+an+1+bn+1+k=1n(nk)akbn+1k=bn+1+k=1n[(nk1)+(nk)]akbn+1k+an+1=bn+1+k=1n(n+1k)akbn+1k+an+1=k=0n+1(n+1k)akbn+1k
Consider B(a,b)=k=0n(nk)akbnk. This finite sum_is known as the Binomial Series.
Show that B(a,b)=(a+b)n
Show that B(1,1)=2n
Show that B(1,1)=0
Show that B(p,1p)=1
Easily, B(x,1)=k=0n(nk)ak
(a+b+c)n=k1+k2+k3=n(nk1,k2,k3)ak1bk2ck3
where (nk1,k2,k3)=n!k1!k2!k3!. This can be generalized to any number of terms to give what is know as a multinomial series.