Probability Question

  • #1
125
0

Homework Statement



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

Homework Equations


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


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?
 
Last edited:

Answers and Replies

  • #3
125
0
Having some trouble getting my head around this still.
 

Related Threads on Probability Question

  • Last Post
Replies
11
Views
929
  • Last Post
Replies
4
Views
853
  • Last Post
Replies
4
Views
987
  • Last Post
Replies
5
Views
2K
  • Last Post
Replies
1
Views
1K
  • Last Post
Replies
5
Views
803
  • Last Post
Replies
1
Views
622
  • Last Post
Replies
5
Views
825
  • Last Post
Replies
3
Views
940
  • Last Post
Replies
2
Views
1K
Top