A k-element selection, repetitions allowed, with a twist

  • Context: Undergrad 
  • Thread starter Thread starter dumbQuestion
  • Start date Start date
Click For Summary
SUMMARY

The discussion revolves around the challenge of calculating combinations when the selection sets have limited quantities, specifically in the context of selecting 8 balls from three colored piles with varying amounts. The standard formula C(k+t-1,t-1) is applicable only when each pile has sufficient balls. When faced with limited quantities, such as 2 blue, 3 red, and 4 yellow balls, the approach shifts to counting combinations manually or adjusting the selection criteria. The conversation emphasizes the importance of defining constraints, such as requiring at least one ball of each color, to accurately determine the number of valid combinations.

PREREQUISITES
  • Understanding of combinatorial mathematics, specifically combinations and permutations.
  • Familiarity with the formula C(k+t-1,t-1) for combinations with repetitions.
  • Basic knowledge of constraints in combinatorial problems.
  • Ability to analyze and adapt mathematical problems based on given conditions.
NEXT STEPS
  • Explore advanced combinatorial techniques for limited selection sets.
  • Learn about generating functions in combinatorics for constrained problems.
  • Study the principle of inclusion-exclusion in combinatorial counting.
  • Investigate specific examples of constrained combinations in probability theory.
USEFUL FOR

Mathematicians, students studying combinatorics, educators teaching probability and statistics, and anyone interested in solving complex selection problems with constraints.

dumbQuestion
Messages
124
Reaction score
0
Hey I have kind of a general question.

In my textbook, there are lots of questions that go something like this:

"Say we have 3 piles of balls, a blue pile, a red pile, and a yellow pile. Each pile has at least 8 balls. How many ways can we pick 8 balls from these three piles?"

(so for example in this case you could pick YYYYYYYY or BYYRRRRR, etc.)

In this case we use C(k+t-1,t-1) formula

But I'm stumped on ideas like this:

What if I take the above scenario, but this time the "blue pile" has only 2 balls, while the rest have 8. And I'd still like to pick 8 balls. I can't use the formula like normal because there are less options: for example BBBYYRRR isn't an answer as there are only 2 blue balls in the pile. Now let me go even further and say, there are only 2 blue balls, and only 3 red balls and only 4 yellow balls and I want to make a selection of 8 balls. I am completely stumped as to how to do this as I can't apply the normal formulas.

So I guess, is there a formula for when one of your sets is "limited"? Every single problem in the book the example is to make a k-element selection but the "sets" you are choosing from always have at least k elements in their set so you don't run into this problem.This is NOT a HW problem, this is just something I keep trying to figure out on my own. I am really, really poor at combination/permutation stuff so there is most likely a very easy answer to this I'm just not seeing.
 
Physics news on Phys.org
In that case you have to count them out rather than use the formula.

If you don't care which colors are included, then it is just the number of ways of picking eight balls from 8+8+2 balls. For anything else you need to be specific - eg: perhaps you must have at least one ball of each color?

In that case, you are selecting from 7+7+1 balls in five trials (the first three are certain).
Does the order matter? Stuff like that. But you should have got an idea how to think about these now.
 

Similar threads

  • · Replies 29 ·
Replies
29
Views
6K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
2
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K