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

I need to prove by counting two ways (m+n) C k

OpenStudy (anonymous):

\[\sum_{i=0}^{k}\left(\begin{matrix}m \\ i\end{matrix}\right)\left(\begin{matrix}n \\ k-i\end{matrix}\right)=\left(\begin{matrix}m+n \\ k\end{matrix}\right)\]

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!