Scribd
Upload
8 views25 pages

Math 119: By: Hodaya, Amelia, Naliss, Gabriela

Uploaded by

ddolman777
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
8 views25 pages

Math 119: By: Hodaya, Amelia, Naliss, Gabriela

Uploaded by

ddolman777
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/ 25

Counting,

Math 119
Permutations
and
Combination
Chapter 8.3
By: Hodaya, Amelia, Naliss, Gabriela
What will we learn in this topic?
Counting
01 Presented 02 Permutation
by Naliss Presented by Amelia

Distinguished
03 Permutations 04 Combinations
Presented by Gabriela Presented by Hodaya
What is Counting?
Counting is a simple way to figure out how many outcomes or items exist in a given
situation.

Example of ways we use basic counting:

-Counting how many slices of pizza there are left in


a pie.

-Counting the different possible outfits you can


wear.

-Counting money.

-Counting how many people are in a room.


The Fundamental Counting Principles
The fundamental counting principle is used for complex counting as it efficiently
calculates the total number of outcomes by using multiplication.

If one event occurs in m ways and another event occurs in n ways, their total
outcomes are calculated by multiplying m and n

Example -
You have 5 shirts (red, green yellow, pink and black) and 4 pairs of pants (jeans,
sweatpants, leggings and Khakis)

Using the fundamental counting principle, how many possible outfit combinations
can you make if you have 5 shirts and 4 pairs of pants?

( m ) x ( n ) =
5 × 4 = 20 possible combinations
What is Permutation?
Permutation is the arrangement of items in a certain way in which
order is important.
Some Keywords: Arrangement, Code, Reordering, Position,
Ordered, Line up, Placement, Password
There are two types of Permutation
Permutation without repetition
Arranging Items in a certain order where each Items can only be
used once.
Some Keywords: Selecting without replacing, without repeating

Permutation with repetition


Arranging items in a certain order where each Items can be used
more than once.
Some Keywords: Taken out and then replace, Repetition is allowed
Formula for Permutation without
repetition

In the formula the n represent the


total number of objects and the r
represent the number of objects
selected.
Let’s apply the formula
A lock has 4 dials with digits from 1-9. If a 4 digit code is created without
repeating any digits, how many codes are possible?

First we need to identify if it’s Permutations or Combinations and the word


“Code” tells us that it is Permutation because when creating a code the order
is important. Secondly they specifically stated “Without repeating” so we are
going to use the formula from the slide before.

The n in this question is 9 because it’s the total amount of numbers


presented, the r is 4 beauce out of the 9 numbers we only select 4 to be in the
code. So we put this info into the formula. P(9,4)= 9! = 9!
(9-4)! 5!
We then list out the numbers from the factories, divide and then simplify
9x8x7x6x5x4x3x2x1 = 6840 = 57 codes possible
5x4x3x2x1 120
Now you try
There are 5 different color balls in a bag, how many ways can 3 balls be
drawn (without putting them back) and arranged in a row?

Is this question Permutation? Which word signifies that?


Yes it is because it says “Arranged”

Is it repeating or not repeating? Which word signifies that?


It’s not repeating because it says “without putting them back”

What is the n? What is the r?


The n is 5 because that’s the total amount of balls, the r is 3 because that’s
the selected amount of balls selected to be arranged.

Now put them into the equation!

P(n,r)=n! = P(5,3)= 5! You then list all the numbers, multiply then divide.
(n-r)! (5-3)!
Formula for Permutation with
repetition

The n represents the total


number of objects and the r
P(n,r)=n^r represent the number of objects
selected. Note that 0! Is equal to 1.
Let’s apply the formula
How many ways can a 5 digit password be created using the numbers 1-6 if
repetition is allowed?

First we need to identify if it’s Permutations or Combinations and the word


“Password” tells us that it is Permutation because when creating a password
the order is important. Secondly they specifically stated “Repetition is allowed”
so we are going to use the formula from the slide before.

The n in this question is 6 because they are 6 numbers in total available, the r
is 5 because that's the selected amount wanted to make the password. So we
put this info into the formula.

P(6,5) = 6^5 = 6x6x6x6x6 = 7,776 way possible


Now you try
How many different lock code can be created using three letters from the
alphabet if repetition is allowed?

Is this question Permutation? Which word signifies that?


Yes it is because it says “code”

Is it repeating or not repeating? Which word signifies that?


It is repeating because it says “repetition is allowed”

What is the n? What is the r?


The n is 26 because that’s the total amount of letters in the alphabet, the r is 3
because that’s the selected amount of letters that’s going to be in the code.

Now put them into the equation!


P(n,r)= n^r = P(26,3)= 26^3 You list out 26 three times and then multiply.
Is this permutation with or without
repetition?
A bus has 10 seats and there are 7 students, how many ways can the seating
be arrange? (Note a kid can only be in one seat).

What indicates that it is repeating or not repeating?


The fact that is says “a kid can only be in one seat” tells us that it’s not repeating.

What’s the n? What’s the r?


The n is 10 because that’s the total amount of seats available, the r is 7
because that’s the selected amount of seats that’s going to be used.
What is distinguished
permutations?
Finding multiple ways of arranging things where some might look the
same because they’re duplicates but you only count the ones that look
different.

Key words:
● Arranged
● Unique
● Duplicates
● Combinations
Formula for distinguished
permutations:

N = total number of
n! letters

n1!n2!......nk! = each repeated


item
Let's try together
How many different ways can we rewrite the letters “RRGG”?

Steps:
1. Count total letters
2. Count repeating letters
3. Plug in formula; p= n/n1!n2!..nk!
4. Simplify answer if needed

N= 4 4! 24
R=2 G=2 Distinguished permutation= 2!x2! = 4 = 6
Now you try
Steps:
“APPLE”
1. Count total letters
2. Count repeating letters
3. Plug in formula; p= n/n1!n2!..nk!
4. Simplify answer if needed

n!

n1!n2!......nk!
What is Combinations ?
A selection of items from a set that have distinct
members.
Combinations are Items that the order and
repetition of a selection does NOT matter.
Some keywords:
+ Collection
+ Group
+ Select
+ Pick
+ Choose
Formula for Combination

In the formula the n represent the


total number of objects and the r
represent the number of objects
selected.
What to focus on
We don't care about the number of ways that we can
arrange the given items.

We care more about the unique set of groups that we can form
with the given items.
Now you try!
3 c2

A) B)
Now you try!
3 c2 The answer is A because the
same group can not contain
the same colors like
permutations.
It has to be not repeating .

A) B)
Let’s apply the formula
In a society of 10 members, we have to select a committee of 4
members. As the owner of the society, John is already a member
of the committee. In how many ways the committee can be
formed?
The word select tells us it is Combination - The n in this question is 9
because it’s the total
amount of members not
including John.
- The r is 3 because out of the
9 members we only select 3
to be apart of a committee
excluding John since he is
already a member.
Let’s apply the formula
n =9 r = 3 Now lets plug it into C(9,3)= 9! = 9
the formula: 3!(9-3)! 3!6!
We then list out the 9x8x7x6x5x4x3x2x1
numbers from the
factories: 3x2x1 6x5x4x3x2x1

Then divide and 9x8x7x6x5x4x3x2x1


then simplify:
3x2x1 6x5x4x3x2x1

9x8x7 = 504 = 84 ways


3x2x1 6
Math 119

Thank
You

You might also like