Counting, induction and discrete probability: basics of counting, pigeonhole principle, permutations and combinations, inclusion–exclusion principle, mathematical induction, probability, Bayes' theorem. - Online Test
30:00
1. What is the fundamental principle that states if n items are put into m containers, with n > m, then at least one container must contain more than one item?
2. In how many ways can a committee of 3 people be chosen from a group of 10 people?
3. What is the number of permutations of n distinct objects taken r at a time, denoted as P(n, r)?
4. What is the number of combinations of n distinct objects taken r at a time, denoted as C(n, r)?
5. If a task can be performed in m ways, and after it is performed, a second task can be performed in n ways, then the two tasks can be performed in sequence in how many ways?
6. If a task can be performed in m ways and a second task can be performed in n ways, and these tasks cannot be performed at the same time, then the task can be performed in how many ways?
7. Which principle is used to count the number of elements in the union of multiple sets?
8. What is the principle of mathematical induction used for?
9. What are the two steps involved in a proof by mathematical induction?
10. In probability, what is the set of all possible outcomes of an experiment called?
Test Results
0/0