A child has 20 pieces of Halloween candy. They are as follows: 6 of them are chocolate bars, 9 are gummy bears, and 5 are licorice sticks. How many ways are there to select two pieces from each category to share with their best friend? A. 43000 B. 1100 C. 5400 D. 38760
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.
A child has 20 pieces of Halloween candy. They are as follows: 6 of them are chocolate bars, 9 are gummy bears, and 5 are licorice sticks. How many ways are there to select two pieces from each category to share with their best friend?
A. 43000
B. 1100
C. 5400
D. 38760
Combinations:
The number of combinations of r items selected from n items is,
Selecting two pieces from 6 chocolate bars can be drawn in ways, selecting two pieces from 9 gummy bars can be drawn in ways, and selecting two pieces from 5 licorice sticks can be drawn in ways.
Step by step
Solved in 2 steps
