Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Columba has two dozen each of n different coloured beads. If she can select 20 beads (with repetition of colors allowed) in 230,230 ways, what is the value of n?

I'm trying to figure it out, but I'm having some trouble. I know that the question is asking how many colors are there, but I'm not sure how to go about getting there. Is there an applicable formula? And if so, what's it called?

share|cite|improve this question
up vote 3 down vote accepted

This is stars-and-bars problem in reverse, so to speak: since she has enough beads of each color to select all $20$ from a single color, the number of ways to choose the $20$ beads is $$\binom{20+n-1}{n-1}=\binom{19+n}{n-1}=\binom{19+n}{20}\;.$$ (The linked article has a reasonably good explanation of this formula.) You therefore have


A little trial and error reveals that $230,230=\dbinom{26}{20}$, so $19+n=26$, and $n=7$.

share|cite|improve this answer
+Nice answer, thorough, and quick(er than me)! – amWhy Jan 28 '13 at 2:37
@amWhy: Thanks. I was hoping to find a nice way to avoid the trial and error, but nothing occurred to me quickly. – Brian M. Scott Jan 28 '13 at 2:38
Why do you have 20 as the bottom of the third equation in the top? I don't get how $n-1$ turned into $20$, even after reading Wikipedia. – Doug Smith Jan 28 '13 at 3:41
@Doug: I’m just using the fact that $\binom{m}k=\binom{m}{m-k}$, here with $m=19+n$ and $k=n-1$, so that $m-k=20$. – Brian M. Scott Jan 28 '13 at 3:44
Ah. Thank you for the fantastic explanation. – Doug Smith Jan 28 '13 at 4:22

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.