Counting balls in boxes

[noblerare]

1. The problem statement, all variables and given/known data

Specifically,

How many ways can you divide up 20 distinct balls into 5 distinct boxes so that no box contains more than 10 balls?

2. Relevant equations
This is similar to another problem in which we have to find the number of ways to divide up r balls into k boxes.

x_1+x_2+x_3+\ldots+x_k = r where each x_i \geq 0

This is equal to \binom{r+k-1}{k-1}

If, we set a lower-bound on the number of balls in boxes, say, each box must contain at least s balls, then the answer is: \binom{r-s+k-1}{k-1}.

My question is: How do I go about setting an upper-bound for the number of balls in each box?

3. The attempt at a solution

In my problem, I have to find the solutions for:
x_1+x_2+x_3+x_4+x_5 = 20 such that each x_i \leq 10

I am unsure how to start or approach this problem. Any help would be greatly appreciated.

[noblerare]

bump, can anybody help?

[Kelley]

I'm not sure what this notation means:

\binom{r-s+k-1}{k-1}

Firstly work out how many ways there are to put 20 different balls in 5 different boxes, this is a nice easy bit of stats you can look up on wiki (combinations/permutations). Once you have this number you need to take away all the permutations where there are more than 10 balls in a box, slightly more challenging :)

[snshusat161]

I'm not sure what this notation means:

\binom{r-s+k-1}{k-1}

Firstly work out how many ways there are to put 20 different balls in 5 different boxes, this is a nice easy bit of stats you can look up on wiki (combinations/permutations). Once you have this number you need to take away all the permutations where there are more than 10 balls in a box, slightly more challenging :)


It's another way of writing

^nC_r

[Kelley]

It's another way of writing

^nC_r



Ah...

Makes sense!