0% found this document useful (0 votes)
18 views4 pages

Unit 5 - Lesson 8

Unit 5 – Lesson 8 covers combinatorics, focusing on counting principles, permutations, and combinations. Key concepts include the multiplication counting principle, factorial notation, and the distinction between permutations and combinations. The lesson includes various examples and practice problems related to arranging objects, forming teams, and creating codes.

Uploaded by

Yujin Bae
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
18 views4 pages

Unit 5 - Lesson 8

Unit 5 – Lesson 8 covers combinatorics, focusing on counting principles, permutations, and combinations. Key concepts include the multiplication counting principle, factorial notation, and the distinction between permutations and combinations. The lesson includes various examples and practice problems related to arranging objects, forming teams, and creating codes.

Uploaded by

Yujin Bae
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Unit 5 – Lesson 8 – Combinatorics

The branch of mathematics that deals with counting up the number of possibilities is called combinatorics.
Even though there are not that many concepts, many students find this to be tricky topic because the
number of possible variations is nearly limitless.

A. Multiplication Counting Principle


Suppose one event can be chosen 𝑝 different ways, and another independent event can be chosen 𝑞
different ways. Then the two events can be chosen successively in 𝑝 × 𝑞 different ways.

B. 𝒏!
𝑛! is defined as 𝑛! = 𝑛 × (𝑛 − 1) × (𝑛 − 2) × … × 1 for positive integers 𝑛, and is read 𝑛 factorial.
(0! is defined to be equal to 1)

C. Permutations
𝑛! is the number of ways of arranging all 𝑛 objects in order. This is known as the number of
permutations of 𝑛 objects.
If 𝑛 ≥ 𝑟, then the number of ways of arranging 𝑟 out of 𝑛 objects in order is called the number of
permutations of 𝑛 objects taken 𝑟 at a time.
!!
The formula for this is 𝑃(𝑛, 𝑟) = ! 𝑃" = (!%")!
!!
The number of permutations of 𝑛 objects of which 𝑝 objects and 𝑞 other objects are alike is
'! )!
.

D. Combinations
A combination is a selection of objects without regard to order or arrangement. The number of
combinations of n objects taken 𝑟 at a time can be found by:
𝑛! 𝑛
𝐶(𝑛, 𝑟) = ! 𝐶" = = .𝑟/
(𝑛
𝑟! − 𝑟)!

To distinguish between permutations and combinations, deduce whether the order matters or not.

Example 1: Lunch Menu


The lunch set special at Casanova consists of 3 courses: a starter, a main course, and a dessert. If there
are 6 choices for an appetizer, 8 choices of a course, and two choices for a dessert, how many essentially
different lunches possible.

Example 2: Lottery Odds


In order to win, you have to pick the correct six numbers from 50 possible balls. No number is repeated.
How many possibilities are there?

Example 3: Arranging Letters


a. How many ways can the letters in the word VECTOR be rearranged?
b. In how many of these arrangements do the vowels come first?

c. In how many different ways can the letters in the following words be arranged?

i. ORANGE

ii. PAPAYA

Example 4: Picking Teams


a. A track team has 4 sprinters. How many ways can they arrange themselves for a relay.

b. A track team has 7 sprinters. How many ways can this team arrange themselves for a 4-person relay?

c. If a track team has 7 distance runners and is allowed to enter 4 runners in the 1500-meter race, in how
many ways can the 4 runners be chosen?

Example 5: Forming Codes


a. How many different 2-symbol code words can be formed if the first symbol is an upper-case letter and the
second symbol is a digit.

b. How many different 6-digit numbers can be formed from the digits in 314 159?

c. How many of the numbers on b. are even?

d. How many different 6-digit numbers can be formed using the digits 1, 3, 4, 5, and 9, if the digits can be
re-used any number of times?
Example 6: Algebra: simplify

a. *+ 𝐶, =

-!
b. =
! ."

(!/*)!
c.
(!%*)!
=

Example 7: Choosing Committees


The Prom Committee at a school consists of 6 girls and 4 boys. They need to choose a subcommittee with 4
members to be in charge of decorations.
a. How many ways can the Decorations subcommittee be chosen?

b. How many ways can the subcommittee be chosen if there must be two boys and two girls?

c. How many ways can the subcommittee be chosen with at least two girls?

d. Use the problem c. to explain when you add, and when you multiply.

Example 8: Card Games


From a standard deck of 52 cards, how many 5 card hands are possible that consists of:

a. all black cards

b. 3 clubs and 2 spades

c. a pair of kings and 3 other cards

d. a full house
Example 9: Eight books are arranged on a shelf, 3 math books and 5 novels.

a. How many different arrangements are possible if there are no restrictions, and the titles are all different?

b. How many different arrangements are possible if books of the same type must be kept together?

Practice:

1. Lejla is the Chairperson of a committee.


In how many ways can a committee of 5 be chosen from 10 people given that Julie must be one of them.

2. A subcommittee of four people is formed from a committee of nine people. Nami must be on the
subcommittee. Bjarne is not eligible to be on the subcommittee.
How many ways are there to form the subcommittee under the given conditions?

3. The password to your phone consists of four numbers.


i. How many passwords are possible?

ii. What if all numbers must be different?

4. 4-digit numbers are constructed from the digits 1, 2, 3, 4, 5, 6, 7, 8 and 9 using each digit at most
once. How many such numbers can be constructed if the third digit should not be a 3?

5. 3-digit numbers are constructed from the digits 0 to 9 using each digit at most once. How many such
numbers can be constructed?

You might also like