Permutations

Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 8

Permutations

Definition
A permutation is an arrangement of things in definite
order or the ordered arrangement of distinguishable objects
without allowing repetitions among objects.

In general, if n is positive integer, then n factorial


denoted by n! is the product of all integers less than or
equal to n.

As a special case, we define


0! = 1
Example 1
Simplify each of the following expression.
1) 8! 2) 10! 3)
4) 4! + 5! 5) 6! 5!

Solution
1) 8! 2) 10! 3)
=8•7•6•5•4•3•2•1 = 10 • 9 • 8 • 7 • 6 • 5 • 4 • 3 • 2 • 1
= 40, 320 = 3,628,800
=
4) 4! + 5! 5) 6! 5! =
=4 •3•2•1+5•4•3•2•1 =6•5•4•3•2•1 •5•4•3•2•1 = 25, 200
= 24 + 120 = 86,400
= 144
Formula
The number of permutations of n things taken n at a time is
given by

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


given by
=
Example 2
Evaluate the following permutations.
1) 2) 3)
4) 5) •
Solution
1) 3) 4)
n=6 Numerator : n = 9, r = 3 n=7
r=2 Denominator : n = 8, r = 4 r=3
=6•5•4•3•2•1 = =7•6•5•4•3•2•1
=6 •5 =7•6 •5
= 30 = = 210
=
2) = 5) •
n=9 n=8 n = 10
r=5 r=6 r =8
=9•8•7•6•5•4•3•2•1 = (8 • 7 • 6 • 5 • 4 • 3) • (10 • 9 • 8 • 7 • 6 • 5 • 4 • 3 )
=9•8•7•6•5 = 20, 160 • 1,814,400
= 15, 120 = 36,578,304,000
Problem
There are seven finalists for the Math contest, and medals
will be given to the top three finalists. How many ways are
therefor the medal winners to be selected?
Solution
Number of finalists = 7
Number of selected finalists = 3

=7x6x5
= 210 ways

You might also like