0% found this document useful (0 votes)
8 views3 pages

Permutation

The document explains the concept of permutations, which are arrangements of objects where order matters. It outlines four types of permutations: without repetition, with repetition, of distinguishable objects, and circular permutations, providing formulas and examples for each type. Key formulas include nPr for permutations without repetition and P = n^r for permutations with repetition.
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)
8 views3 pages

Permutation

The document explains the concept of permutations, which are arrangements of objects where order matters. It outlines four types of permutations: without repetition, with repetition, of distinguishable objects, and circular permutations, providing formulas and examples for each type. Key formulas include nPr for permutations without repetition and P = n^r for permutations with repetition.
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/ 3

PERMUTATION

is the arrangement of objects in which order is important


KINDS OF PERMUTATION
1. PERMUTATION WITHOUT REPETITION
- is also called as the “Linear Permutation” (the arrangement of objects in a straight line)
- the permutation of n objects taken r at a time, without repetition, is given by:

nPr = n! , where 0 ≤ r ≤ n
(n - r)!

where:

n = total no. of objects

r = no. of selected objects

Take note that:

• If n = r, then P = n! = n!
(n - r)!

• If r = 0, then P = n! = n! = 1
(n - 0)! n!

• If r = 1, then P = n! = n (n - 1)! = n
(n - 1)! (n - 1)!

Proof of the three cases:

Examples:
2. PERMUTATION WITH REPETITION
- the permutation of n objects taken r at a time, with repetition, is given by:
𝑷 = 𝒏𝒓
𝐄𝐱𝐚𝐦𝐩𝐥𝐞𝐬:

3. PERMUTATION OF DISTINGUISHABLE OBJECTS


-is the arrangement of objects with identical objects
P= n! .
n₁! n₂! … n !
where:
n = total no. of objects
n₁ = objects of the first kind
n₂ = objects of the second kind
n = objects of the kth kind
Examples:
4. CIRCULAR PERMUTATION
-is the arrangement of objects in a circular manner

Examples:

You might also like