You are on page 1of 1

Based from Basic Counting Techniques,

The number of permutations of n objects taken r at a time is

𝑃(𝑛, 𝑟) = 𝑛(𝑛 − 1)(𝑛 − 2) … (𝑛 − 𝑟 + 1)


(𝑛−𝑟)!
Multiplying the right side by (𝑛−𝑟)!

(𝑛−𝑟)!
𝑃(𝑛, 𝑟) = [𝑛(𝑛 − 1)(𝑛 − 2) … (𝑛 − 𝑟 + 1)] [(𝑛−𝑟)!]

𝑛(𝑛−1)(𝑛−2)…(𝑛−𝑟+1)(𝑛−𝑟)!
𝑃(𝑛, 𝑟) = (𝑛−𝑟)!

Notice that 𝑛(𝑛 − 1)(𝑛 − 2) … (𝑛 − 𝑟 + 1)(𝑛 − 𝑟)! = 𝑛!

since 𝑛 − 𝑟, 𝑛 − 𝑟 + 1, 𝑛 − 𝑟 + 2 … , 𝑛 − 2, 𝑛 − 1, 𝑛 are consecutive positive integers from n – r to n


𝑛!
We have 𝑃(𝑛, 𝑟) = (𝑛−𝑟)! (The number of permutations of n objects taken r at a time.)

𝑛!
When 𝑟 = 𝑛, 𝑃(𝑛, 𝑟) = 0! = 𝑛! where it is defined that 0! = 1

3! 2!
Justifying 0! = 1, 3= , 2=
2! 1!
1!
1 = 0!  1(0!) = 1! = 1 hence, 0! = 1
2!
2=  2(1!) = 2! = 2
1!
3!
3 = 2!  3(2!) = 3! = 6
4!
4 = 3!  4(3!) = 4! = 24
5!
5 = 4!  5(4!) = 5! = 120


𝑛!
𝑛 = (𝑛−1)!  n(n-1)!=n!

You might also like