Counting Rules

✓ the fundamental counting rule

✓ the permutation rule
✓ the combination rule.

❖ The Fundamental Counting Rule

 Example 1: A coin is tossed and a die is rolled. Find the number of
outcomes for the sequence of events.
Solution:
Die
1 H, 1
2 H, 2 n 𝑐𝑜𝑖𝑛𝑠 = 2
Coin 3 H, 3 n 𝑑𝑖𝑒 = 6
H 4 H, 4
5 H, 5 Let
6 H, 6 𝑇 = 𝑡𝑜𝑡𝑎𝑙 # 𝑜𝑓 𝑝𝑜𝑠𝑠𝑖𝑏𝑖𝑙𝑖𝑡𝑖𝑒𝑠
1 T, 1 𝑇 = 𝑛(𝑐𝑜𝑖𝑛𝑠) ∙ 𝑛(𝑑𝑖𝑒)
2 T, 2
3 T, 3 =2∙6
T 4 T, 4
𝑻 = 𝟏𝟐
5 T, 5
6 T, 6
Example 2:

A paint manufacturer wishes to manufacture several different paints.

The categories include

How many different kinds of paint can be made if a person can select
one color, one type, one texture, and one use?
Solution:

n 𝑐𝑜𝑙𝑜𝑟 = 7 n 𝑡𝑒𝑥𝑡𝑢𝑟𝑒 = 3
n 𝑡𝑦𝑝𝑒 = 2 n 𝑢𝑠𝑒 = 2

𝑇 = 𝑛(𝑐𝑜𝑙𝑜𝑟) ∙ 𝑛(𝑡𝑦𝑝𝑒) ∙ 𝑛(𝑡𝑒𝑥𝑡𝑢𝑟𝑒) ∙ 𝑛(𝑢𝑠𝑒)

=7∙2∙3∙2
𝑻 = 𝟖𝟒
Example 3:
There are four blood types, A, B, AB, and O. Blood can also be Rh and Rh.
Finally, a blood donor can be classified as either male or female. How
many different ways can a donor have his or her blood labeled?

Solution:

Since there are 4 possibilities for blood type, 2 possibilities for Rh

factor, and 2 possibilities for the gender of the donor, there are 4 2 2, or
16, different classification categories, as shown.

𝑇 = 𝑛(𝑏𝑙𝑜𝑜𝑑 𝑡𝑦𝑝𝑒) ∙ 𝑛(𝑅ℎ 𝑡𝑦𝑝𝑒) ∙ 𝑛(𝑔𝑒𝑛𝑑𝑒𝑟)

=4∙2∙2
𝑻 = 𝟏𝟔
𝑇𝑟𝑒𝑒 𝐷𝑖𝑎𝑔𝑟𝑎𝑚:
When determining the number of different possibilities of a sequence of
events, one must know whether repetitions are permissible.

Example 4:
The digits 0, 1, 2, 3, and 4 are to be used in a four-digit
ID card. How many different cards are possible if
repetitions are permitted?
Solution: 5 ∙ 5 ∙ 5 ∙ 5 = 54 = 𝟔𝟐𝟓
Example 5:
The digits 0, 1, 2, 3, and 4 are to be used in a four-digit
ID card. How many different cards are possible if
repetitions are NOT permitted?
Solution: 5∙4∙3∙2 = 𝟏𝟐𝟎
Summary:

Counting Rules ✓ the fundamental counting rule

o the permutation rule
o the combination rule.
Factorial Notation, 𝒏!

Examples:

5! = 5 4 3 2 1 = 𝟏𝟐𝟎
9! = 9 ∙ 8 ∙ 7 ∙ 6 ∙ 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1 = 𝟑𝟔𝟐, 𝟖𝟖𝟎
Example 1:
A business owner has a choice of five locations in which to establish
her business. She decides to rank each location according to certain
criteria, such as price of the store and parking facilities. How many
different ways can she rank the five locations?

Solution: 5! = 5 4 3 2 1 = 𝟏𝟐𝟎

Example 2:
Suppose the business owner in Example 1 wishes to rank only the top
three of the five locations. How many different ways can she rank
them?
Solution:
Example 3:
There are four candidates for a job. The members of the search
committee will rank the four candidates from strongest to weakest.
How many different outcomes are possible?

Solution: Strongest candidate ⇒ 4 options

2nd -Strongest candidate ⇒ 3 options
3rd -Strongest candidate ⇒ 2 options
Weakest candidate ⇒ 1 option
4 3 2 1 = 𝟐𝟒
The number of ways to arrange 4 things is 4!
4! = 𝟐𝟒
Example 4:
Gomer has a 20 volume set of World Book Encyclopedia. If Gomer is
going to choose 9 of the 20 books, and arrange them on a shelf, how
many arrangements are possible?

Solution:
1. Choose first book: 20 options 6. Choose sixth book : 15 options
2. Choose second book: 19 options 7. Choose seventh book: 14 options
3. Choose third book: 18 options 8. Choose eighth book: 13 options
4. Choose fourth book: 17 options 9. Choose ninth book: 12 options
5. Choose fifth book: 16 options

20 19 18 17 16 15 14 13 12
= 𝟔𝟎, 𝟗𝟒𝟗, 𝟑𝟐𝟒, 𝟖𝟎𝟎 arrangements
Example 5:
In how many different ways can the letters of the word “OPTICAL” be
arranged so that the vowels always come together?
Solution: __ __ __ __ __ __ __

O, I, A
The number of ways to arrange all the letters ⇒ 5!
The number of ways to arrange the 3 vowels⇒ 3!

Thus, the number of ways to arrange the letters of the word

“OPTICAL” be arranged so that the vowels always come together is
5! 3! = (120)(6) = 𝟕𝟐𝟎 𝑤𝑎𝑦𝑠
Example 6:
How many 3-digit numbers can be formed from the digits 2, 3, 5, 6, 7
and 9 if none of the digits is repeated.
Solution:
(4) (5) (6)
______ ______ ______
Hundreds Tens Ones

6 5 4 = 𝟏𝟐𝟎

Thus, 120 3-digit numbers can be formed from the given digits.
Example 7:
How many 3-digit numbers can be formed from the digits 2, 3, 5, 6, 7
and 9 which are divisible by 5 and none of the digits is repeated.
Solution:
(4) (5) (1)
______ ______ ______
Hundreds Tens Ones

1 5 4 = 𝟐𝟎

Thus, 20 3-digit numbers that are divisible by 5can be formed from

the given digits.
❖ Permutations
Arranging people, digits, numbers, alphabets, letters, and colors are examples of
permutations.

A permutation is an arrangement of 𝑛 objects in a specific order

There are basically two types of permutation:

Repetition is Allowed: such as the lock above. It could be "333".

No Repetition: for example the first three people in a running race. You can't be
first and second.
Example:
6! 6! 6 ∙ 5 ∙ 4 ∙ 3 ∙ 2!
→6 𝑃4 = =
6−4 ! 2! = 2! = 𝟑𝟔𝟎
Example 1:
A business owner has a choice of five locations in which to establish her
business. She decides to rank each location according to certain criteria, such
as price of the store and parking facilities. How many different ways can she
rank the five locations?

5! 5! 5∙4∙3∙2∙1
Solution: →5 𝑃5 = = = = 𝟏𝟐𝟎
5 − 5 ! 0! 1
Example 2:
three locations were selected from five locations,

5! 5! 5 ∙ 4 ∙ 3 ∙ 2!
Solution: →5 𝑃3 = = = = 𝟔𝟎
5 − 3 ! 2! 2!
Example 3: Example 4:
A television news director wishes How many different ways can a chairperson
to use three news stories on an evening and an assistant chairperson be selected for
show. One story will be the lead story, a research project if there are seven scientists
one will be the second story, and the available?
last will be a closing story. If the director
has a total of eight stories to choose Solution:
from, how many possible ways can the 7! 7! 7 ∗ 6 ∗ 5!
program be set up? →7 𝑃2 = = =
7 − 2 ! 5! 5!

Solution: =𝟕 ∗𝟔
= 𝟒𝟐
8! 8! 8 ∗ 7 ∗ 6 ∗ 5!
→8 𝑃3 = = =
8 − 3 ! 5! 5!

= 𝟖 ∗ 𝟕 ∗ 𝟔 = 𝟑𝟑𝟔
Example 5:
A large office building has 8 exists. In how many ways a
man enter the building and leave by a different exit?

𝑛!
⟹𝑛 𝑃𝑟 = 𝑃 𝑛, 𝑟 = ;
𝑛−𝑟 !

𝑛 = 8, 𝑟 = 2(𝑒𝑛𝑡𝑟𝑎𝑛𝑐𝑒, 𝑒𝑥𝑖𝑡𝑠)

8!
⟹8 𝑃2 = 𝑃 8,2 = 8−2 !

8 ∗ 7 ∗ 6!
=
6!
=8∗7

⟹8 𝑃2 = 𝑃 8,2 = 56
The total number of ways a man may enter the building
Example:
and leave by a different exit is 56 ways A large office building has 8 exists. In how
many ways a man enter the building and leave by a different exit?
𝒏!
⟹𝒏 𝑷𝒓 = 𝑷 𝒏, 𝒓 = ;
𝒏−𝒓 !
Example 6:
In how many ways can 3 different prizes be awarded among
8 people if no person is to receive more than one prize? (3rd,
2nd, and 1st place)

Solution:
𝑛!
⟹𝑛 𝑃𝑟 = 𝑃 𝑛, 𝑟 = ; Let’s A win
𝑛−𝑟 !
the 3RD place
8!
⟹8 𝑃3 = 𝑃 8,3 = ;
8−3 !

𝑛 = 8, 𝑟 = 3(3 𝑑𝑖𝑓𝑓𝑒𝑟𝑒𝑛𝑡 𝑝𝑟𝑖𝑧𝑒𝑠) Let’s B win

the 2ND place
8! 8 ∗ 7 ∗ 6 ∗ 5!
= =
5! 5!
Let’s B win
= 8 ∗ 7 ∗ 6 = 𝟑𝟑𝟔
the 1ST place

There are 336 possibilities that 3 different prizes can be

awarded among 8 people. In how many ways can 3 different prizes be awarded among 8 people if no person
is to receive more than one prize?
𝒏!
⟹𝒏 𝑷𝒓 = 𝑷 𝒏, 𝒓 = ;
𝒏−𝒓 !
 Example 7:
Suppose you have three books A, B, and C, but you have room for only two
on your bookshelf. In how many ways can you select and arrange the two
books?

There are three choices for two books

But each of pairs can be arranged in two ways on the shelf. All
the permutation of the two books, chosen from three, is listed.

Combination of two Reordering of Combinations

AB BA
AC CA
BC CB

Using permutations, we have

3! 3! 3∗2∗1
⟹3 𝑃2 = 𝑃 3,2 = ; = 1! = = 3 ∗ 2 ∗ 1 = 𝟔 𝒘𝒂𝒚𝒔
3−2 ! 1
𝑛 = 3, 𝑟 = 2(3 𝑑𝑖𝑓𝑓𝑒𝑟𝑒𝑛𝑡 𝑏𝑜𝑜𝑘𝑠)
 E𝑥𝑎𝑚𝑝𝑙𝑒 8:

In how many different ways can the letters of the word 'DETAIL' be arranged such that the vowels must occupy
only the odd positions?

The word 'DETAIL' has 6 letters which has 3 vowels (EAI) and 3 consonants (DTL)
The 3 vowels (EAI) must occupy only the odd positions.
Let's mark the positions as (1) (2) (3) (4) (5) (6).

𝐷 𝐸 𝑇 𝐴 𝐼 L
1 2 3 4 5 6

Now, the 3 vowels should only occupy the 3 positions marked as (1),(3) and (5) in any order.

Hence, number of ways to arrange these vowels

3! 3! 3∗2∗1
⟹3 𝑃3 = 𝑃 3,3 = = = = 6 𝑤𝑎𝑦𝑠
3−3 ! 0! 1

𝑛 = 3 𝑣𝑜𝑤𝑒𝑙𝑠 ,
𝑟 = 3 𝑜𝑑𝑑 𝑝𝑜𝑠𝑖𝑡𝑖𝑜𝑛𝑠 (1,3,5 𝑝𝑜𝑠𝑖𝑡𝑖𝑜𝑛)
 Now we have 3 consonants (DTL) which can be arranged in the remaining 3 positions in any order. Hence,
number of ways to arrange these consonants

3! 3! 3∗2∗1
⟹3 𝑃3 = 𝑃 3,3 = = = = 6 𝑤𝑎𝑦𝑠
3−3 ! 0! 1

𝑛 = 3 𝑐𝑜𝑛𝑠𝑜𝑛𝑎𝑛𝑡𝑠 ,
𝑟 = 3 𝑜𝑡ℎ𝑒𝑟 𝑝𝑜𝑠𝑖𝑡𝑖𝑜𝑛𝑠

Total number of ways

= number of ways to arrange the vowels × number of ways to arrange the consonants
= 6 (6) = 36 ways
NUMBER OF DISTINGUISHABLE PERMUTATIONS
Given 𝑛 objects of which 𝑘 are alike, the number of distinguishable permutations of the n objects is
𝑛!
𝑘!
The number of distinguishable permutations of n elements taken at a time with n, elements alike
𝑛2 𝑜𝑓 𝑎𝑛𝑜𝑡ℎ𝑒𝑟 𝑘𝑖𝑛𝑑 𝑎𝑙𝑖𝑘𝑒 … 𝑛𝑘 of the kth alike is

𝑛!
𝑛1 ! 𝑛2 ! … 𝑛𝑘 !

Example 1:
In how many ways may 12 flags be arranged if 4 are red, 3
are blue and 5 are green?
Solution:

12! = 12 ∗ 11 ∗ 5 ∗ 7 ∗ 6 = 𝟐𝟕𝟕𝟐𝟎
𝑛!
= =
𝑛1 ! 𝑛2 !…𝑛𝑘 ! 4! 3! 5! Thus, 27, 720 flag arrangement
5 can be formed
12 ∗ 11 ∗ 10 ∗ 9 ∗ 8 ∗ 7 ∗ 6 ∗ 5!
=
4 ∗ 3 ∗ 2 ∗ 1 3 ∗ 2 ∗ 1 5! In how many ways may 12 flags be arranged if
4 are red, 3 are blue and 5 are green?
𝒏!
𝒏𝟏 ! 𝒏𝟐 ! … 𝒏𝒌 !
Example 2:

How many arrangements can be made out of the letters of the word ‘ENGINEERING’?
The word 'ENGINEERING' has 11 letters.

But in these 11 letters, 'E' occurs 3 times, 'N' occurs 3 times, 'G' occurs 2 times,
'I' occurs 2 times and rest of the letters are different.

Hence, number of ways to arrange these letters

𝑛!
𝑛1 ! 𝑛2 ! … 𝑛𝑘 !

11! 11 ∗ 10 ∗ 9 ∗ 8 ∗ 7 ∗ 6 ∗ 5 ∗ 4 ∗ 3!
= =
3! 3! 2! 2! 3! 3 ∗ 2 ∗ 1 2 ∗ 1 ( 2 ∗ 1)

= 11 ∗ 10 ∗ 9 ∗ 8 ∗ 7 ∗ 5

= 𝟐𝟕𝟕𝟐𝟎𝟎
CIRCULAR PERMUTATION

A special type of permutation where the objects are arranged in a circular pattern.

𝑃𝑐 = 𝑛 − 1 !

Example:
In how many ways can 7 children be seated around a
circular table?

Solution:

𝑃𝑐 = 𝑛 − 1 !
𝑃7 = 7 − 1 ! = 6!
= 6 ∗ 5 ∗ 4 ∗ 3 ∗ 2 ∗ 1 = 𝟕𝟐𝟎

The 7 children can be seated around the circular table in

720 ways.
In how many ways can 7 children
be seated around a circular table?
𝑷𝒄 = 𝒏 − 𝟏 !
 Example:
Linear permutation of 3 objects is 3! = 6
{1,2,3}, {1,3,2}, {2,1,3}, {2,3,1}, {3,1,2}, {3,2,1}
Circular permutation of 3 objects is (3 − 1)! =2
{1,2,3}, {1,3,2}
 Example:
Circular permutation of 4 objects is (4 − 1)! =6

{1,2,3,4}, {1,2,4, 3}, {1,3,2,4},{1,3,4,2},{1,4,2,3},{1,4,3,2}

Example:

Find the number of ways 6 people Ann, Ben, Carol, Dan, Eve and Faye
can be seated at a round table, such that Eve and Faye must always sit
together.

Solution: Ways for Eve and Faye to seat together

⇨ 2!
Arrangement of 5 people to in a circle
⇨ (5 − 1)!

Therefore, the number of ways is

(4!)(2!) = 𝟒𝟖
❖ Combinations

Selection of menu, food, clothes, subjects, the team are examples of

combinations.

There are also two types of combinations (remember the order does not matter now):

Repetition is Allowed: such as coins in your pocket

(5,5,5,10,10)

No Repetition: such as lottery numbers (2,14,15,27,30,33)

❖ Combinations
Example:
A dress designer wishes to select two colors
of material to design a new dress, and she
has on hand four colors. How many different
possibilities can there be in this situation?
Example: Given the letters A, B, C, and D, list the permutations and combinations
for selecting two letters.
Solution:
The permutations are The combinations are
AB BA CA DA AB BA CA DA
AC BC CB DB AC BC CB DB
AD BD CD DC AD BD CD DC
There are 12 permutations.
There are 6 combinations.
 Combination Rule: Permutation Rule:
𝒏! 𝒏!
𝒏𝑪𝒓 = 𝒏𝑷𝒓 =
𝒏 − 𝒓 ! 𝒓! 𝒏−𝒓 !
𝒏!
𝒏𝑪𝒓 = Example: How many combinations of 4 objects are there,
𝒏 − 𝒓 ! 𝒓!
𝒏𝑷𝒓 taken 2 at a time?
𝒏𝑪𝒓 = Solution: 4! 4!
𝒓! 4 C2 = =
divides out the duplicates from the
4 − 2 ! 2! 2! 2!
number of permutations 4 ∙ 3 ∙ 2!
=
2 ∙ 1 ∙ 2!
=𝟔
Example 1:
Six points lie on the circumference of a circle. How many
inscribed triangles can be drawn having these points as
vertices?

Solution:

𝑛!
⟹𝑛 𝐶𝑟 = 𝐶 𝑛, 𝑟 =
𝑛 − 𝑟 ! 𝑟!

Where: n = 6 different points 6∗5∗4∗3!

r = 3 (vertices of a triangle)
=
3∗2∗1∗3!
= 5 ∗ 4 = 20
6!
⟹6 𝐶3 = 𝐶 6,3 = Thus, there are 20 inscribed triangles that can be drawn
6 − 3 ! 3!
having those six points are vertices.
6!
=
3! 3!
Example 1:
Six points lie on the circumference of a circle. How many
inscribed triangles can be drawn having these points as vertices?
𝒏!
⟹𝒏 𝑪𝒓 = 𝑪 𝒏, 𝒓 =
𝒏 − 𝒓 ! 𝒓!
Example 2 :
Sharon’s class must select 2 students out of 5 candidates
as class representatives. How many different pairs can be
selected from the five candidates.

Solution:
𝑛!
⟹𝑛 𝐶𝑟 = 𝐶 𝑛, 𝑟 =
𝑛 − 𝑟 ! 𝑟!
Where: n = 5 candidates
r = 2 (choose 2 representatives)

5!
⟹5 𝐶2 = 𝐶 5,2 =
5 − 2 ! 2!

5!
= = 5 ∗ 2 = 10
3! 2!
2
5 ∗ 4 ∗ 3! There are 10 different pairs in choosing
= 2 representatives out of 5 candidates
3! ∗ 2 ∗ 1
Aaron’s class must select 2 students out of 5 candidates
as class representatives. How many different pairs can be
selected from the five candidates.
𝒏!
⟹𝒏 𝑪𝒓 = 𝑪 𝒏, 𝒓 =
𝒏 − 𝒓 ! 𝒓!
Example 3:

A bicycle shop owner has 12 mountain bicycles in the showroom. The

owner wishes to select 5 of them to display at a bicycle show. How
many different ways can a group of 5 be selected?

Solution:
12!
12 C5 =
12 − 5 ! 5!
12!
=
7! 5!
12 ∙ 11 ∙ 10 ∙ 9 ∙ 8 ∙ 7!
=
7! 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1
= 11 ∗ 9 ∗ 8
= 𝟕𝟗𝟐 ⟹𝒏 𝑪𝒓 = 𝑪 𝒏, 𝒓 =
𝒏!
𝒏 − 𝒓 ! 𝒓!
Example 4:
In a club there are 7 women and 5 men. A committee of 3 women and
2 men is to be chosen. How many different possibilities are there?

Solution:
7𝐶3 = 𝑐𝑜𝑚𝑏𝑖𝑛𝑎𝑡𝑖𝑜𝑛 𝑜𝑓 7 𝑤𝑜𝑚𝑒𝑛,
𝑡𝑎𝑘𝑒𝑛 3 𝑎𝑡 𝑎 𝑡𝑖𝑚𝑒 7𝐶3 ∙ 5𝐶2
7!
7𝐶3 = 7! 5!
7 − 3 ! 3! = ∙
7 − 3 ! 3! 5 − 2 ! 2!
5𝐶2 = 𝑐𝑜𝑚𝑏𝑖𝑛𝑎𝑡𝑖𝑜𝑛 𝑜𝑓 5 𝑚𝑒𝑛,
= 𝟑𝟓𝟎
𝑡𝑎𝑘𝑒𝑛 2 𝑎𝑡 𝑎 𝑡𝑖𝑚𝑒
5!
5𝐶2 =
5 − 2 ! 2!
Example 5:
Out of 7 consonants and 4 vowels, how many 5-letter words of 3
consonants and 2 vowels can be formed?
Solution:
# of ways of selecting 3 consonants from 7 = 7𝐶3
# of ways of selecting 2 vowels from 4 = 4𝐶2

# of ways of selecting 3 consonants from 7 and 2 vowels from 4,

7! 4! 7! 4!
7𝐶3 4𝐶2 = =
7 − 3 ! 3! 4 − 2 ! 2! 4! 3! 2! 2!
= 𝟐𝟏𝟎
Therefore, 210 words can be formed with 5 letters (3 consonants and
2 vowels)
Example 6:
In a club there are 7 women and 5 men.
A committee of 3 women and 2 men is
to be chosen. How many different
possibilities are there?
Solution:
→7 𝐶3 = 𝑐𝑜𝑚𝑏𝑖𝑛𝑎𝑡𝑖𝑜𝑛 𝑜𝑓 7 𝑤𝑜𝑚𝑒𝑛,
𝑡𝑎𝑘𝑒𝑛 3 𝑎𝑡 𝑎 𝑡𝑖𝑚𝑒 7 C3 * 5 C2
7!
→7 𝐶3 = 7! 5!
7 − 3 ! 3! = ∙
7 − 3 ! 3! 5 − 2 ! 2!
→5 𝐶2 = 𝑐𝑜𝑚𝑏𝑖𝑛𝑎𝑡𝑖𝑜𝑛 𝑜𝑓 5 𝑚𝑒𝑛, = 𝟑𝟓𝟎
𝑡𝑎𝑘𝑒𝑛 2 𝑎𝑡 𝑎 𝑡𝑖𝑚𝑒
5!
→5 𝐶2=
5 − 2 ! 2!
𝒏!
⟹𝒏 𝑪𝒓 = 𝑪 𝒏, 𝒓 =
𝒏 − 𝒓 ! 𝒓!
Example 7:
In a group of 6 boys and 4 girls, four children are to be selected. In how
many different ways can they be selected such that at least one boy
should be there?
Solution:
If 4 boys are selected, then the # of ways to this = 6𝐶4
If 3 boys and 1 girl are selected, then the # of ways to this = 6𝐶3 4𝐶1
If 2 boys and 2 girls are selected, then the # of ways to this = 6𝐶2 4𝐶2
If 1 boy and 3 girls are selected, then the # of ways to this = 6𝐶1 4𝐶3

Thus, the total number of ways

6𝐶4 + 6𝐶3 4𝐶1 + 6𝐶2 4𝐶2 + 6𝐶1 4𝐶3
 6𝐶4 + 6𝐶3 4𝐶1 + 6𝐶2 4𝐶2 + 6𝐶1 4𝐶3

6! 6! 4! 6! 4!
= + ∙ + ∙ +
6 − 4 ! 4! 6 − 3 ! 3! 4 − 1 ! 1! 6 − 2 ! 2! 4 − 2 ! 2!
6! 4!
∙
6 − 1 ! 1! 4 − 3 ! 3!

= 15 + 20 ∙ 4 + 15 ∙ 6 + 6 ∙ 4 = 𝟐𝟎𝟗

Thus, there are a total of 209 ways to select 4 children from 6 boys
and 4 girls where at least one boy is there.
Example 6 (alternative solution):
In a group of 6 boys and 4 girls, four children are to be selected. In how
many different ways can they be selected such that at least one boy
should be there?

Solution:
6 boys and 4 girls = 10 participants
out of the 10 participants, 4 of children are needed without an all
girls situation

10! 4!
10𝐶4 − 4𝐶4 = − = 𝟐𝟎𝟗
10 − 4 ! 4! 4 − 4 ! 4!
Summary of Counting Rules
Probability and Counting Rules

Example:
Find the probability of getting 4 aces when 5 cards are drawn from
an ordinary deck of cards.
Solution:
ways to draw 5 cards from a deck ⟹ 52𝐶5
ways to get 4 aces ⟹ 4𝐶4
possibilities to get the 5th card ⟹ 48
4 C4 ∙ 48 1 ∙ 48 𝟏
𝑃 4 𝑎𝑐𝑒𝑠 = = =
52 C5 2,598,960 𝟓𝟒, 𝟏𝟒𝟓

𝒏!
⟹𝒏 𝑪𝒓 = 𝑪 𝒏, 𝒓 =
𝒏 − 𝒓 ! 𝒓!
Example:

A box contains 24 transistors, 4 of which are defective. If 4 are sold at

random, find the following probabilities.
a. exactly 2 are defective c. all are defective
b. none is defective d. at least 1 is defective

Solution:
ways to sell 4 transistors ⟹ 24C4
a. Two defective transistors can be selected
as 4C2 and 2 non-defective ones as 20C2

4 C2 ∗ 20 C2 1140 𝟏
𝑃 𝑒𝑥𝑎𝑐𝑡𝑙𝑦 2 𝑑𝑒𝑓𝑒𝑐𝑡𝑖𝑣𝑒𝑠 = = =
24 C4 10,6260 𝟓𝟒, 𝟏𝟒𝟓

𝒏!
⟹𝒏 𝑪𝒓 = 𝑪 𝒏, 𝒓 =
𝒏 − 𝒓 ! 𝒓!
b. The number of ways to choose no defectives is 20 C4

20 C4 4845 𝟏, 𝟔𝟏𝟓
𝑃 𝑛𝑜 𝑑𝑒𝑓𝑒𝑐𝑡𝑖𝑣𝑒𝑠 = = =
24 C4 10,6260 𝟑, 𝟓𝟒𝟐

c. The number of ways to choose 4 defectives from 4 is 4 C4 , or 1.

4 C4 𝟏
𝑃 𝑛𝑜 𝑑𝑒𝑓𝑒𝑐𝑡𝑖𝑣𝑒𝑠 = =
24 C4 𝟏𝟎, 𝟔𝟐𝟔𝟎

𝒏!
⟹𝒏 𝑪𝒓 = 𝑪 𝒏, 𝒓 =
𝒏 − 𝒓 ! 𝒓!
d. To find the probability of at least 1 defective transistor, find the
probability that there are no defective transistors, and then
subtract that probability from 1.( we can apply complement)

𝑃 𝑎𝑡 𝑙𝑒𝑎𝑠𝑡 1 𝑑𝑒𝑓𝑒𝑐𝑡𝑖𝑣𝑒 = 1 − 𝑃(𝑛𝑜 𝑑𝑒𝑓𝑒𝑐𝑡𝑖𝑣𝑒𝑠)

20 C4
=1−
24 C4

1615
=1−
3542
𝟏𝟗𝟐𝟕
=
𝟑𝟓𝟒𝟐
Example:
There are 8 married couples in a tennis club. If 1 man and 1 woman
are selected at random to plan the summer tournament, find the
probability that they are married to each other.

Solution:
ways to select a man ⟹ 8
ways to select a woman ⟹ 8
ways to select a man and a woman ⟹ 8 ∙ 8 = 64
Since there are 8 married couples,
8 𝟏
𝑃 𝑡ℎ𝑒 𝑝𝑎𝑖𝑟 𝑖𝑠 𝑚𝑎𝑟𝑟𝑖𝑒𝑑 𝑡𝑜 𝑒𝑎𝑐ℎ 𝑜𝑡ℎ𝑒𝑟 = =
64 𝟖
𝐷𝑜 𝑦𝑜𝑢𝑟 ℎ𝑜𝑚𝑒𝑤𝑜𝑟𝑘.
A genius is a talented person
who does his homework .

Thomas A. Edison