Scribd
Upload
40 views12 pages

Permutation and Combination 2d

This document discusses permutations and combinations. It defines a permutation as an arrangement of objects in a specific order, and provides the formula for calculating permutations of n objects taken r at a time as nPr. It also defines a combination as a selection of objects without regard to order, and gives the formula for combinations of n objects taken r at a time as nCr. Finally, it provides examples of calculating permutations and combinations to select people or objects from groups in various scenarios.

Uploaded by

joerylaurelio682
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
40 views12 pages

Permutation and Combination 2d

This document discusses permutations and combinations. It defines a permutation as an arrangement of objects in a specific order, and provides the formula for calculating permutations of n objects taken r at a time as nPr. It also defines a combination as a selection of objects without regard to order, and gives the formula for combinations of n objects taken r at a time as nCr. Finally, it provides examples of calculating permutations and combinations to select people or objects from groups in various scenarios.

Uploaded by

joerylaurelio682
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

PERMUTATION AND

COMBINATION
PERMUTATION

 Permutation is an arrangement of n in a specific


order.
Permutation is the number of ways a set can be
arranged or the number of ways things can be
arranged.
Permutation of n objects
The number of permutation of in distinct objects using all of
the objects is n!.
Example:

1. There are seven horses in a race and a large jackpot for anyone who can pick the finishing order of all
seven exactly right. How difficult is that? Find the number of possible orders they can finish in.
Solution:
7! = 7•6•5•4•3•2•1 = 5,040

There 5,040 possible orders.


2. In how many different ways can a pledge class with 20 members choose a president, vice
president and Math Council representative?
Solution:
There are 20 choices for president, 19 remaining candidates for vice president, and 18
members left to choose from for Math Council representative. So there are

20•19•18 = 6,840 different ways to assign these three officers.

3. How many ways can a manager and assistant manager be selected from a department
consisting of 10 employees.
Solution:
There are 10 choices for manager and 9 remaining choices for assistant manager. So there are

10•9 = 90 different ways to assign the position.


Permutation of n
Objects Taken r at a
Time
The arrangement of n objects
in a specific order using r of
those objects without
replacement is called a
permutation of n objects
taken r at a time. It is written
as: nPr, and is calculated
using the formula.
Examples:
1. In a lottery game, 40 numbered Ping-Pong balls are put in a bin, and 4 are chosen at
random, 1 at a time. To win the game, players need to match all 4 in the order in which they
were drawn. How many different winning orders are there?

Solution:
This is a permutation problem because 4 balls are picked from 40 with no repetition, and the
order is important. So we use the permutation formulas with n=40 and r=4.

40P4 = =
2. How many six-letter password are there that use only lowercase letter with no letter
repeated?
Solution:
26P6 ==
Permutation Rule
When Objects are
Alike

 Repetitions are taken care of


by dividing the permutation by
the factorial of the number of
objects that are identical.
Examples:
1. How many different passwords can be made using all of the letters in the word
MISSISSIPPI?
Solution:
The letters can be arrange as M IIII SSSS PP. Then n = 11,k1 = 1,k2 = 4k3 = 4 and k4 = 2
Using the formula, there are
= 34, 650 different passwords
2. Find the number of different passwords using all of the letters in the word
MASSACHUSETTS.
Solution:
The letters can be arrange as M AA SSSS C H U E TT. Then n = 13,k1 = 1,k2 = 2,k3 = 4,
k4 = 1,k5 = 1,k6 = 1k7 = 1, and k8 = 2
Using the formula, there are
= 64, 864, 800 different passwords
COMBINATION
Combination is a
selection of
objects without
regard to order.
The Combination of Rule
The number of combination of n
objects taken r at time without
replacement is denoted by nCr, and is
given by the formula.
Examples:
1.While studying abroad one semester, Tran is required to visit 10 different cities. He plans to
visit 3 of the 10 over a long weekend. How many different ways can he choose the 3 to visit?
Assume that the distance is not a factor.

nCr = =120 ways to choose

2.An instructor posts a list of eight group projects to her website. Every group is required to do
four projects at some point during the semester. How many different ways can a group choose the
four projects they want to do?

nCr = =70
3. To raise money for a charity event, a sorority plans to sell a calendar featuring tasteful
pictures of some of the more attractive professors on campus. They will need to choose six
models from a pool of finalist that includes nine women and six men. How many possible
choices are there if they want to feature at least four women.
Solution:
Since we need to include at least four women, there are three possible compositons: four
women and two men, five women and 1 man, or six women and no men.
Four women and two men:
9 C4 • 6C2 = =126 x 15 = 1,890
Five women and one man:
9 C5 • 6C1 = =126 x 6 =756
Six women and no men:
9C6 • 6C0 = =84 x 1 =84

The total number of possibilities is 1,890+756+84=2,730


4. In how many ways can a selection of 3 men and 2 women can
be made from a group of 5 men and 5 women?

5 C3 x 5C2 = = =10x 10 =100 ways

You might also like