Enrol to start learning
Reading is open to everyone. Enrolling is free, and it is what unlocks the audio lessons, practice tests and progress tracking.
10. Basic Rules of Counting
The lecture covers basic counting rules in discrete mathematics, focusing on the product rule, sum rule, and the pigeonhole principle. It explains how to count distinct arrangements and combinations, as well as apply these rules in various scenarios. Practical examples illustrate the application of these principles, particularly in counting functions and determining valid passwords.
Sections
This section introduces the fundamental counting rules: the product rule, sum rule, and the pigeonhole principle.
Counting is fundamental in discrete mathematics with methodologies for addressing how many of certain objects or arrangements exist.
The product rule allows for calculating the number of ways to accomplish a set of sequential tasks by multiplying the number of ways to accomplish each subtask.
The sum rule enables counting distinct outcomes by adding the number of ways to accomplish disjoint tasks.
Product Rule
A counting method used to find the total number of ways to perform tasks that can be broken down into subtasks; if subtasks are independent, the total is the product of the ways to complete each subtask.
Sum Rule
A counting method applied to find the total number of ways to complete a task that can be done in different, disjoint ways by summing the number of ways for each way.
Pigeonhole Principle
A principle stating that if n items are put into m containers (where n > m), then at least one container must contain more than one item.
Practice Exercises
Total Questions
2
Estimated Time
4 min
Passing Score
70%
Instructions
- Read each question carefully
- You can use hints if you need help
- Complete all questions before submitting
Get your answers marked and your progress tracked
Enrol free