(New page: Using Binomial Theorem, <math>(a+b)^n=\binom{n}{0}a^n+ \binom n 1 a^{n-1} b+...+\binom{n}{n}b^n</math>. We have <math>\binom{n}{0}+ \binom{n}{1}+...+\binom{n}{n}=(1+1)^n=2^n</math>)
 
Line 1: Line 1:
 
Using Binomial Theorem, <math>(a+b)^n=\binom{n}{0}a^n+ \binom n 1 a^{n-1} b+...+\binom{n}{n}b^n</math>.
 
Using Binomial Theorem, <math>(a+b)^n=\binom{n}{0}a^n+ \binom n 1 a^{n-1} b+...+\binom{n}{n}b^n</math>.
 +
 
We have <math>\binom{n}{0}+ \binom{n}{1}+...+\binom{n}{n}=(1+1)^n=2^n</math>
 
We have <math>\binom{n}{0}+ \binom{n}{1}+...+\binom{n}{n}=(1+1)^n=2^n</math>

Revision as of 08:53, 7 September 2008

Using Binomial Theorem, $ (a+b)^n=\binom{n}{0}a^n+ \binom n 1 a^{n-1} b+...+\binom{n}{n}b^n $.

We have $ \binom{n}{0}+ \binom{n}{1}+...+\binom{n}{n}=(1+1)^n=2^n $

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood