A box contains ten bricks identical except for color. Three bricks are red, two are white, two are yellow, two are blue and one is black. In how many ways can three distinguishable bricks be:
(a) taken from the box
(b) arranged in a row?
I can't hit on any way to find (a), pairs of same colored bricks are possible as long as a differently colored brick is in the middle, but other than this I don't know what to do. And for (b) I don't know either.
I really am horrible at this permutations and combinations, so any help will be greatly appreciated.
Short of using a generating function the only other way is to take up the various cases.
There is one way that all three can be the same color: red.
How many ways can all three be different colors?
How many ways can only two be of different colors?
So make a list and count.
Using a generating function we expand .
Doing so we see that the coefficient of is 27.
That is the number of ways to select three bricks.
To do part (b), count the arrangements in each of the three cases.
There is one way to arrange all red.
There are ways to arrange three different colors.
There are ways to arrange two of one colors and one different color.