Ask your own question, for FREE!
Mathematics 20 Online
OpenStudy (anonymous):

Can someone help prove to me Pascal's Identity?

OpenStudy (kinggeorge):

Probably. What method are you trying to use?

OpenStudy (anonymous):

Algebraically.

OpenStudy (kinggeorge):

Well, we start out with \[\binom{n}{k}+\binom{n}{k-1}\]and our goal is to show that this is equal to \[\binom{n+1}{k}\]First step, write everything out.

OpenStudy (kinggeorge):

\[\begin{align} \binom{n}{k}+\binom{n}{k-1}&=\frac{n!}{k!(n-k)!}+\frac{n!}{(k-1)!(n-(k-1))!} \\ &=\frac{n!}{k!(n-k)!}+\frac{n!}{(k-1)!(n-k+1)!} \\ &=\frac{n!(n-k+1)}{k!(n-k+1)!}+\frac{kn!}{k!(n-k+1)!} \end{align}\]

OpenStudy (anonymous):

In my humble opinion, many of these proofs just require using the definition.

OpenStudy (anonymous):

Ok thanks.

OpenStudy (kinggeorge):

Combine the fractions to get \[\begin{align}&=\frac{n!(n-k+1)+kn!}{k!(n-k+1)!}\\ &=\frac{n!(n-k+1+k)}{k!(n-k+1)!}\\ &=\frac{n!(n+1)}{k!((n+1)-k)!} \end{align}\]You should be able to take it from there.

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!
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!