FUNDAMENTAL COUNTING PRINCIPLE

FUNDAMENTAL COUNTING PRINCIPLE: Multiplication Rule

In a sequence of events in which the first one has m1 possibilities, the second has m2 ,
the third has m3, and so on, and the total number of possible outcomes will be

m1 * m2 * m3 * ….* mn
where n is the number of events.
Example1: In a restaurant, a people can choose from 7 viands, plain, garlic or java rice, 2 kinds
of beverages and 3 kinds of desserts. In how many ways can this person choose what to have if
he is to order one from each group?

Solution: A person can choose 1 viand, 1 type of rice, 1 drink, and one dessert. The total
number of possible choices are:
7 x 3 x 2 x 3 = 126

Example2: Find the number of ways to fill up the position of the Mayor and the Vice Mayor if
there are 4 candidates for Mayor and 3 candidates for Vice Mayor.
4 x 3 = 12

Example 3: How many 3 – digit numbers can be formed using the numerals 3, 5, 6 and 8 if no
repetition of the numbers allowed? If repetition is allowed?

No repetition of numbers allowed.

Solution: Since each of the numbers 3, 5, 6, and 8 can fill up the hundreds place, then m1= 4.
And after having used one of those numerals, any remaining 3 numerals can fill up the tens
place, m2 = 3. Finally, the last 2 remaining numerals can now be used to fill up the units, with m3
=2.

Number of 3 digit numbers = m1 x m2 x m3

=4x3x2
= 24 numbers

If repetition is allowed.
Solution : Since repetition is allowed to fill up each hundred place, the m1= 4, m2= 4, and m3=
4..

Number of 3 digit numbers = m1 x m2 x m3

=4x4x4
= 64 numbers

FUNDAMENTAL COUNTING PRINCIPLE: Addition Rule

In a sequence of events in which the first one has m1 possibilities, the second has m2 ,
the third has m3, and so on, and if the events are mutually exclusive, then the total number of
possible outcomes will be

m1 + m2 + m3 + ….+ mn
where n is the number of events.
Example: In a class there are 27 boys and 14 girls. The teacher wants to select 1 boy and 1 girl
to represent a competition. In how many ways can the teacher make this selection ?

Solution:
Number of ways of selecting a boy  =  27 (m1)
Number of ways of selecting a girl  =  14 (m2)

From the given question, we come to know that we can select a boy or a girl. That is, it is
enough to do one of the works. 
So, we have to use the concept principle of addition.
Total number of ways to make this selection  =  27 + 14 =  41 ways
 So, the teacher can make this selection is 41 ways.

FACTORIAL (!)
The factorial of any integer n is denoted by n! and is defined as:
n! = n (n-1) (n-2) ….
0! Is defined = 1
The value of n! which may be read factorial n or the factorial of n, is obtained by
multiplying all the integers from 1 to n.

Examples:
1. 6 ! = 6 x 5 x 4 x 3 x 2 x 1 = 720
2. 5! 3! = (5 x 4 x 3x 2 x 1) (3 x 2 x 1) = 720
3. 6! + 3! + 2! = (6 x 5 x 4 x 3x 2 x 1) + (3 x 2 x 1) + (2 x 1) = 728

ACTIVITY!!!

Solve the following:

1. A wedding caterer gives you three choices for the main course, six starter choices and
five options for dessert. How many different meals (made up of starter, dinner and
dessert) are there?

2. From among the 36 teachers in a college, one principal, one vice-principal and the
teacher-in charge are to be appointed. In how many ways this can be done?

3. A person wants to buy one fountain pen, one ball pen and one pencil from a stationery
shop. If there are 10 fountain pen varieties, 12 ball pen varieties and 5 pencil varieties, in
how many ways can he select these articles?

4. Students are classified according to gender (male or female), regular or irregular

students, and field of specialization (mathematics, physics, business, or languages).
How many possible classifications are there?

5. There are eight routes from city A to city B and 12 routes from city B to city C. How many
routes are possible to city A to city C?

6. 6! + 10!

7. 8! – 5!

8. (10! – 6!) / 2!

9. (6! 4!) /3!

10. 4! 7!