mmeital wrote:Brent,
The reason we can use FCP in this question is because each set of colored balls is IDENTICAL correct? How would you solve this question if we weren't told this bit of information?
In other words, what is the answer if the colored balls are NOT identical?
Here's the quick approach.
First recognize that, if the colored balls are NOT identical, then we basically have 9 different balls. In how many different ways can we select some (or even none) of these balls?
Let's take the balls and call them ball #1, ball #2, ball #3, . . . ball #9
Take the task of selecting the balls and break it into 9 stages.
Stage 1: determine whether or not ball #1 is to be included in the selection.
This stage can be accomplished in 2 ways (select it or don't select it)
Stage 2: determine whether or not ball #2 is to be included in the selection.
This stage can be accomplished in 2 ways (select it or don't select it)
Stage 3: determine whether or not ball #3 is to be included in the selection.
This stage can be accomplished in 2 ways.
.
.
.
Stage 9: determine whether or not ball #9 is to be included in the selection.
This stage can be accomplished in 2 ways.
By the FCP, the total number of ways to select some (or none) of the balls (if the colored balls are NOT identical) is equal to 2x2x2x2x2x2x2x2x2 = 2^9 = 512
Cheers,
Brent