UNIT

04 Fundamental Principles of Counting

Names of Sub-Units

Introduction, the Rules of Sum and Product, Permutations, Combinations, the Binomial Theorem,
Combinations with Repetition

Overview
In this unit, you will learn about the fundamental principle of counting, i.e., sum and product rule.
Further in this chapter, you will also learn how to calculate the number of ways the objects can be
arranged and selected, i.e., about the concept of permutation and combination. After going through
this chapter, you will also acquire the knowledge of expanding binomial expression by using the
binomial theorem. Lastly, after reading this chapter you will become proficient in solving problems
based on permutation, combination and binomial theorem.

Learning Objectives

In this unit, you will learn to:

 Explain the concept of permutation and combination
 Determine where to apply the permutation and where to apply a combination
 Solve problems based on the principal of counting
 Become master in solving the problems based on permutation and combination
 Describe how to solve the problem based on the binomial theorem
JGI JAIN
DEEMED-TO-BE UNIVERSIT Y
Mathematical Foundation for Computer Application

Learning Outcomes

At the end of this unit, you would:

 Applying the formula of permutation and combination
 Finding the solution of problems based on the principal of counting
 Workout on the solution of problems based on permutation and combination
 Solve problem-based on binomial theorem

Pre-Unit Preparatory Material

 http://math.utoledo.edu/~dgajews/1180_old/132%20Fundamental%20Counting%20Principle.pdf

4.1 INTRODUCTION
Now a day’s remembering passwords and pin number for your different credit cards, debit cards, email
account, phone banking, net banking have become very common. Suppose you made a PowerPoint
presentation for your office and made a 6-character password to lock your document.
But just half an hour before the presentation you forgot your password. What you only remembered is
that you used digits from 0 to 3 and alphabets ‘a’ and ‘b’ to make your password. There are how many
ways of making a password using the digits 0 to 4 and alphabets ‘a’ and ‘b’? Think about another case.
You want to buy 2 mousepads for your desktops in your office. You went to a shop and the shopkeeper
showed you 8 mousepads of different colours.
In how many ways you can select two mouse pads of different colours from those 8 mousepads? It will
be very time-consuming if you made all pairs for counting the number of ways in which you can select
two mouse pads.
The number of ways in which different things can be arranged or selected can be easily determined by
using the fundamental principle of counting.

4.2 THE RULES OF SUM AND PRODUCT

There are two fundamental counting principles:

4.2.1 Product or Multiplication Principle

Assume you went to the market to buy a mobile and back cover. You selected a one plus mobile for which
the shopkeeper showed you three different colours for each mobile and back cover. There are how many
ways in which you can select mobile and back cover.
Let M1, M2 & M3 be the three different colours of mobile the shopkeeper showed to you. And let B1, B2 &
B3 be the three different coloured back cover the shopkeeper showed you. Now, there are three ways in
which you can select a mobile. And which each mobile you can make three combinations with different
back covers. So, there will be total 3 X 3 ways in which you can select mobile and a back cover.

2
UNIT 04: Fundamental Principles of Counting JGI JAIN
DEEMED-TO-BE UNIVERSIT Y

This can be represented using Figure 1 as follows:

M1 M3 M3

B1 B3 B3 B1 B3 B3 B1 B3 B3

Figure 1: Ways of Select a Mobile and Cover

So, there is total of nine ways of selecting a mobile and a cover. They are as follows:
M1B1, M1B2, M1B3
M2B1, M2B2, M2B3
M3B1, M3B2, M3B3
So, Multiplication or the product principle of counting states that if there are ‘p’ ways of doing something
and ‘q’ ways of doing another thing then there are total pxq ways of doing that thing together.

4.2.2 Sum or Addition Principle of Counting

Assume that there are 12 men and 8 women working in an office. Managing director decided to select an
employee for the post of Team leader. In how many ways the Managing Director can select an employee
for the post of team leader because there is no gender bias.
As there is no gender bias so the managing director can select any of 12 men and 8 women for the post of
team leader. So, there are 12 + 8 = 20 ways in which he can select an employee for the post of team leader.
So, according to the sum or addition principle if there are ‘p’ and ‘q’ ways in which two independent work
events can be done then there are total p + q ways in which that can be done together.

4.3 PERMUTATIONS
Consider the same example given in the introduction. There are how many ways of making a 6-character
password using the digits 0 to 3 and alphabets ‘a’ and ‘b’ when the repetition of character is not allowed?
Now, there are 4-digits (0, 1, 2 & 3) and two alphabets (a & b). So, by the sum principle of counting there
are total of 4+2 = 6 characters. Now, a 6-character password is to be formed and repetition of character
is not allowed.
Therefore, we have 6 choices to fill the first place of the password.
As repetition of character is not allowed, we will be left with only 5 characters to fill the second place.
Similarly, we have 4, 3, 2 & 1 choices for filling the third, fourth, fifth and sixth place of the password,
respectively.
Hence, by multiplication or product principle of counting the total number of ways of making a password
is = 6 × 5 × 4 × 3 × 2 × 1 = 720 ways.

3
JGI JAIN
DEEMED-TO-BE UNIVERSIT Y
Mathematical Foundation for Computer Application

Here, we have arranged the 6 characters in different ways to make a different password.
So, permutation is counting the number of ways in which the arrangement of a thing or an object can
be done in a definite sequence.

4.3.1 Factorial Notation

Before, moving further let us learn about the factorial notation of the number.
n! read as n factorial is the product of first n natural number. Thus, 8! = 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1
11! = 11 × 10 × 9 × 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1
Hence in general
n! = n(n-1)(n-2). .......... 3×2×1

Note: 0! = 1
Example 4.3(a)
Find the value of
12!
a.
8!
b. 7!-5!

Solution
12! 12  11  10 9 8!
a. =
8! 8!
= 12  11  10  9
= 11880
b. 7! – 5!
= 5040 – 120
= 4920

Example 4.3(b)
In how many ways a four-digit ATM pin can be formed using the digits 0 to 9 when:
a. Repetition of digits is not allowed
b. Repetition of digits is allowed

Solution
a. There are total of 10 digits from 0 to 9 and repetition of digits is not allowed.
So, any of the 10 digits can be filled in the first place of the pin.
As repetition of the digit is not allowed, we are left with only 9 digits to fill the second place of the
PIN.
Similarly, the third and fourth place of the PIN can be filled by any of the remaining 8 and 7 digits
respectively.
Thus, the total number of ways in which ATM Pin can be formed = 10×9×8×7 = 5040 ways

4
UNIT 04: Fundamental Principles of Counting JGI JAIN
DEEMED-TO-BE UNIVERSIT Y

b. There are total of 10 digits from 0 to 9 and repetition of the digit is allowed. Therefore, we can fill
the first place of the pin with any of the 10 digits. As repetition of the digit is allowed, we can fill the
second place by any of the 10 digits. Similarly, we can use any of the 10 digits for filling the third and
fourth place.
Therefore, the total number of ways in which a pin can be formed = 10×10×10×10 = 10,000 ways.
Hence, by the above example we have seen that n different objects taken r at a time can be arranged
in n(n-1)(n-2). (n-r+1) ways when repetition of the item is not allowed.
n(n  1)(n  2) ......... 3 2  1
This can be written as = (n r)(n r  1)(n r  2) 3 2  1
n!
= (n  r)!

Event 1: Permutations of n different items when repetition of the item is not allowed
‘n’ different items were taken r at a time, can be arranged in n (n – 1) (n – 2). ...( n – r + 1) ways where 0 <
r ≤ n and the items do not repeat. This is denoted by nP where nP n!
r r=
r!
Event 2: Permutations of n different items when repetition of the item is allowed
‘n’ different items taken r at a time can be arranged in nr when the repetition of the object is allowed.
Example 4.3(c): In how many ways 3 blue chairs, 1 green chair and 1 red chair can be arranged
horizontally.
Solution: Total number of chairs = 3 + 1 + 1 = 5
Now, these 5 chairs taken all at a time can be arranged in 5P5 ways.
5!
=
(5  5)!

5!
=
0!
5!
=
1
= 120 ways

Now, if we interchange places of 3 blue chairs the arrangement will remain the same.
There are 3! ways in which the blue chairs can be interchanged and where the arrangement remains the
same. Therefore, we must divide 120 by 3! = 6 for getting all unique arrangements.
Hence, the number of ways in which 3 blue chairs, 1 green chair and 1 red chair can be arranged
120
horizontally = = 6 ways.
6

5
JGI JAIN
DEEMED-TO-BE UNIVERSIT Y
Mathematical Foundation for Computer Application

Event 3: Permutations of n items when t1 items are of the first kind, t2 are of second kind,..... tp are of pth
n!
kind is = t1!t2! ..... tp!

Example 4.3(d): In how many ways 6 digits mobile banking pin using the digit 0 to 9 can be formed when
the pin cannot start with 0 and repetition of the digit is not allowed?
Solution: There are total of 10 digits from 0 to 9. But the pin cannot start with 0. So, we have 9 choices to
fill the first place.
After using digits, we are left with 9 digits including the 0 as repetition of the digit is not allowed. So,
there are 9 ways in which we can choose the second digit.
Similarly, there will be 8 ways to fill the third place as repetition of the digit is not allowed.
In the same way, we can fill the fourth, fifth and sixth place of the pin by remaining 7, 6 and 5 digits
respectively.
Therefore, the number of ways of making a 6-digit mobile banking pin when the repetition of the digit
is not allowed = 9  9  8  7  6  5 = 1,36,080 ways
Example 4.3(e): In how many ways letters of the word “TREASURE” can be arranged with or without
meaning when the vowels always remain together
Solution: There is a total of 4 consonants and 4 vowels in the word “TREASURE”. Now, as the vowels
always remain together treating the 4 vowels (E,E,A,U) as one letter we will have 5 letters (4 consonants
+ 1 group of 4 vowels)
Therefore, the number of arrangements possible with these 5 letters = 5!
= 120
Now, vowels remain together but they can be rearranged within themselves.
As there are total of 4 vowels number of arrangements possible with these 4 vowels = 4! = 24

Now, there are two ‘e’. So, the arrangement will remain the same when they interchange positions within
themselves, i.e., there are 2! = 2 ways in which the arrangement will remain the same.
Similarly, there are 2 ‘r’. Therefore, there are 2!=2 ways in which the arrangement will remain the same
when the ‘r’ will interchange position within themselves.
Therefore, the total number of ways in which the letter of the words treasure can be arranged when
5!4! 120X24
vowels always remain together = 
2!2! 2X2
= 720 ways

4.4 COMBINATIONS
Now, suppose you went to the market to buy two mouse pads for your desktops in your office and the
shopkeeper showed you 3 mousepads of different colour say red, blue and green.
So, you can select the two-mouse pad in any of the following ways:
 Red-Blue

6
UNIT 04: Fundamental Principles of Counting JGI JAIN
DEEMED-TO-BE UNIVERSIT Y

 Red-Green
 Blue-Green

Hence, there are only three ways in which you can select two mouse pads out of three for your office
desktops.

Note: here order does not matter. Red-blue is the same as selecting blue red.
Consider another example. Three employees were selected in an office for the post of Manager and
Assistant Manager.
Let us consider the employees as E1, E2 & E3. Therefore, the number of how two men can be selected for
the post of Manager and Assistant Manager = 3x2= 6 ways.
So, they can be selected as:
E1-E2, E1-E3, E2-E3, E2-E1, E3-E1 & E3-E2.

Note: Here E1-E2 is not the same as E2-E1 because the posts are different.
In the first case, E1 is the manager and in the second case, E1 is the assistant manager. Hence, in this
question order of the selection matters, so we will apply the formula of permutation here.
If r things are to be selected out of a group of n things where the order of arrangement doesn’t matter
n!
then those r things can be selected in (n r )!r ! ways where 0≤r≤n because there will be r! ways in which
we will get the same group.
This can be represented as:

n!
Cr =
n where 0≤r≤n
(n r )!r !

Example 4.4(a): In how many ways 2 webcam and 2 keyboards can be selected from 4 different webcam
and 5 different keyboards?
Solution:
The two-web cam out of 4 can be selected in = 2C4 ways.
The two keyboards out of 5 keyboards can be selected in = 2C5 ways.
Therefore, the total number of ways of selecting 2 webcam and 2 keyboards are as follows:
= 2C4 2C5
4! 5!
= 
(4  2)!2! (5  2)!2!

4! 5!
= 
2!2! 3!2!

= 610
= 60 ways

7
JGI JAIN
DEEMED-TO-BE UNIVERSIT Y
Mathematical Foundation for Computer Application

Example 4.4(b): In how many ways a team of 5 can be made from a group of 4 females and 5 males when
the team should have at least 2 males and 2 females?
Solution: The team should have at least 2 males and 2 females.
Therefore, the team can be made in two ways, i.e.,
Case 1: When a team has 2 males and 3 females.
Case 2: When a team has 3 females and 2 females.
Case 1:
2 Males out of 5 can be selected in 5C2 ways.
3 Females out of 4 can be selected in 4C3 ways.
Therefore, team of 5 consisting of 2 males and 3 females can be made in
= 5C2 4C3
5! 4!
= 
(5  2)!2! (4  3)!3!

5! 4!
= 
3!2! 1!3!

= 104
= 40 ways
Case 2:
3 Males out of 5 can be selected in 5C3 ways.
2 Females out of 4 can be selected in 4C2 ways.
Therefore, a team of 5 consisting of 2 males and 3 females can be made in
= 5C3 4C2
5! 4!
= 
(5  3)!3! (4  2)!2!

5! 4!
= 
2!3! 2!2!

= 106
= 60 ways
Therefore, the total number of ways in which a team of 5 can be made from a group of 4 females and 5
males when the team should have at least 2 males and 2 females = 40 + 60 = 100 ways.
Theorem 1:

nCn-r = nCr

8
UNIT 04: Fundamental Principles of Counting JGI JAIN
DEEMED-TO-BE UNIVERSIT Y

Proof
n! n!
n
C nr   n C
[n (n r )]!(n r )! r !(n)r ! r

In particular if nCp =nCq, then n-p = q.

Therefore, n = p+q
Theorem 2:
Cr + nCr-1 = n+1Cr
n

Proof
LHS = nCr + nCr-1
n! n!
 
(n r )!r ! [n (r  1)]!(r  1)!

n! n!
 
(n r )! r(r  1)! (n r  1)!(r  1)!

n! n!
 
(n r )! r(r  1)! (n r  1)(n r )!(r  1)!
 n!  1 1 
  (n r )!(r  1)!   r  (n r  1)
  
 n!  (n r  1) r 
   
 (n r )!(r  1)!  r(n r  1) r(n r  1)

 n!  (n  1) 
  
 (n r )!(r  1)!  r(n r  1)

(n  1)!

r !(n r  1)!
= n+1Cr

Example 4.4(c):
a. If nC5 = nC2, then find n.
b. If nC11 = nC7, then find n.
Solution:
a. n
C5 = nC2
We know, if nCp =nCq, then n – p = q. (by theorem 1)
Therefore, n – 5 = 2
n=2+5
n=7

9
JGI JAIN
DEEMED-TO-BE UNIVERSIT Y
Mathematical Foundation for Computer Application

b. C11 = nC7
n

We know, if nCp =nCq, then n-p = q. (by theorem 1)

Therefore, n-11=7
 n=11+7
 n=18

4.5 THE BINOMIAL THEOREM

We already know that the variables and constant together form an expression. Variables are usually
represented by small letters x, y, z, a, b, etc., and can take any value while the constant has a fixed value.
The expression that contains one term is known as a monomial, while the expression that contains two
terms is known as binomial and the expression that contains three terms is known as trinomial.
In general, the expression with one or more terms is known as a polynomial.
Some of the examples of the polynomial are as follows:
 Monomial: 2xyz, 4a, -7m, etc.
 Binomial: 5x+7, -8ab+2b, 7pq-8, etc., are some of the examples of binomial.
 Trinomial: 8x+7y+7z, 2xy+7z+6, -7pq+8p-27q, etc., are some of the examples of trinomial.

Here, in this topic, we will be concentrating on binomial expressions only.

We already know the expansion of the some of the binomial expressions. Such as:
(x + y)0 = 1
(x + y)1 = x+y
(x + y)2 = x2+2xy+y2
(x + y)3 = x3 + 3x2y + 3xy2 + y3
All these expansions are used to make our calculations easy.
For example, if we calculate (1007)3 then instead of multiplying three times we may apply the formula of
(x + y)3 = x3 + 3x2y + 3xy2 + y3 where x = 1000 and y = 7.
Similarly, we may derive the formula for (x + y)4.
So, (x + y)4 = (x + y)(x + y)3
= (x + y)(x3 + 3x2y+3xy2+y3)
= x(x3 + 3x2y + 3xy2 + y3) + y(x3 + 3x2y + 3xy2 + y3)
= x4 + 4x3y + 6x2y2 + 4xy3 + y4
You may have noticed from all these expansions that as the power is increasing the number of terms
in expansion is also increasing. The number of terms in the expansion is one more than the power of
the binomial expression. So, when the power is 0 the number of terms in the expansion is one when the
power is 1 the number of terms in the expansion is 2 when the power is 2 the number of terms in the
expansion is 3 and so on.

10
UNIT 04: Fundamental Principles of Counting JGI JAIN DEEMED-TO-BE UNIVERSIT Y

Secondly, the sum of the power of x and y in the expansion is the same as the power of the binomial
expression.
Thirdly, as we move forward the power of x is decreasing while the power of y is increasing.
Here, we will discuss the general formula for the expansion of the binomial expression with power n
where n≥0.
(x + y)n = nC0xn + nC1x(n-1)y + nC2x(n-2)y2 + nC3x(n-3)y3 + nC4x(n-4)y4 + .............. +nC(n-1)xy(n-1) + nCnyn
n!
where nCk =
(n  k)!k!

and
(x-y)n = nC0xn - nC1x(n-1)y + nC2x(n-2)y2 - nC3x(n-3)y3 + nC4x(n-4)y4 ............................ +(-1)(n-1)nC(n-1)xy(n-1) +(-1)n nCnyn
where nC = (-1)n n!
k (n  k)!k!

Example 4.5(a): Write the expansion of each of the following binomial expressions:
a. (5x + 7y)6
2 8
b. ( x – y)
3

Solution:
a. (5x + 7y)6
= 6C0 (5x)6 + 6C1 (5x)(6-1) (7y) + 6C2 (5x)(6-2) (7y)2 + 6C3 (5x)(6-3) (7y)3 + 6C4 (5x)(6-4) (7y)4 + 6C1 (5x) (7y)(6-1) + 6C6 (7y)6
6! (15625x6) + 6! 6! 6! 6!
= (3125x5)(7y) + (625x4)(49y2) + (125x3)(343y3) +
6!0! (6  1)!1! (6  2)!2! (6  3)!3! (6  4)!4!
6! 6!
(25x2)(2401y4) + (5x)(16807y5) + (117649y6)
(6  5)!5! (6  6)!6!
= 15625x6 + 6. (3125x5)(7y) + (15) (625x4)(49y2) +(20) (125x3)(343y3) + (15)(25x2)(2401y4) + (6)(5x)(16807y5)+
(117649y6)
= 15625x6 + 131250 x5y + 459375x4y2 + 857500x3y3 + 900375 x2y4 + 504210 xy5+ 117649y6
2 8 8
2 8 8 2 7 8
2 6 2 8 2 5 3 8 2 4 4 8 2 3 5 8

b. ( x – y) = C0 ( x) – C1 ( x) (y) + C2 ( x) (y) - C3 ( x) (y) + C4 ( x) (y) – C5 ( x) (y) + C6

3 3 3 3 3 3 3
2 2 6 8 2
( x) (y) – C ( x) (y)7 + 8C (y) 8

3 7
3 8

256 8 128 7 64 6 2 32 5 3 16 4 4 8 3 5 4 2
= x – 8. x (y) + 28. x (y) - 56 x (y) + 140 x (y) - 56 x (y) + 28 . x2 y6 - 8
6561 2187 729 243 81 27 9 3
x (y)7 + (y)8
256 8 1024 7 1792 6 2 1792 5 3 2240 4 4 448 3 5 112 2 6 16
= x – x y+ x (y) - x (y) + x (y) - x (y) + x y - x (y)7 + (y)8
6561 2187 729 243 81 27 9 3

11
JGI JAINDEEMED-TO-BE UNIVERSIT Y
Mathematical Foundation for Computer Application

General Term of the Binomial Expression

The general (k + 1)th term of the binomial expression (x + y)n where n ≥ 0 is given by the formula
T(k+1) = nCk x(n-k) yk
Middle term of the Binomial Expression (x + y)n where n ≥ 0
Case 1
We know that there are (n+1) terms in the expansion of binomial expression (x + y)n where n ≥ 0. If n is an
even number the then there will be an odd number of terms in the expansion.
th
So, there will be only one
n 
middle term. Hence, the middle term of the expansion will be  2  1 term.
 

Case 2
If n is odd then there will be even number of terms in the binomial
th
expansion. thHence, there will be two
n n 
terms in the middle. Therefore, the middle term will be   term and   1 term.
 2   2 

Example 4.5(b): Find the middle term of the expansion (5p – 2q)8.
Solution:
As the power of the binomial expansion (5p – 2q)8 is even so there will be an odd number of terms in the
8 
expansion. Hence, there will be one term in the middle, i.e.,  1 = (4 + 1)th term = 5th term.
 2 
 
The general kth term of the binomial expression (x + y)n where n ≥ 0 is given by the formula
T(k+1) = nCk x(n-k) yk
So T5 = T(4 + 1) = (-1)4 8C4 (5p)(8-4) (2q)4
= 140. (625p4)(16q4)
= 1400000p4q4

Example 4.5(c):
Find the value of k if 5th and 6th term of the expansion (1 + k)10 are equal.
Solution: The general kth term of the binomial expression (x + y)n where n ≥ 0 is given by the formula
T(k+1) = nCk x(n-k) yk
So T5 = T(4+1) = 10C4 (1)(10 – 4) (k)4
10 9 8 7 4
 K
1  2  3 4

T6 = T(5+1) = 10C5 (1)(10-5) (k)5

10 9 8 7 6 5
 k
1  2  3 4  5

12
UNIT 04: Fundamental Principles of Counting JGI JAIN
DEEMED-TO-BE UNIVERSIT Y

According to the given condition:

T5 = T6
10 9 8 7 4 10 9 8 7 6 5
 k  k
1  2  3 4 1  2  3 4  5
5
k
6

Kth term from the end of the Binomial Expression (x + y)n where n ≥ 0
The kth term from the end of the binomial expression (x + y)n where n≥0 is (n – r + 2)th term.
As there are (n+1) terms in the binomial expansion of (x + y) n where n≥0, so (n + 1)th term will be first term
form the end.
(n + 1) = (n + 1) – (1 – 1)
2nd term from the end = nth term = (n + 1) – (2 - 1)
3rd term from the end = (n-1)th term = (n + 1) – (3 - 1)
So kth term from the end = (n-k)th term = (n + 1) – (k - 1)
= (n + 2 – k)th term

4.6 COMBINATIONS WITH REPETITION

Suppose 3 balls are to be selected from the red, green, blue and yellow balls but each ball can be selected
more than once. We may think this of as we may draw the ball and replace the ball and then select the
ball again.
Note, here we are not replacing the last ball again. Therefore, instead of 4 choices we have (4+3-1) = 6
choices. Therefore, the total number of ways of selecting 3 balls out of 4 with repetition is = 6C3.
Therefore, the general formula for the number of ways for selecting r balls from n balls with repetition
is = (n+r-1)Cr
This is equivalent to saying that:
Case 1
r identical objects are to be distributed between n boxes or containers.
Or
Case 2
How many positive integer solutions are there for x1, x2, x3.....xn such that x1+x2+x3+.......... xn = r where
x1, x2, x3. .. xn ≥ 0?
Example 4.6(a):
How many positive integer solutions are there for x1, x2, x3, x4 such that x1+x2+x3+ x4= 11 where x1, x2,
x3, x4 ≥ 0?

13
JGI JAINDEEMED-TO-BE UNIVERSIT Y
Mathematical Foundation for Computer Application

Solution:
The total number of positive integer solutions = (n + r – 1)Cr where n = 4 and r = 11
= (4 + 11 – 1)C11
= 14C11
= 364

Example 4.6(b):
How many positive integer solutions are there for x1, x2, x3, x4 such that x1+x2+x3+ x4= 11 where x1, x2,
x3 ≥ 0 and x4≥3?
Solution:
Here, x 4 ≥ 4. Let x` = x4 – 3
Therefore, the equation x1 + x2 + x3 + x4 = 11 can be re-written as:
x1 + x2 + x3 + x` + 3 = 11 where x1, x2, x3, x`≥ 0
 x1 + x2 + x3 + x` = 8
The total number of positive integer solutions = (n+r-1)Cr where n = 4 and r = 8
= (4+8-1)C8
= 11C8
= 165

Conclusion 4.7 CONCLUSION

 The number of ways in which different things can be arranged or selected can be easily determined
by using the fundamental principle of counting.
 There are two fundamental counting principles:
 Product or Multiplication Principle
 Sum or addition Principle of counting
 n! read as n factorial is the product of first n natural number.
 The general formula for the expansion of the binomial expression with power n where n≥0.
(x + y)n = nC0xn + nC1x(n-1)y + nC2x(n-2)y2 + nC3x(n-3)y3 + nC4x(n-4)y4 + ............. +nC(n-1)xy(n-1) + nCnyn

n!
where nCk =
(n  k)!k!

14
UNIT 04: Fundamental Principles of Counting JGI JAIN
DEEMED-TO-BE UNIVERSIT Y

4.8 GLOSSARY

 Permutation: Permutation is counting the number of ways in which the arrangement of a thing or
an object can be done in a definite sequence.
 Combination: If r things are to be selected out of a group of n things where the order of arrangement
n!
doesn’t matter then those r things can be selected in
ways where 0 ≤ r ≤ n because there
n r  !r!
will be r! ways in which we will get the same group.

4.9 SELF-ASSESSMENT QUESTIONS

A. Essay Type Questions

1. How many numbers between 999 and 10,000 have 3 in the unit’s place?
2. How many numbers between 999 and 10,000 have at least one of the digits as 3?
3. In how many ways a team of 6 can be made from 5 male and 4 female players when the team should
have at least 2 male and 2 female players?
4. In how many ways the letters of the word “COMPUTER” with or without meaning may be arranged?
5. In how many ways the letters of the word “PRINTER” may be arranged?
6. In how many ways 5 men and 3 women can sit horizontally so that no two women are together?
7. The co-efficient of two successive terms of binomial expansion (x + y)21 are in the ratio of 2:9. Find the
terms of the expansion.
8. How many positive integer solutions are there for x1, x2, x3, x4 such that x1+x2+x3+ x4 + x5 = 16
where x1, x2, x3, x4, x5≥ 0?

4.10 ANSWERS AND HINTS FOR SELF-ASSESSMENT QUESTIONS

A. Hints for Essay Type Questions

1. 900 numbers
The number between 999 and 10,000 will have four digits. 0 cannot be in the thousands place and 3
will be there in the unit’s place.
2. 3168
Total number of numbers= 9  10  10  10
The number of numbers in which 3 does not appear at all = 8  9  9  9
= 5832
Therefore, required number = 9000 – 5832 = 3168
3. 80 ways
The team may have 2 males 4 females or 3 males 3 females or 4 males 2 females.

15
JGI JAINDEEMED-TO-BE UNIVERSIT Y
Mathematical Foundation for Computer Application

4. 40320 ways [8! Ways]

7!
5. 2520 ways [ ways]
2!
6. 120 ways
Men can sit in any of the places marked as M. So, men sit in 5P5 ways. Also, women may sit in places
marked as W. So, women can sit in 6P3 ways.
W M W M W M W M W M W
Therefore, total ways = P5 . P3 5 6

7. 4th and 5th term

8. 4845

@ 4.11 POST-UNIT READING MATERIAL

 https://www.examsbook.com/permutation-and-combination-questions-with%20answers
 https://www.examsbook.com/permutation-and-combination-problems-with-solutions
 https://testzone.smartkeeda.com/Blog/Permutation-and-combination-Questions

4.12 TOPICS FOR DISCUSSION FORUMS

 Discuss with your friend and write down five situations where you can apply the formula of
permutation and combination. Also, calculate the number of ways of the corresponding situation.
(Hint: you may apply permutation while making email password, the pin of mobile banking, ATM
Pin, Credit card pin, etc.)

16
UNIT 04: Fundamental Principles of Counting JGI JAIN
DEEMED-TO-BE UNIVERSIT Y

17