Finite: permutation, combinition, combinitiories. Monochromatic Tom has the following in his closet: A) shirts: 2 red, 3 yellow, 4 blue, B) Ties: 5 red, 6 yellow, and 7 blue. C) Pants: 8 red, 9 yellow, 10 blue. assuming that Tom ONLY wears outfits in which the shirt, tie, and pants are the same color, how many posible ways can tom dress?
Permutations and Combinations
If there are 5 dishes, they can be relished in any order at a time. In permutation, it should be in a particular order. In combination, the order does not matter. Take 3 letters a, b, and c. The possible ways of pairing any two letters are ab, bc, ac, ba, cb and ca. It is in a particular order. So, this can be called the permutation of a, b, and c. But if the order does not matter then ab is the same as ba. Similarly, bc is the same as cb and ac is the same as ca. Here the list has ab, bc, and ac alone. This can be called the combination of a, b, and c.
Counting Theory
The fundamental counting principle is a rule that is used to count the total number of possible outcomes in a given situation.
Finite: permutation, combinition, combinitiories.
Monochromatic Tom has the following in his closet:
A) shirts: 2 red, 3 yellow, 4 blue,
B) Ties: 5 red, 6 yellow, and 7 blue.
C) Pants: 8 red, 9 yellow, 10 blue.
assuming that Tom ONLY wears outfits in which the shirt, tie, and pants are the same color, how many posible ways can tom dress?
Introduction:
According to the combination rule, if r distinct items are to be chosen from n items without replacement, in such a way that the order of selection does not matter, then the selection can be made in (nCr) = n! / [r! (n – r)!] = [n (n – 1) … (n – r + 1)] / r! ways.
Step by step
Solved in 2 steps
