0% found this document useful (0 votes)
11 views

Permutations and Combinations Real Problems

The document discusses permutations and combinations, explaining that permutations are ordered combinations where order matters, while combinations are unordered combinations where order does not matter. Formulas are provided for permutations and combinations with and without repetition.

Uploaded by

Soha Walid
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views

Permutations and Combinations Real Problems

The document discusses permutations and combinations, explaining that permutations are ordered combinations where order matters, while combinations are unordered combinations where order does not matter. Formulas are provided for permutations and combinations with and without repetition.

Uploaded by

Soha Walid
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Mr.

Ahmed
Mr.Ahmed Shahin
0110138235401101382354
Shahin
Mr. Ahmed Shahin

Permutations and combinations


A Permutation is an ordered Combination.

permutation combination
• When the order does matter it is • When the order doesn't matter, it is
a Permutation. a Combination.

Example Example
"The combination to the safe is "My fruit salad is a combination of
472". Now we do care about the order. "724" won't apples, grapes and bananas" We don't
work, nor will "247". It has to be exactly 4-7-2. care what order the fruits are in, they could also be
"bananas, grapes and apples" or "grapes, apples

in
1. Permutations with Repetition and bananas", its the same fruit salad

n × n × ... (r times) = nr 1. Combinations with Repetition

ah
where n is the number of things to choose from,
and we choose r of them, such as coins in your pocket
repetition is allowed, (5,5,5,10,10)
and order matters.

Example: in the lock above, there are 10 numbers


to choose from (0,1,2,3,4,5,6,7,8,9) and we
choose 3 of them:
Sh
where n is the number of things to choose from,
and we choose r of them
10 × 10 × ... (3 times) = 103 = 1,000 repetition allowed,
ed
permutations
order doesn't matter.
hm

2. Permutations without Repetition 2. Combinations without Repetition

n Pr =n!/(n − r)! such as lottery numbers


(2,14,15,27,30,33)
where n is the number of things to choose from,
and we choose r of them,
r.A

no repetitions,
order matters.
Example: where n is the number of things to choose from,
and we choose r of them,
How many ways can first and second place be no repetition,
order doesn't matter.
M

awarded to 10 people?
For example, let us say balls 1, 2 and 3 are chosen.
These are the possibilities:
10! 10! 3,628,800
= = = 90
(10-2)! 8! 40,320
Order does Order doesn't
matter matter
(which is just the same as: 10 × 9 = 90) 123
132
213
123
231
312
321

So, the permutations have 6 times as many possibilites.

1
Mr. Ahmed
Mr.Ahmed Shahin
0110138235401101382354
Shahin
Mr. Ahmed Shahin

in
ah
2

Sh
ed
hm
r.A

3
M

2
Mr. Ahmed
Mr.Ahmed Shahin
0110138235401101382354
Shahin
Mr. Ahmed Shahin

in
ah
5

Sh
ed
hm
r.A

6
M

3
Mr. Ahmed
Mr.Ahmed Shahin
0110138235401101382354
Shahin
Mr. Ahmed Shahin

in
ah
Sh
8
ed
hm
r.A
M

4
Mr. Ahmed
Mr.Ahmed Shahin
0110138235401101382354
Shahin
Mr. Ahmed Shahin

in
ah
10
Sh
ed
hm
r.A

11
M

5
Mr. Ahmed
Mr.Ahmed Shahin
0110138235401101382354
Shahin
Mr. Ahmed Shahin

in
12

ah
Sh
ed

13
hm
r.A
M

6
Mr. Ahmed
Mr.Ahmed Shahin
0110138235401101382354
Shahin
Mr. Ahmed Shahin

14

in
ah
15

Sh
ed
hm
r.A

16
M

7
Mr. Ahmed
Mr.Ahmed Shahin
0110138235401101382354
Shahin
Mr. Ahmed Shahin

17

in
18

ah
Sh
ed
hm

19
r.A
M

8
Mr. Ahmed
Mr.Ahmed Shahin
0110138235401101382354
Shahin
Mr. Ahmed Shahin

20

in
ah
Sh
ed
hm
r.A
M

You might also like