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

Fool's problem of the day: Prove that \( \sum \limits_{k=0}^{n-r} = \binom{n}{k} \times \binom{n}{r+k} = \binom{2n}{n-r} \) Lets see who can come up with the solution first!

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!