Scribd
Upload
77 views

Permutation Notes

1) Permutation is an arrangement of objects in a definite order that determines possible arrangements in a set when order matters. 2) There are different types of permutations including without repetition, with repetition, distinguishable, and circular. 3) Permutation without repetition uses the factorial formula nPr = n!/(n-r)! to calculate arrangements of n objects taken r at a time without replacement.

Uploaded by

Jhen Saviv (jhen)
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
77 views

Permutation Notes

1) Permutation is an arrangement of objects in a definite order that determines possible arrangements in a set when order matters. 2) There are different types of permutations including without repetition, with repetition, distinguishable, and circular. 3) Permutation without repetition uses the factorial formula nPr = n!/(n-r)! to calculate arrangements of n objects taken r at a time without replacement.

Uploaded by

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

PERMUTATION

Permutation – a term used to indicate ordered arrangements.


An arrangement of objects in a definite order. It is a mathematical technique
that determines the possible arrangements in a set when the order of
arrangements matters.

CAT ACT TAC


CTA ATC TCA

Fundamental Counting Principle (FCP) – the manner of solving by multiplying the


number of elements of two or more events to find the total number of outcomes for
those events to occur.

a. Tree diagram
b. Listing method

Factorial Notation (!) – the process of multiplying consecutive decreasing whole


numbers from an identified number down to one.
n! = n (n-1) (n-2) (n-3) (n-4)… (3)(2)(1)

TYPES of PERMUTATION

1. Permutation without repetition (Linear Permutation)


2. Permutation with Repetition or Replacement
3. Distinguishable Permutation
4. Circular Permutation

PERMUTATION WITHOUT REPETITION

a. Permutation of n objects taken r at a time

P(n,r) = n! / (n-r)! , n greater than or equal to r

Or

nPr = n!
(n - r )! ;r<n

Where:
P is the total number of permutations
n is the total number of objects in the set
r is the total number of choosing objects in the set

b. Permutation of n objects taken all at a time


P (n,n) = n!

Ex.. flower in a pot


PERMUTATION WITH REPETITION OR REPLACEMENT (REPETITION is allowed)
The number of ordering of n objects taken r at a time, with repetition, is given by

P = n raise to r

Where:
P is the total number of permutations
n is the total number of objects in the set
r is the total number of choosing objects in the set

Example:
How many 5-letter ordered codes can be formed with the letters of the set { E,F,G,H} if
we allow to use repeated use of the same letter?

Formula:
P = nr

Given:
P=?
n=4
r=5

Solution:
P = n exponent r
P = (4) exponent 5
= 4.4.4.4.4
P = 1024

IV. Distinguishable Permutation

Distinguishable Permutations - permutations that can be distinguished from


one another.

Example:

If there are two cans of orange juice, three cans of lemonade, and five cans of
iced tea in a cooler. In how many ways can these drinks be consumed by a
costumer?
I. Circular Permutation – refers to the number of permutation of n distinct objects
arranged in a circle.

Formula:
(n-1)!

Example 1
How many ways can 4 people sit around a circular table?
n=4

formula: (n-1)! = (4-1)! =3! =3.2.1=6

example 2
How many ways can 4 boys and 2 girls be seated at a round table ?
n= 6
(n-1)! = (6-1)!
= 5!
= 5.4.3.2.1
= 120

Example 3
How many ways can 3 girls and 5 boys be seated around a circular table if ALL Girls
must sit together?

3 girls = 1 group
1 group seat and 5 seats
N=6
(n-1)! = (6 – 1)!
3 girls = 3!

= ( 6 – 1)! * 3!
= 5! * 3!
= 5*4*3*2*1*1*3*2*1
=720

CIRCULAR Permutations
Circular arrangements are permutations in which objects are arranged in a circle.

There are two cases of circular-permutations:


a. If the clockwise and the counterclockwise arrangements of n are distinct around
a circle, then the number of arrangements is represented by P = (n-1)!

Example 1
In how many ways can eight people join hands to form a circle.

Given
N=8

P = ( n-1)!
= ( 8 – 1)!
= 7!
=7*6*5*4*3*2*1
= 5040

b. If the clockwise and counterclockwise arrangements of n are not distinct around


a circle, then the number of arrangements s represented by P = (n-1)! / 2

In how many ways can 10 differently colored beads be arranged on a bracelet.


Given
N = 10
P = (n-1)! / 2
= (10-1) / 2
= 9! / 2
=9*8*7*6*5*4*3*2*1/2
= 181, 440

You might also like