Lesson 5
1. Lesson 5
1.4. Discover
Module 3: Permutations, Combinations, and the Fundamental Counting Principle
Discover
In Module 2 you learned that the probability of any event =
![]()
Determining the number of events often involves the use of the fundamental counting principle, permutations, and/or combinations.
Try This 1
It is possible to find different types of name generators online. Typically, word patterns are used to generate a reasonable sounding name. Consider the following superhero name generator. The superhero name becomes the _____A_____ ______B_____ _____C_____, where A, B, and C are words chosen randomly from the following lists.
| A | B | C |
Amazing |
Atomic |
Admiral |
- How many three-word names can be made from the table?
- Pick a superhero name that matches your personality. What is the probability that a three-word name picked at random will match your name?

- What is the probability that a name, picked at random, will have an animal as the second word?
- What is the probability that a random new name will have the initials G. S. W.?

Save your responses in your course folder.
Share 1
With a partner or group, discuss the following questions based on what you discovered in Try This 1.
- How do your strategies for determining the number of possible names compare?
- Did you use the same strategy to solve Try This 1 question 4? What other strategies could you use?
If required, save a record of your discussion in your course folder.