DISCRETE MATH PROBLEM Suppose that a school has 8 freshmen, 10 sophomores, 12 juniors, and 20 seniors. For the following give an exact numerical answer: a) How many committees can be made if it must have exactly 2 from each grade? Give an exact numerical answer. b) A President, Vice President, and Treasurer will be chosen. How many ways can that be done if it is not allowed that all 3 people are from the same grade
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.
DISCRETE MATH PROBLEM
Suppose that a school has 8 freshmen, 10 sophomores, 12 juniors, and 20
seniors. For the following give an exact numerical answer:
a) How many committees can be made if it must have exactly 2 from each grade? Give an
exact numerical answer.
b) A President, Vice President, and Treasurer will be chosen. How many ways can that be
done if it is not allowed that all 3 people are from the same grade?
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
