Trudy has 180 Trick-or-Treat goody bags in her shop. 120 of her bags contain candy, 95 of her bags contain a small toy, and 45 of her bags contain both candy and a small toy. A. How many of her treat bags do not contain both candy and a small toy? B. How many of her bags contain candy but do not contain a small toy? C. How many of her bags contain a small toy or candy or both?
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.
Trudy has 180 Trick-or-Treat goody bags in her shop. 120 of her bags contain candy, 95 of her bags contain a small toy, and 45 of her bags contain both candy and a small toy.
A. How many of her treat bags do not contain both candy and a small toy?
B. How many of her bags contain candy but do not contain a small toy?
C. How many of her bags contain a small toy or candy or both?
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
