ACFrOgBsMgvEmNXWjVxxfH Sg60R3PcpIWS8XgGzOc8zWj6QXsJYjJ rfS1VYqHlHP23AcQgXTR4n3xLx-slW8 UUCtlNINYTExV4gLLPP-jHOVWrKzAvdaPMT4MYczHPkLf-vRjPYKgpTIhkm7u

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 46

Combinations

Mathematics 10
OBJECTIVES
1. illustrate the combination of objects.
2. differentiate permutation from combination of n objects taken r.at a
time.
3. solve problems involving permutations and combinations.
01
Problems Involving
Combinations
Mathematics 10
Combination
It refers to the selection of objects
regardless of their order. That is,
changing the order of the objects
does not create a new combination.
Permutation or
Combination
Choosing a President, Vice President
and Secretary

Permutation
Permutation or
Combination

Forming an Education Committee

Combination
Permutation or
Combination

Creating an Email password

Permutation
Permutation or
Combination

Inviting a friend to attend the party

Combination
Permutation or
Combination

Naming a quadrilateral

Combination
Permutation or
Combination

Enumerating a subset in a set

Combination
Permutation or
Combination

Arranging the beads of a necklace

Permutation
Permutation or
Combination

Arranging for groufie picture taking

Permutation
Permutation or
Combination
Drawing a set of 6 numbers in a
lottery containing numbers 1-42.

Combination
Permutation or
Combination
Selecting 3 posters to hang out of 8
different posters

Combination
Combination Formula

𝒏!
𝑪 𝒏, 𝒓 =
𝒏 − 𝒓 ! 𝒓!
Evaluate the following.
1. C(4,3) Use this formula: 𝑪 𝒏, 𝒓 =
𝒏!
𝒏−𝒓 !𝒓!

n = 4, r = 3
4!
𝐶 4,3 =
4 − 3 ! 3!

4 ⋅ 3! 𝟒
𝐶 4,3 = = =𝟒
1! 3! 𝟏!
Evaluate the following.
2. C(29,29) Use this formula: 𝑪 𝒏, 𝒓 =
𝒏!
𝒏−𝒓 !𝒓!

n = 29, r = 29
29!
𝐶 29,29 =
29 − 29 ! 29!

29!
𝐶 29,29 = =𝟏
29!
Evaluate the following.
3. C(8,1) Use this formula: 𝑪 𝒏, 𝒓 =
𝒏!
𝒏−𝒓 !𝒓!

n = 8, r = 1
8!
𝐶 8,1 =
8 − 1 ! 1!

8! 8 ⋅ 7!
𝐶 8,1 = = =𝟖
7! 1! 7!
Evaluate the following.
4. C(10,4) Use this formula: 𝑪 𝒏, 𝒓 =
𝒏!
𝒏−𝒓 !𝒓!

n = 10, r = 4
10! 10!
𝐶 10,4 = =
10 − 4 ! 4! 6! 4!
10 ⋅ 9 ⋅ 8 ⋅ 7 ⋅ 6! 10 ⋅ 9 ⋅ 8 ⋅ 7 5040
= = = = 𝟐𝟏𝟎
6! 4! 24 24
Combination in Series

The number of combinations of n


objects taken one or more at a time is
𝒏
𝑪 = 𝟐 − 𝟏.
Sample Problems
1.) How many quadrilaterals can be drawn on a
plane using 7 noncollinear points?
Solution:
Quadrilateral has four sides. (r = 4)
Total noncollinear points is 7. (n = 7)
7! 7! 7 ⋅ 6 ⋅ 5 ⋅ 4!
𝐶 7,4 = = =
7 − 4 ! 4! 3! 4! 3! 4!
210
= = 𝟑𝟓 𝒒𝒖𝒂𝒅𝒓𝒊𝒍𝒂𝒕𝒆𝒓𝒂𝒍𝒔
6
Sample Problems
2.) A committee of 5 officials is to be chosen from 7 male and 8
female. If the committee is to contain at least 4 female, how many
ways can it be chosen?
Solution:
Committee of 5 officials.
There are 7 male and 8 female.
At least 4 female means 4 female or more.
8! 7! 8!
𝐶 8,4 ⋅ 𝐶 7,1 + 𝐶(8,5) = ⋅ +
Female Male Female 4! 4! 6! 1! 3! 5!
= 70 ⋅ 7 + 56 = 490 + 56 = 𝟓𝟒𝟔 𝒘𝒂𝒚𝒔
Sample Problems
3. An urn contains 4 green, 6 yellow and 9 orange marbles. How many
ways can 4 marbles be selected, if
a) all the marbles are orange?
b) all the marbles are green?

Solution:
a. all marbles are orange. (n = 9, r = 4)

𝐶 9,4 = 9! 9! 9 ⋅ 8 ⋅ 7 ⋅ 6 ⋅ 5!
= =
(9 − 4)! 4! 5! 4! 5! 4!
9 ⋅ 8 ⋅ 7 ⋅ 6 3024
= = = 𝟏𝟐𝟔 𝒘𝒂𝒚𝒔
24 24
Sample Problems
3. An urn contains 4 green, 6 yellow and 9 orange marbles. How many
ways can 4 marbles be selected, if
a) all the marbles are orange?
b) all the marbles are green?

Solution:
b. all marbles are green. (n = 4, r = 4)
4! 4! 4!
𝐶 4,4 = = =
(4 − 4)! 4! 0! 4! 4!

= 𝟏 𝒘𝒂𝒚
Sample Problems
3. An urn contains 4 green, 6 yellow and 9 orange marbles. How many
ways can 4 marbles be selected, if
c) two must be yellow?
d) two are green and two are yellow?

Solution:
c. two must be yellow. (the other colors will be two.)
Yellow Green

𝐶 6,2 ⋅ 𝐶Orange
4,2 = 15 ⋅ 6 = 90
+ 𝐶 6,2 ⋅ 𝐶 9,2 = 15 ⋅ 36 = 540
Orange Green
𝐶 6,2 ⋅ 𝐶 9,1 ⋅ 𝐶(4,1) = 15 ⋅ 9 ⋅ 4 = 540
90 + 540 + 540 = 𝟏, 𝟏𝟕𝟎 𝒘𝒂𝒚𝒔
Sample Problems
3. An urn contains 4 green, 6 yellow and 9 orange marbles. How many
ways can 4 marbles be selected, if
c) two must be yellow?
d) two are green and two are yellow?

Solution:
d. two are green and two are yellow
Green Yellow

𝐶 4,2 ⋅ 𝐶 6,2 = 6 ⋅ 15 = 𝟗𝟎 𝒘𝒂𝒚𝒔


Sample Problems
3. An urn contains 4 green, 6 yellow and 9 orange marbles. How many
ways can 4 marbles be selected, if
e) one is yellow and three are orange?
f) three are of one color and one are of another color?

Solution:
e. one is yellow and three are orange
Yellow Orange

𝐶 6,1 ⋅ 𝐶 9,3 = 6 ⋅ 84 = 𝟓𝟎𝟒 𝒘𝒂𝒚𝒔


Sample Problems
3. An urn contains 4 green, 6 yellow and 9 orange marbles. How many
ways can 4 marbles be selected, if
Solution:
f. three (r) are of one color and one (r) are of another color?
Yellow Orange
𝐶 6,3 ⋅ 𝐶 9,1 = 20 ⋅ 9 = 𝟏𝟖𝟎
Green 𝟏𝟖𝟎 + 𝟖𝟎 + 𝟓𝟎𝟒 + 𝟑𝟑𝟔 + 𝟐𝟒 + 𝟑𝟔
𝐶 6,3 ⋅ 𝐶 4,1 = 20 ⋅ 4 = 𝟖𝟎 = 𝟏𝟏𝟔𝟎 𝒘𝒂𝒚𝒔
Orange Yellow
+ 𝐶 9,3 ⋅ 𝐶 6,1 = 84 ⋅ 6 = 𝟓𝟎𝟒
Green
𝐶 9,3 ⋅ 𝐶 4,1 = 84 ⋅ 4 = 𝟑𝟑𝟔
Green Yellow
𝐶 4,3 ⋅ 𝐶 6,1 = 4 ⋅ 6 = 𝟐𝟒
Orange
𝐶 4,3 ⋅ 𝐶 9,1 = 4 ⋅ 9 = 𝟑𝟔
Sample Problem
4.) From a deck of 52 playing cards, 6 cards are to be drawn.
a) How many 6-card hands are possible?

b) How many 6-card hands are there consisting of 3 aces and 3 queens?

c) How many 6-card hands are there consisting of all red suits?

d) How many 6-card hands are there consisting of all heart suits?

e) How many 6-card hands are there consisting of 3 face-cards, 2 jacks,


and 1 club?
Sample Problem
4.) From a deck of 52 playing cards, 6 cards are to be drawn.
Solution:
a) How many 6-card hands are possible?
52!
𝐶 52,6 =
52 − 6 ! 6!
52 ⋅ 51 ⋅ 50 ⋅ 49 ⋅ 48 ⋅ 47 ⋅ 46!
=
46! 6!
14,658,134,400
= = 𝟐𝟎, 𝟑𝟓𝟖, 𝟓𝟐𝟎 𝒘𝒂𝒚𝒔
720
Sample Problem
4.) From a deck of 52 playing cards, 6 cards are to be drawn.
Solution:
b) How many 6-card hands are there consisting of 3 aces and 3 queens?
There are 4 aces (Ace of heart, diamond, spade and club/clover). There
are 4 queens (Heart, Diamond, Spade, and Club).

𝐶 4,3 ⋅ 𝐶 4,3 = 4 ⋅ 4 = 𝟏𝟔 𝒘𝒂𝒚𝒔


Sample Problem
4.) From a deck of 52 playing cards, 6 cards are to be drawn.
Solution:
c) How many 6-card hands are there consisting of all red suits?
There are 26 red suits which are heart (13) and diamond (13). (n = 26, r =6)
26!
𝐶 26,6 =
26 − 6 ! 6!
26 ⋅ 25 ⋅ 24 ⋅ 23 ⋅ 22 ⋅ 21 ⋅ 20! 165,765,600
= =
20! 6!= 𝟐𝟑𝟎, 𝟐𝟑𝟎 𝒘𝒂𝒚𝒔 720
Sample Problem
4.) From a deck of 52 playing cards, 6 cards are to be drawn.
Solution:
d) How many 6-card hands are there consisting of all heart suits?
There are 13 heart suits. (n = 13, r = 6)
13!
𝐶 13,6 =
13 − 6 ! 6!
13 ⋅ 12 ⋅ 11 ⋅ 10 ⋅ 9 ⋅ 8 ⋅ 7! 1,235,520
= =
7! 6! = 𝟏, 𝟕𝟏𝟔 𝒘𝒂𝒚𝒔 720
Sample Problem
4.) From a deck of 52 playing cards, 6 cards are to be drawn.
e) How many 6-card hands are there consisting of 3 face-cards, 2 jacks,
and 1 club?
Solution:
Face cards are jacks, queens, and kings. There are 12 face cards. There
are 4 jacks and 13 clubs also. Use Multiplication rule.

𝐶 12,3 ⋅ 𝐶(4,2) ⋅ 𝐶(13,1) = 220 ⋅ 6 ⋅ 13


= 𝟏𝟕, 𝟏𝟔𝟎 𝒘𝒂𝒚𝒔
Sample Problem
5.) How many different committees can be formed each consisting of 5
men and 5 women from a pool of 7 men and 8 women?
Solution:
Members of 5 men from 7 men.
Member of 5 women from 8 women
Men Women

𝐶 7,5 ⋅ 𝐶(8,5) = 21 ⋅ 56
= 𝟏, 𝟏𝟕𝟔 𝒘𝒂𝒚𝒔
Sample Problem
6.) The Science Club consists of 20 members. Five of them will represent
the school in a Science Quiz Bee against other schools. If the adviser of the
Science Club randomly selects these 5 students, how many different
selections of 5 students are possible?
Solution:
There are 20 members in the Science Club.
Five students will be selected to join for Science Quiz Bee. (n = 20, r = 5)
20 ⋅ 19 ⋅ 18 ⋅ 17 ⋅ 16 ⋅ 15!
𝐶 20,5 =
15! 5!
1,860,480
= = 𝟏𝟓, 𝟓𝟎𝟒 𝒘𝒂𝒚𝒔
120
Sample Problem
7.) Mr. Cruz needs to select a team of 7 for his volleyball team. There are a
total of 15 available players. Assuming that all of them can play any
position, how many different teams are possible?
Solution:
There are 15 available players.
A team of 7 for his volleyball team. (n = 15, r = 7)

15 ⋅ 14 ⋅ 13 ⋅ 12 ⋅ 11 ⋅ 10 ⋅ 9 ⋅ 8!
𝐶 15,7 =
8! 7!
32,432,400
= = 𝟔, 𝟒𝟑𝟓 𝒘𝒂𝒚𝒔
5,040
Sample Problem

8.) Alex has 5 friends. How many ways can he invite one or more of them
to dinner? Use the combination in series formula:𝐶 = 2𝑛 − 1
Solution:
Alex has 5 friends to invite for a dinner. (n = 5)

𝑛 5
= 2 − 1 = 2 − 1 = 32 − 1
= 𝟑𝟏 𝒘𝒂𝒚𝒔
Other Problems
(Involving Permutation
and Combination)
1.) In how many ways can you arrange 6 Mathematics books, 3
Science books, and 4 English books on a shelf such that books of
the same subject are kept together? (This is a permutation
problem)
Solution: Distinguishable Permutation
There are 6 Mathematics books, 3 Science books, 4 English
books. The total books is 13.
13! 13 ⋅ 12 ⋅ 11 ⋅ 10 ⋅ 9 ⋅ 8 ⋅ 7 ⋅ 6! 8,648,640
𝑃=
6! 3! 4!
= =
6! 3! 4! 144
= 𝟔𝟎, 𝟎𝟔𝟎 𝒘𝒂𝒚𝒔
Other Problems
(Involving Permutation
and Combination)
2.) In how many ways can 5 students be seated in a row of 5 seats if 3 of
the students insist on sitting beside each other?
Solution: Linear Permutation
There are 5 students who will sit in a row of 5 seats. 3 of them
will be taken as 1 group. The total will be 3 people.
2 students left + 1 group = 3

𝑃 3,3 = 3! = 𝟔

Arrangement of 3 persons linearly: 3! = 𝟔


By FCP, we can get the final answer: 𝟔 ⋅ 𝟔 = 𝟑𝟔 𝒘𝒂𝒚𝒔
Other Problems
(Involving Permutation
and Combination)
3.) In a party, the host makes sure that each guest shakes hands with
everyone else. If there are 12 guests, how many handshakes will be done?
Solution: Combination, since handshakes can be done by 2
persons is one arrangement.
There are 12 guests. (n = 12, r = 2)
12! 12! 12 ⋅ 11 ⋅ 10! 132
𝐶 12,2 = = = = = 𝟔𝟔 𝒘𝒂𝒚𝒔
12 − 2 ! 2! 10! 2! 10! 2! 2
Other Problems
(Involving Permutation
and Combination)
4.) A soloist is auditioning for a musical play. If she is required to sing any
two of the 5 prepared songs, then how many ways can she make her
choice?
Solution: Combination, since choosing does not require rank
or order. (n = 5, r = 2)

5! 5! 5 ⋅ 4 ⋅ 3! 20
𝐶 5,2 = = = = = 𝟏𝟎 𝒘𝒂𝒚𝒔
5 − 2 ! 2! 3! 2! 3! 2! 2
Other Problems
(Involving Permutation
and Combination)
5.) How many groups can be performed from 6 students taking at least 2 at
a time?
Solution: Combination, since choosing does not require rank
or order. (n = 6)
𝐶 = 2𝑛 − 1 = 26 − 1 = 32 − 1 = 𝟑𝟏 𝒘𝒂𝒚𝒔 (One or more at a time)

𝐶(6,1) = 𝟔 𝒘𝒂𝒚𝒔
𝑮𝒆𝒕 𝒕𝒉𝒆 𝒅𝒊𝒇𝒇𝒆𝒓𝒆𝒏𝒄𝒆: 𝟑𝟏 − 𝟔 = 𝟐𝟓 𝒘𝒂𝒚𝒔
“Not everything that can be counted
counts and not everything that
counts can be counted.”
-Albert Einstein
Thanks!
Do you have any questions?

addyouremail@freepik.com
+91 620 421 838 yourcompany.com

CREDITS: This presentation template was created by Slidesgo,


including icons by Flaticon, and infographics & images by Freepik.

Please keep this slide for attribution.

You might also like