(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

prove that

[tex]\sum[/tex]^{n}_{k=0}([tex]^{n}_{k}[/tex]) ([tex]^{m-n}_{n-k}[/tex]) = ([tex]^{m}_{n}[/tex])

2. Relevant equations

2^{n}=[tex]\sum[/tex][tex]^{n}_{k=0}[/tex] ([tex]^{n}_{k}[/tex])

3. The attempt at a solution

I know that every summand on the left hand side is a member of the power set times the combinations of it's complement and we can think of them in terms of the set changing with every possible combination, 1 element at a time and 2 at a time, 3 at a time, ..., n at a time. Or something like that... Definitely having trouble putting this into words let alone an equation. I certainly see the connection but am needing a little help on the proof. Please not the whole proof but just a little help putting it into words?

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Probability Question

**Physics Forums | Science Articles, Homework Help, Discussion**