Learners apply the fundamental counting principle to simple or compound digit problems.
After completing this tutorial, you will be able to complete the following:
Fundamental Counting Principle
The fundamental counting principle allows us to calculate the amount of memory needed by a computer, calculate the odds of a winning poker hand, or even determine the number of pizzas available from the local pizza shop. It is an essential theorem in mathematics on which probability and statistics rely.
In its most general form, the theorem is stated as follows.
Theorem: Let be finite sets with elements, respectively. The Cartesian productcontainselements.
In this Activity Object, the Fundamental Counting Principle is used to count integers that satisfy certain criteria. For example, learners will count the number of three digit integers containing distinct digits.
First digit: Can be any number between 1 and 9.
Second digit: Can range from 0 to 9, but cannot equal the first.
Third digit: The last digit must be distinct from both the first and second.
The Fundamental Counting Principle is applied as follows.
Therefore, there are 648 three digit numbers with distinct digits.
|Approximate Time||30 Minutes|
|Pre-requisite Concepts||basic concept of probability, fundamental counting principle|
|Type of Tutorial||Skills Application|
|Key Vocabulary||compound digits, fundamental counting principle,|