Scribd
Upload
22 views

Permutation Module

Permutation refers to arranging objects in a definite order. Changing the order creates a new permutation. The number of permutations of n objects taken r at a time is calculated as n!/(n-r)!, which is the number of ways to fill r places from n options. Factorial notation provides an abbreviated way to write a multiplying descending numbers, such as 5! = 5 * 4 * 3 * 2 * 1. The number of permutations is used to calculate the number of arrangements of objects in different scenarios.

Uploaded by

Divine Nuez
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
22 views

Permutation Module

Permutation refers to arranging objects in a definite order. Changing the order creates a new permutation. The number of permutations of n objects taken r at a time is calculated as n!/(n-r)!, which is the number of ways to fill r places from n options. Factorial notation provides an abbreviated way to write a multiplying descending numbers, such as 5! = 5 * 4 * 3 * 2 * 1. The number of permutations is used to calculate the number of arrangements of objects in different scenarios.

Uploaded by

Divine Nuez
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

PERMUTATION

o Refers to an arrangement of objects in a definitive order.


o Changing the order of the objects being arranged creates a new permutation.
o Finding the number of permutation of n different objects taken r at a time is the same as
finding the number of ways that can fill r places when there are n different things to choose
from.

Example 1: How many different ways can 7 students be seated for a selfie if only 4 seats are available?
Solution:

Example 2: How many permutations can be made for 5 different books on a shelf that can
accommodate exactly these 5 books?
Solution:

FACTORIAL NOTATION
o The product 5*4*3*2*1 can be written in abbreviated from 5!

n factorial
For every positive integer n,
n! = (n)(n-1)(n-2)…(3)(2)(1)

Example: Find the following;


1. 9! - 6! =
7!
2. =
7!3!
7!
3. =
7!3!
4. 3! + 2! =
5. 7! - 0! =

Permutation
𝒏!
The number of permutation of n objects taken r at a time is, P (n,r) =
(𝒏−𝒓)!

You might also like