






Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Examples and solutions related to combinatorics and permutations, including tree diagrams, password choices, and subcommittee formations. It covers the multiplication principle, permutation and combination rules, and their real-life applications.
Typology: Exams
1 / 10
This page cannot be seen from the preview
Don't miss anything!
A tree diagram is helpful in visualizing all possible outcomes, choices, or events. Suppose an experiment consists of tossing a coin, followed by rolling a die. To list all the possible outcomes, we can construct a tree diagram.
EXAMPLE 1 A restaurant has a lunch special menu. The lunch special will be served on one plate; which includes rice and two items. Item 1: Side: noodles, salad, or stir fry vegetable Item 2: Entrée: eggplant with tofu, broccoli chicken, pepper steak, or spicy beef
Construct a tree diagram and find the total number of possible plate combinations.
Solution:
H
1 H
2 H
3 H 4 H
5 H
6 H
T
1 T 2 T 3 T 4 T
5 T 6 T
H = Head T = Tail
for the lunch special.
EXAMPLE 1 You have to choose a password containing exactly 4 characters, i.e. 2 letters (case sensitive), followed by 2 numbers, how many different choices of passwords are possible?
Solution:
Possible choices Possible choices Possible choices Possible choices for the first letter for the first letter for the first number for the second number (a – z, A – Z) (a – z, A – Z) (0 – 9) (0 – 9)
52 52 10 10 = 270,
There are 270,400 choices of passwords.
noodles (n)
eggplant with tofu (e)
broccoli chicken (c)
pepper steak (p)
spicy beef (b)
salad (s)
eggplant with tofu (e)
broccoli chicken (c)
pepper steak (p)
spicy beef (b)
stir fry vegetable (v)
eggplant with tofu (e) broccoli chicken (c)
pepper steak (p)
spicy beef (b)
If a choice consists of i steps, of which the first step can be made in n 1 ways, the second in n 2 ways,…, and the last step in ni ways, then the number of different ways possible choices can be made is
EXAMPLE 1 Calculate 5!
Solution:
EXAMPLE 2
Solution:
EXAMPLE 3 Find the number of ways we can arrange the letter A, B, C, D if no repetition is allowed.
Solution: We can use either the multiplication principle or factorial notation.
Using Multiplication Principle
Since no repetition is allowed, we only have 3 choices for the second letter. We use one choice for the first letter so only 3 choices are left for the second letter, 2 choices left for the third and 1 choice left for the last letter.
First Letter Second Letter Third Letter Fourth Letter (4 choices) (3 choices) (2 choices) (1 choice)
Using Factorial Notation
Factorial Notation yields the same result.
If n is a natural number, then n! (read as “ n factorial”), is given by
Therefore, there are 24 ways to arrange the letters A, B, C, and D if no repetition is allowed.
EXAMPLE 1 How many 3 digit numbers can be formed from numbers 1, 2, 3, 4, 5, 6, 7, 8, 9 if no repetition is allowed?
Solution:
Understanding
Here we can use permutation with n = 9 and r = 3 because the order is important and there is no repetition. The number 215 is different from 125.
Using the Permutation Rule
9 3
Interpreting the result
There are 504 different 3-digit numbers which can be formed from numbers 1, 2, 3, 4, 5, 6, 7, 8, 9 if no repetition is allowed.
Note : We can also use the multiplication principle to answer this question.
EXAMPLE 2 A board of directors of an HOA (Home Owner’s Association) consists of 8 people. How many ways can the HOA members pick a president, a secretary, and a treasurer from the board of directors?
Solution:
Understanding We can use permutation with n = 8 and r = 3 because the order is important and there is no repetition.
The number of ways in which r objects can be selected in a specific order from n distinct objects
Interpreting the Result There are 35 different color combinations containing three colors out of the seven primary colors of rainbow.
EXAMPLE 2 A committee consisting 12 members must form a subcommittee consisting of 4 members. How many different subcommittees are possible?
Understanding Here, we can use combination with n = 12 and r = 4. The order is not important because there is no ranking of subcommittee members. Also there is no repetition.
Using the Combination Rule
12 4
Interpreting the Result There are 495 possible subcommittees of size 4 chosen from the 12 members.
EXERCISES: Constructing a Tree Diagram
In exercises 1 - 2, construct a tree diagram to represent all possible choices (or outcomes) and determine the total number of available choices (or outcomes).
Applying the Multiplication Principle
In exercises 3 - 7, apply the multiplication principle to answer the questions.
Using the Factorial Notation
In Exercises 8 - 13, calculate the given factorial.
Using the Permutation Rule
In Exercises 14 - 27, calculate the given permutation. Express large values using E-notation with the mantissa rounded to two decimals.