How Does Combinatorics Help in Choosing Committees?

  • Thread starter Thread starter davemoosehead
  • Start date Start date
  • Tags Tags
    Combinatorics
Click For Summary

Homework Help Overview

The discussion revolves around a combinatorial identity involving binomial coefficients, specifically focusing on proving the equality of two expressions by counting in different ways. The original poster presents a specific case of this identity and seeks to understand how the selection process changes as the pool of candidates increases.

Discussion Character

  • Exploratory, Assumption checking, Problem interpretation

Approaches and Questions Raised

  • Participants explore the implications of the left-hand side (LHS) and right-hand side (RHS) of the identity, questioning how the selection process works when the pool size changes. There is an attempt to reframe the problem by considering what is not chosen rather than what is chosen.

Discussion Status

The conversation is ongoing, with participants sharing observations and seeking clarification on specific aspects of the identity. Some guidance has been offered regarding the interpretation of the selections, but no consensus has been reached on the overall understanding of the problem.

Contextual Notes

Participants express confusion regarding the changing pool size and the implications of selecting from it. There are references to specific examples and scenarios that illustrate the challenges in visualizing the problem.

davemoosehead
Messages
26
Reaction score
0

Homework Statement



{n \choose 0} + {n+1 \choose 1} + {n+2 \choose 2}+...+{n+r \choose r} = {n+r+1 \choose r}

We have to prove by counting both sides in a different way.

For example, consider {n \choose 0}^2 + {n \choose 1}^2+...+{n \choose n}^2 = {2n \choose n}
The RHS can be described as a way to choose a committee of size n from n women and n men.
Then, the LHS is the number of ways to choose a committee of size n with 0 women and n men + number of ways to choose 1 woman and n-1 men, etc.

The Attempt at a Solution


The confusing part for me on this problem is that the amount you choose from doesn't stay the same. I'm having trouble thinking of a scenario where the pool you choose from increases as you choose more.

One observation I've made is that (for the LHS) the amount you DON'T choose is always the same, n.
 
Physics news on Phys.org
davemoosehead said:
One observation I've made is that (for the LHS) the amount you DON'T choose is always the same, n.

Hi davemoosehead! :smile:

The RHS is the number of ways of choosing n+1 from n+r+1, and as you say the LHS is different numbers of ways of choosing n …

so where does the extra one come in? :wink:
 
tiny-tim said:
Hi davemoosehead! :smile:

The RHS is the number of ways of choosing n+1 from n+r+1, and as you say the LHS is different numbers of ways of choosing n …

so where does the extra one come in? :wink:

I've been thinking about this all afternoon, and still cannot come up with anything. It's given me a new way of looking at it though which makes it look less intimidating.

So you're saying think of it in terms of what we're not choosing (n+1), rather than what we are choosing (r). So..
<br /> {n \choose n} + {n+1 \choose n} + {n+2 \choose n}+...+{n+r \choose n} = {n+r+1 \choose n+1}<br />
would this be equivalent?
 
Yes …

and now concentrate on where the first one (of n+1) is. :wink:
 
tiny-tim said:
Yes …

and now concentrate on where the first one (of n+1) is. :wink:

If we lined up all the n+r+1 things, the first one of {n+1 \choose n} would be the one after the last one of {n+1 \choose 1}
 
uhh? :confused:

No, I meant eg how many selections are there (of n+1 from n+r+1) in which the first one selected is number 7 (ie the previous 6 are not selected)? :smile:
 
tiny-tim said:
uhh? :confused:

No, I meant eg how many selections are there (of n+1 from n+r+1) in which the first one selected is number 7 (ie the previous 6 are not selected)? :smile:

If the first 6 are not selected, then you would have (n+r+1-6 C n+1) ?

I'm having a hard time following what you are saying.
 
davemoosehead said:
If the first 6 are not selected, then you would have (n+r+1-6 C n+1) ?

Yes, but if the first one selected is number 7 (ie the previous 6 are not selected)?
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
17
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 22 ·
Replies
22
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
6K