You are given a sack containing $n$ red balls and $n$ blue balls. You take the balls out of the sack one by one and write down the sequence of reds and blues you get. How many sequences are possible?
Counting ordered selection with repeats allowed
1
$\begingroup$
combinatorics
discrete-mathematics
1 Answers
3
HINT: A sequence is completely determined by the position in it of the $n$ red balls: once you know where they are, you also know where the blue balls are. How many different sets of $n$ positions are there in a string of $2n$ positions?
-
0@Herp: Combinatorics problems can be deceptive in either direction. – 2012-11-08