Math│3rd Quarter

Content:

• Fundamental Counting Principles

• Factorial Notations
• Permutations
▪ Permutation of n objects taken r at a time
▪ Distinguishable Permutations
▪ Circular Permutations
• Combinations
• Probability
 Fundamental Counting Principles
Used to determine the number of possible outcomes with two or more data.
If the data are independent, you can just multiply them.

Example 1:
There are 2 entrees, 3 main dishes, and 2 desserts available.
𝟐 × 𝟑 × 𝟐 = 𝟏𝟐
There are 12 possible outcomes in this situation.

Example 2:
Rolled a dice and flipped a coin.
𝟔 × 𝟐 = 𝟏𝟐
There are also 12 possible outcomes.

Example 3:
How many 4-digits numbers can you create using “0, 1, 2, 3, 4, 5”?
The number can’t have “0” as its 1st digit.

If there are repetition:

𝟓 × 𝟔 × 𝟔 × 𝟔 = 𝟏, 𝟎𝟖𝟎

If there are no repetition:

𝟓 × 𝟓 × 𝟒 × 𝟑 = 𝟑𝟎𝟎
 Factorial Notations
For any natural number: Natural numbers are numbers
equal or greater than 1.
𝑛! = 𝑛(𝑛 − 1)(𝑛 − 2)(𝑛 − 3) … (3)(2)(1)
For number ”0”:
0! = 1

Examples:
1! = 𝟏
2! = (2)(1) = 𝟐
3! = (3)(2)(1) = 𝟔
4! = (4)(3)(2)(1) = 𝟐𝟒
5! = (5)(4)(3)(2)(1) = 𝟏𝟐𝟎

4! 3! = (4)(3)(2)(1)(3)(2)(1) = 𝟏𝟒𝟒

5! (5)(4)(3)(2)(1)
= = 𝟐𝟎
3! (3)(2)(1)
 Permutation
An arrangement where order matters.

Permutation of n objects taken r at a time

The simplest out of the bunch.
𝒏!
𝒏 𝑃𝒓 =
(𝒏 − 𝒓)!
Can also be written as:
𝑃(𝑛, 𝑟)
𝑛
𝑃( )
𝑟
Example:
10!
10 𝑃2 =
(10 − 2)!
10!
10 𝑃2 =
8!
10 𝑃2 = 𝟗𝟎
or just type 10 𝑃2 in your calculator
 Permutations
An arrangement where order matters.

Distinguishable Permutations
Permutations that can be distinguished from one another.

𝑛! n = total data
𝑟1 ! × 𝑟2 ! × 𝑟3 ! × … × 𝑟𝑘 ! k = different kind of data
rk = objects of the k kind

Example:
How many ways can the word “none” be arranged?

N=2
4!
O=1 = 𝟏𝟐
2! × 1! × 1!
E=1

Example 2:

There are 2 orange juice, 3 lemonade, and 5 iced teas.

OJ = 2
10!
L=3 = 𝟐, 𝟓𝟐𝟎
𝟐! × 𝟑! × 𝟓!
IT = 5

Example 3:
How many 8-digit number can be created using “1, 2, 3, 4, 4, 5, 5, 5”?
1=1
2=1 8!
3=1 = 𝟑, 𝟑𝟔𝟎
1! × 1! × 1! × 2! × 3!
4=2
5=3
 Permutations
An arrangement where order matters.

Circular/Cyclic Permutations
If it’ll be arranged in a circular manner.
(𝑛 − 1)!
Examples:
If there are 6 children in the table.
(6 − 1)! = 𝟏𝟐𝟎

If the eldest has to sit on the right of the youngest.

([6 − 1] − 1)! = 𝟐𝟒 Treat the 2 children as one.

If the eldest and youngest has to sit with each other.

(5 − 1)! × 2! = 𝟒𝟖 After subtraction, multiply by “2” if
they can switch places.

If there are 5 keys in a key ring.

(5 − 1)! If the data can’t be moved or is in a
= 𝟏𝟐
2 fixed order, divide by “2”.
key ring
bracelet
etcetera…
 Combination
An arrangement where order doesn’t matter.
𝒏!
𝒏 𝐶𝒓 =
(𝒏 − 𝒓)! 𝒓!
Can also be written as:
𝐶(𝑛, 𝑟)
𝑛
𝐶( )
𝑟
Example 1:
5!
𝟓 𝐶𝟑 =
(5 − 3)! 3!
5!
𝟓 𝐶𝟑 =
2! 3!
5 𝐶3 = 𝟏𝟎
or just type 5 𝐶3 in your calculator
Example 2:
How many ways can we select 4 committee from 6 boys and 5 girls if it can
only contain 2 boys and 2 girls?
(6 𝐶2 ) × (5 𝐶2 )
(15)(10)
𝟏𝟓𝟎 possible outcome
 Combination
An arrangement where order doesn’t matter.

Example 3:
If there should be at least 2 boys but still 4 selected in total?

(6 𝐶2 ) × (5 𝐶2 ) (6 𝐶3 ) × (5 𝐶1 ) (6 𝐶4 ) × (5 𝐶0 )

(15)(10) (20)(5) (15)(1)

𝟏𝟓𝟎 𝟏𝟎𝟎 𝟏𝟓

150 + 100 + 15
𝟐𝟔𝟓
Example 4:
If there should be at most 3 boys but 5 selected in total?

(6 𝐶3 ) × (5 𝐶2 ) (6 𝐶2 ) × (5 𝐶3 ) (6 𝐶1 ) × (5 𝐶4 ) (6 𝐶0 ) × (5 𝐶5 )

(20)(10) (15)(10) (6)(5) (1)(1)

𝟏𝟎𝟎 𝟏𝟓𝟎 𝟑𝟎 𝟏

100 + 150 + 30 + 1
𝟐𝟖𝟏
 Probability
Refers to the likelihood or something to happen.
Often referred to as the measure of chance.

Term Definition Example

an activity with observable Tossing a coin
Experiment
results Rolling a die

the possible results of an head, tail

Outcome
experiment 1, 2, 3, 4, 5, 6

set of all possible different S = {head, tail} n(S) = 2

Sample Space
outcomes of an experiment S = {1, 2, 3, 4, 5, 6} n(S) = 6
E = {head} n(E) = 1
Event a collection of outcomes
E = {2, 4, 6} n(E) = 3
 Probability
Refers to the likelihood or something to happen.
Often referred to as the measure of chance.

Union of Events
𝐴 = {1, 2, 3, 4, 5, 6}
𝐵 = {3, 6, 7, 8}
𝑨 ∪ 𝑩 = {𝟏, 𝟐, 𝟑, 𝟒, 𝟓, 𝟔, 𝟕, 𝟖}

Intersection of Events
𝐴 = {1, 2, 3, 4, 5, 6}
𝐵 = {3, 6, 7, 8}
𝑨 ∩ 𝑩 = {𝟑, 𝟔}

Complement of a Set
Everything in the universal set except “A”
𝐴 = {𝑎, 𝑏, 𝑐, 𝑑, 𝑒} Universal Set is the union of every
set provided.
𝐵 = {𝑎, 𝑒, 𝑖, 𝑜, 𝑢}
𝐶 = {𝑏, 𝑐, 𝑑, 𝑓, 𝑔, ℎ, 𝑗, 𝑘}
𝑨′ = {𝒇, 𝒈, 𝒉, 𝒊, 𝒋, 𝒌, 𝒐, 𝒖}
 Probability
𝑛(𝐸)
𝑃(𝑛) =
𝑛(𝑆)
Example 1:
Two dice are rolled. Find the event that the sum of both number is “6”.

1+1 2+1 3+1 4+1 5+1 6+1

1+2 2+2 3+2 4+2 5+2 6+2
1+3 2+3 3+3 4+3 5+3 6+3
1+4 2+4 3+4 4+4 5+4 6+4
1+5 2+5 3+5 4+5 5+5 6+5
1+6 2+6 3+6 4+6 5+6 6+6

𝑆 = {"𝐸𝑣𝑒𝑟𝑦𝑡ℎ𝑖𝑛𝑔 𝑎𝑏𝑜𝑣𝑒, 𝐼′𝑚 𝑛𝑜𝑡 𝑤𝑟𝑖𝑡𝑖𝑛𝑔 𝑡ℎ𝑎𝑡"}

𝒏(𝑺) = 𝟑𝟔
𝐸 = {(1 + 5), (2 + 4), (3 + 3), (4 + 2), (5 + 1)}
𝒏(𝑬) = 𝟓

𝟓 Chance of landing two

𝟑𝟔 numbers that the sum is “6”.

Example 2:
Chance of drawing an ace or a jack.
𝟒 𝟒
+ There are 52 cards in a deck.
52 52
8 𝟐
=
52 𝟏𝟑
 Probability
Example 3:
𝟏 𝟏 𝟏
The winning chance of X, Y, and Z are , , and .
𝟑 𝟓 𝟖

What is the chance of Y and Z not winning?

Since the total winning chance 𝟏 𝟏 𝟏𝟑

+ =
of X, Y, and Z is not 1. 𝟓 𝟖 𝟒𝟎

Take the chances of Y and Z, 𝟏𝟑 𝟐𝟕

then subtract it to 1. 1− =
𝟒𝟎 𝟒𝟎
Example 4:
The bag has 3 red balls, 7 blue balls, and 5 green balls.
What is the chance of drawing 3 blue balls in a row?

There are 15 total balls.

𝟕 𝟔 𝟓 𝟏
× × = Every time you take a ball, the
15 14 13 𝟏𝟑 total ball count decreases.

How about drawing 2 green balls and 1 red ball?

( 𝟓 𝐶𝟐 ) × ( 𝟑 𝐶𝟏 )
There are 15 total balls. 𝟏𝟓 𝐶𝟑

And there are 3 balls drawn in 10 × 3

total. 45
𝟐
𝟑
 Probability
Example 5:

What about drawing at least 3 blue balls but draw 5 balls in total?

Red Balls + Green Balls = 8

(𝟕 𝐶3 ) × (𝟖 𝐶𝟐 ) (𝟕 𝐶4 ) × (𝟖 𝐶𝟏 ) (𝟕 𝐶5 ) × (𝟖 𝐶𝟎 )
𝟏𝟓 𝐶𝟓 𝟏𝟓 𝐶𝟓 𝟏𝟓 𝐶𝟓

35 × 28 35 × 8 21 × 1
3003 3003 3003

𝟏𝟒𝟎 𝟒𝟎 𝟑
𝟒𝟐𝟗 𝟒𝟐𝟗 𝟒𝟐𝟗
𝟏
This is actually , but let
𝟏𝟒𝟑
keep things simple, alright?

140 40 3
+ +
429 429 429
𝟔𝟏
𝟏𝟒𝟑