Anurag@Gurome wrote:karthikpandian19 wrote:The Carson family will purchase three used cars. There are two models of cars available, Model A and Model B, each of which is available in four colors: blue, black, red, and green. How many different combinations of three cars can the Carsons select if all the cars are to be different colors?
24
32
48
60
192
If Explanation is provided with the answer it would be great
1st car can be selected from 8 cars in 8 ways
2nd car can be selected from 6 cars in 6 ways
3rd car can be selected from 4 cars in 4 ways
Hence, # of possible combinations = (8 * 6 * 4)/3! =
32
The correct answer is
B.
I had a hell of a problem understanding why the combination had to be divided by 3!.
I went back to the basics and found something which helped me understand.Putting it down for people who may have been in the same boat.
Well we know that the only difference between permutation and combination:
Permutation :arrow: is when order does not matter=nPr
Combination :arrow: is when order does matter =nCr
If we write down the mathematical notations of both we know that
nPr=n!/(n-r)! :arrow: order does not matter i.e. all the possible combinations.But when we want to find the total number of combinations :arrow: order does matter,we divide the Number of permutations by r! or nCr=nPr/n!=n!/r!(n-r)!
Therefore in the problem:
Hence, # of possible combinations = (8 * 6 * 4)/3! = 32
8*6*4 actually is the number of permutations.And then converting it into a combination by dividing by r!,which in this case is 3!.
Phew!
For those who want to find how nCr=nPr/r! is derived,read the following article.
https://www.mathsisfun.com/combinatorics ... tions.html