Practice Book

for
STATISTICS FOR DATA SCIENCE - 1
Contents
1 Basic Principle of Counting 3
1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.1.1 Addition rule of counting . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.1.2 Multiplication rule of counting . . . . . . . . . . . . . . . . . . . . . . 3
1.1.2.1 Solved Examples: . . . . . . . . . . . . . . . . . . . . . . . . 4
1.1.3 Unsolved Problems: . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6

2 Factorial 7
2.1 Definition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
2.1.0.1 Simplifying expressions: . . . . . . . . . . . . . . . . . . . . 7
2.1.0.2 Unsolved Problems: . . . . . . . . . . . . . . . . . . . . . . 8

3 Permutation 9
3.1 Definition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
3.1.0.1 Solved Examples: . . . . . . . . . . . . . . . . . . . . . . . . 9
3.2 Permutation formula . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
3.2.1 When repetition is not allowed. . . . . . . . . . . . . . . . . . . . . . 11
3.2.1.1 Solved examples by using permutation formula: . . . . . . . 11
3.2.1.2 Example: Application . . . . . . . . . . . . . . . . . . . . . 13
3.3 Permutation formula . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
3.3.1 When repetition is allowed. . . . . . . . . . . . . . . . . . . . . . . . 14
3.3.1.1 Solved examples: . . . . . . . . . . . . . . . . . . . . . . . . 15
3.4 Permutation formula . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
3.4.1 Rearranging letters . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
3.5 Circular Permutation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
3.5.1 Clockwise and anticlockwise are different . . . . . . . . . . . . . . . . 17
3.5.2 Clockwise and anticlockwise are same . . . . . . . . . . . . . . . . . . 18
3.5.2.1 Examples of calculating n and r. . . . . . . . . . . . . . . . 19
3.6 Unsolved Problems: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21

4 Combination 22
4.1 Definition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
4.1.0.1 Solved Examples: . . . . . . . . . . . . . . . . . . . . . . . . 22
4.1.1 Drawing lines in a circle . . . . . . . . . . . . . . . . . . . . . . . . . 24
4.1.1.1 Some more solved examples on permutation and combination: 25
4.2 Unsolved Problems: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27

2
 Chapter 1

1 Basic Principle of Counting

1.1 Introduction
1.1.1 Addition rule of counting
If an action A can occur in n1 different ways, another action B can occur in n2 different
ways, then the total number of ways of occurrence of the actions A or B is n1 + n2 .

Example: You have a gift card from a major retailer which allows you to buy “one” item,
either a shirt or a pant. If the choices at the retailer are 1 yellow shirt, 1 blue shirt, 1 green
shirt, 1 red shirt, 1 black pant, 1 blue pant and 1 brown pant, then in how many ways can
you use your card?

Solution:
There are four choices to buy a shirt. You can buy either a yellow shirt or a blue shirt or a
green shirt or a red shirt.
There are three choices to buy a pant. You can buy either a black pant or a blue pant or a
brown pant.
If you choose to buy a shirt (pant), then you cannot buy a pant (shirt) because gift card
allows you to buy “one” item, either a shirt or a pant.
Hence, the total number of choices available is 4 + 3 = 7.

1.1.2 Multiplication rule of counting

If an action A can occur in n1 different ways, another action B can occur in n2 different
ways, then the total number of ways of occurrence of the actions A and B together is n1 ×n2 .

Example: You have a gift card from a major retailer which allows you to one shirt and one
pant. If the choices at the retailer are 1 yellow shirt, 1 blue shirt, 1 green shirt, 1 red shirt,
1 black pant, 1 blue pant and 1 brown pant, then in how many ways can you use your card?

Solution:
Here, card allows to buy one shirt and one pant, i.e, if you can buy a shirt (pant), then you
can also buy a pant (shirt).
Thus, total choices will be as follows:
1. yellow shirt-black pant
2. yellow shirt-blue pant
3. yellow shirt-brown pant

3
 4. blue shirt-black pant

5. blue shirt-blue pant

6. blue shirt-brown pant

7. green shirt-black pant

8. green shirt-blue pant

9. green shirt-brown pant

10. red shirt-black pant

11. red shirt-blue pant

12. red shirt-brown pant

Hence, you have 12 options in total to buy a shirt and pant together which is nothing but
the application of multiplication rule as 4 × 3 = 12.
Generalization of Multiplication Rule:
Suppose that r actions are to be performed in a definite order. Further, suppose that there
are n1 possibilities for the first action and that corresponding to each of these possibilities
are n2 possibilities for the second action, and so on. Then there are n1 × n2 × . . . × nr
possibilities altogether for the r actions.

Example: You have a gift card from a major retailer which allows you to buy one shirt, one
pant and one pair of shoes. And, the choices at the retailer are 1 yellow shirt, 1 blue shirt,
1 green shirt, 1 red shirt, 1 black pant, 1 blue pant, 1 brown pant and 2 pairs of shoes (1
black pair of shoes and 1 brown pair of shoes), then in how many ways can you use your card?

Solution:
Here, three actions are to be performed, where the first action is buying a shirt, second
action is buying a pant and third action is buying a pair of shoes.
Since there are 4 possibilities for buying a shirt, 3 possibilities for buying a pant and 2
possibilities for buying a pair of shoes, there are 4 × 3 × 2 = 24 possibilities altogether for
the three actions.
Hence, there are 24 ways in total in which card can be used.

1.1.2.1 Solved Examples:

Q1. Suppose you are asked to create a six digit alphanumeric password with the requirement
that the password should have first two digits as alphabets (upper case) followed by
four numbers, then in how many ways password can be created if the repetition is
allowed?

4
 Solution:
We are given that password should have first two letters followed by four numbers and
there are a total of 26 upper case alphabets and 10 digits (0, 1, . . . , 9) which can be
used for the password.
Since the repetition is allowed, we can use any of the 26 alphabets for the first place.
Similarly, for the second place we can use any of the 26 alphabets. Now, for the third
place we can use any of the 10 digits, for the fourth place, again we can use any of the
10 digits, and so on.
So, here 6 actions are to be performed: first action is to choose an alphabet for the
first place, second action is to choose an alphabet for the second place, third action is
to choose a number for the third place, and so forth.
Thus, by the multiplication rule of counting, total number of ways of occurrence of all
the 6 actions together is

26 × 26 × 10 × 10 × 10 × 10 = 6, 760, 000

Hence, there are a total of 6, 760, 000 ways in which password can be created.

Q2. Suppose you are asked to create a six digit alphanumeric password with the requirement
that the password should have first two digits as alphabets (upper case) followed by
four numbers, then in how many ways password can be created if the repetition is not
allowed?
Solution:
We are given that password should have first two letters followed by four numbers and
there are a total of 26 upper case alphabets and 10 digits (0, 1, 2, . . . , 9) which can be
used for the password.
Since the repetition is not allowed, we can use any of the 26 alphabets for the first
place. For the second place we can use any of the 25 alphabets (as one alphabet is
already used for the first place). Now, for the third place we can use any of the 10
digits and for the fourth place we can use any of the 9 digits (as one digit is already
used for the third place) and so on.
Thus, by the multiplication rule of counting, total number of ways = 26 × 25 × 10 ×
9 × 8 × 7 = 3, 276, 000.
Hence, there are total 3, 276, 000 ways in which password can be created.

Q3. There are eight athletes who take part in a 100 m race. What are the possible ways
the athletes can finish the race (assuming no ties)?
Solution:
There are a total of 8 people who are participating in the race, so we will have eight
different positions of finishing the race.
For the first place, we can have any of the 8 athletes. For the second place, we can
have anyone from the remaining 7 athletes, and so on.

5
 Thus, by multiplication rule of counting, total number of ways is

8 × 7 × 6 × 5 × 4 × 3 × 2 × 1 = 40, 320

Hence, there are a total of 40, 320 ways in which athletes can finish the race.

1.1.3 Unsolved Problems:

Q1. Narendra is going to purchase some sports items at a sport shop. He has the choice
of cricket bats from MRF, Spartan, SS or Mongoose, choice of cricket balls from SG,
Acorn, Jaspo or Kookaburra, choice of cricket stumps from 8 brands, choice of cricket
jerseys from 5 brands and choice of a sport shoes from 10 brands. How many ways can
Narendra purchase the sports items? (Assume that he purchases only one item from
either of all categories)

Q2. Narendra is going to purchase some sports items at a sport shop. He has the choice
of cricket bats from MRF, Spartan, SS or Mongoose, choice of cricket balls from SG,
Acorn, Jaspo or Kookaburra, choice of cricket stumps from 8 brands, choice of cricket
jerseys from 5 brands and choice of a sport shoes from 10 brands. How many ways can
Narendra purchase the sports items? (Assume that he purchases only one item from
each category)

Q3. In a class, there are 60 students out of which the cricket captain and class-representative
needs to be elected. A student can take only one position at a time. What are the
total number of possible ways in which students can be elected for these positions?

Q4. In a class, there are 60 students out of which the cricket captain and class-representative
needs to be elected. A student can take both the positions of cricket captain and
position of class-representative at the same time. What are the total number of possible
ways in which students can be elected for these positions?

Q5. How many words of five letters word can be formed using lower case alphabets such
that the words start with vowels and end with alphabet A? (Assume that words can
be meaningless and repetition is not allowed)

6
 Chapter : 2

2 Factorial
2.1 Definition
The product of the first n positive integers (counting numbers) is called n factorial and is
denoted n!. In symbols,
n! = n × (n − 1) × . . . × 1

Remark:
By convention 0! = 1
Example: There are eight athletes who take part in a 100 m race. What are the possible
ways the athletes can finish the race (assuming no ties)?
Solution:
There are a total of 8 people who are participating in the race, so we will have eight different
positions of finishing the race.
For the first place, we can have any of the 8 athletes. For the second place, we can have
anyone from the remaining 7 athletes, and so on.
Thus, total number of ways = 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1 = 8! (by definition of factorial).
Note:
n! = n × (n − 1)!
For example:
If n = 5, then 5! = 5 × 4!
In general:
For i ≤ n we have,
n! = n × (n − 1) × . . . × (n − i + 1) × (n − i)!
For example:
5! = 5 × 4! = 5 × 4 × 3!

2.1.0.1 Simplifying expressions:

6! 6 × 5 × 4 × 3!
1. = = 6 × 5 × 4 = 120.
3! 3!
  
6! × 5! 6 × 5 × 4 × 3! 5 × 4!
2. = = 6 × 5 × 4 × 5 = 600.
3! × 4! 3! 4!
3. Express 25 × 24 × 23 in terms of factorials:
25 × 24 × 23 × 22 × . . . × 1 25!
=
22 × 21 × . . . × 1 22!
7
2.1.0.2 Unsolved Problems:
(n − 1)!
Q1. If = 6, then find the value of n?
(n − 3)!
(7 × 6)
Q2. Express in terms of Factorials.
(4 × 3)
1 20
Q3. If = , then calculate the value of n?
(n − 4)! (n − 2)!
6 × 5 × 4!
Q4. Find the value of the expression .
4

8
 Chapter : 3

3 Permutation
3.1 Definition
A permutation is an ordered arrangement of all or some of n objects.

3.1.0.1 Solved Examples:

1. What are all the possible arrangements of A, B and C when we take all of them at a
time?
Solution:

First place Second place Third place

A B C
A C B
B A C
B C A
C A B
C B A

2. What are all the possible arrangements of A, B and C when we take two of them at a
time?
Solution:

First place Second place

A B
A C
B A
B C
C A
C B

3. What are all the possible arrangements of A, B, C and D when we take all of them at
a time?
Solution:
If we fix A in the first place, then we have to arrange B, C and D at the remaining
three places i.e. second, third and the fourth place. And, the number of way in which
we can fill these three places with B, C and D is 6. So, if we fix A in the first place,

9
 we get 6 ways of getting hold of different possible arrangements.
Now, if we fix B in the first place, then we have to arrange A, C and D at the remaining
three places. And, number of ways to fill these three places is 6.
Similarly, if we fix C in the first place, then we have to arrange A, B and D at the
remaining three places. And again, there are 6 ways for the same.
If we fix D in the first place, we have to arrange A, B and C at the remaining three
places. And there are again 6 ways for the same. Finally, we have total of 6+6+6+6 =
24 arrangements.
Also, we can list all the arrangements as follows:

First place Second place Third place Fourth place

A B C D
A B D C
A C B D
A C D B
A D B C
A D C B
B A C D
B A D C
B C A D
B C D A
B D A C
B D C A
C A B D
C A D B
C B A D
C B D A
C D A B
C D B A
D A B C
D A C B
D B A C
D B C A
D C A B
D C B A

4. What are all the possible arrangements of A, B, C and D when we take two of them
at a time?
Solution:

10
 First place Second place
A B
A C
A D
B A
B C
B D
C A
C B
C D
D A
D B
D C

3.2 Permutation formula

3.2.1 When repetition is not allowed.
The number of possible permutations of r objects from a collection of n distinct objects is
given by the formula
n × (n − 1) × . . . × (n − r + 1)
and is denoted by nP r .
n n!
Pr =
(n − r)!

Special cases

n! n!
1. nP 0 = = = 1. There is only one ordered arrangement of 0 objects.
(n − 0)! n!
n!
2. nP 1 = = n. There are n ways of choosing one object from n objects.
(n − 1)!
n! n!
3. nP n = = = n!. We can arrange n distinct objects in n! ways - multiplication
(n − n)! 0!
principle of counting.

3.2.1.1 Solved examples by using permutation formula:

5. What are all the possible arrangements of A, B and C when we take all of them at a
time?
Solution:

11
 First place Second place Third place
A B C
A C B
B A C
B C A
C A B
C B A

n! 3! 3!
Here, n = 3, r = 3. So, nP r = = = = 3! = 6. (As 0! = 1)
(n − r)! (3 − 3)! 0!

6. What are all the possible arrangements of A, B and C when we take two of them at a
time?
Solution:

First place Second place

A B
A C
B A
B C
C A
C B

n! 3! 3!
Here, n = 3, r = 2. So, nP r = = = = 6.
(n − r)! (3 − 2)! 1!

7. What are all the possible arrangements of A, B, C and D when we take all of them at
a time?
Solution:
Here, n = 4, r = 4.
n! 4! 4!
So, nP r = = = = 4! = 24.
(n − r)! (4 − 4)! 0!
Thus, there are a total 24 possible arrangements and all the arrangements are listed in
example 3.

8. What are all the possible arrangements of A, B, C and D when we take two of them
at a time?
Solution:

12
 First place Second place
A B
A C
A D
B A
B C
B D
C A
C B
C D
D A
D B
D C

n! 4! 4! 4 × 3 × 2!
Here, n = 4, r = 2. So, nP r = = = = = 12.
(n − r)! (4 − 2)! 2! 2!

3.2.1.2 Example: Application

1. From a committee of 8 persons, in how many ways can we choose a chairman and a
vice chairman assuming one person can not hold more than one position?
Solution:
Suppose, A, B, C, D, E, F , G, H, are the 8 persons. A could be a chairman, B could
be a vice chairman or B could be a chairman, A could be a vice chairman. So, these
two arrangements are different (i.e. order matters).
Here, we have 8 persons (n = 8) in total and we want to know number of ways in
which we can choose a chairman and vice chairman. So, r = 2.
8! 8! 8 × 7 × 6!
Thus, total number of ways = 8P 2 = = = = 8 × 7 = 56.
(8 − 2)! 6! 6!

2. Find the number of 4-digit numbers that can be formed using the digits 1, 2, 3, 4, 5 if
no digit is repeated.
Solution:
Since no digit is repeated. Therefore, we have n = 5 distinct digits in total. Also, we
have to form number of 4-digit numbers (i.e. we have 4 blanks). So, r = 4.
5! 5!
Total number of ways = 5P 4 = = = 5! = 5 × 4 × 3 × 2 × 1 = 120.
(5 − 4)! 1!
• How many of these will be even?
If we want to count the number of even numbers, then last digit can either be 2 or 4.
We will fix the last digit here. If we fix the last digit, we have 3 blank spaces(i.e. we
have to choose 3 digits).
If we fix the last digit as 2, then we have digits 1, 3, 4 and 5 in total, i.e., n = 4 and

13
 we have to choose 3 digits from these 4 digits.
4! 4!
And, that can be done in 4P 3 = = = 4! = 4 × 3 × 2 × 1 = 24 ways.
(4 − 3)! 1!
Similarly, if we fix the last digit as 4, then we have digits 1, 2, 3 and 5 in total, i.e.,
n = 4 and we have to choose 3 digits from these 4 digits.
4! 4!
And, that can be done in 4P 3 = = = 4! = 4 × 3 × 2 × 1 = 24 ways.
(4 − 3)! 1!
Therefore, total number of ways = 24 + 24 = 48.

3(i). Six people go to the cinema. They sit in a row with ten seats. Find how many ways
can this be done if they can sit anywhere.
Solution:
We have 10 available seats and 6 people can sit anywhere in the row of ten seats. Thus,
n = 10 and r = 6.
10! 10!
Now, total number of arrangements = 10P 6 = = = 151200.
(10 − 6)! 4!
Hence, six people can sit in a row with ten seats in 151200 ways when they can sit
anywhere.

3(ii). Six people go to the cinema. They sit in a row with ten seats. Find how many ways
can this be done if all the empty seats are next to each other.
Solution:
We have 10 seats in total. Since, six people have to sit in a row of 10 seats. Therefore,
we will have 4 seats as empty.
Now, the condition is that all four empty seats are next to each other. So, we can
consider these four empty seats as a single block. If these 4 empty seats are considered
as 1 distinct object, then the total number of distinct objects are 1, 2, 3, 4, 5, 6 and 7.
So, we have 7 places available and we have to set 6 people in these 7 places.
7! 7!
Thus, total number of ways= 7P 6 = = = 7! = 5040 ways.
(7 − 6)! 1!
Hence, six people can sit in a row with ten seats in 5040 ways when all the empty seats
are next to each other.

3.3 Permutation formula

3.3.1 When repetition is allowed.
The number of possible permutations of r objects from a collection of n distinct objects
when repetition is allowed is given by the formula

n × n × ... × n

and is denoted by nr .

14
3.3.1.1 Solved examples:
1. What are all the possible arrangements of A, B and C when we take all of them at a
time, if repetition is allowed?
Solution:
Since repetition is allowed. Therefore, first place can be filled with A or B or C, second
place can be filled with A or B or C, third place can be filled with A or B or C. So,
there are 3 choices available for the first place, 3 choices available for second place and
3 choices available for the third place, because all the choices are available for all the
places. So, the total number of arrangements = 3 × 3 × 3 = 27.

Also, we can list all the arrangements as follows;

First place Second place Third place

A A A
A A B
A A C
A B A
A B B
A B C
A C A
A C B
A C C
B A A
B A B
B A C
B B A
B B B
B B C
B C A
B C B
B C C
C A A
C A B
C A C
C B A
C B B
C B C
C C A
C C B
C C C

15
 2. What are all the possible arrangements of A, B and C when we take two of them at a
time, if repetition is allowed?
Solution:
Since, we have A, B and C in total and we have to find all the possible arrangements
by taking two of them with repetition. Therefore, n = 3 and r = 2.
Thus, all the possible arrangements = nr = 32 = 9.
Also, we can list all the arrangements as follows;

First place Second place

A A
A B
A C
B A
B B
B C
C A
C B
C C

3.4 Permutation formula

3.4.1 Rearranging letters
(1). The number of permutations of n objects when p of them are of one kind and rest
n!
distinct is equal to .
p!
For example:
Suppose we want to rearrange the letters in the word “DATA”. How many ways can it be
done?
Solution:
In “DATA”, we have 4 objects and 2 of them, i.e., A which are of one kind. Thus, we have
n = 4 and p = 2.
4! 4 × 3 × 2!
Hence, the total number of ways the letters in “DATA” can be arranged is = =
2! 2!
4 × 3 = 12.
Hence, all the possible arrangements can be listed as follows:

16
 First place Second place Third place Fourth place
A D T A
A D A T
A T D A
A T A D
A A D T
A A T D
D A T A
D A A T
D T A A
T A D A
T A A D
T D A A

(2). The number of permutations of n objects where p1 is of one kind, p2 is of second kind,
and so on pk of k th kind is given by
n!
p1 !p2 ! . . . pk !

For example:
Suppose we want to rearrange the letters in the word “STATISTICS”. How many ways can
it be done?
Solution:
Total of ten letters of which there are five distinct letters: S, T, A, I, C. Also, “S” appears
3 times, “T” appears 3 times, “A” once, “I” twice, and “C” once.
Now, applying the formula to the word “STATISTICS”, we get
n = 10, p1 = 3, p2 = 3, p3 = 1, p4 = 2, p5 = 1.
10!
Hence, total number of ways = = 50, 400.
3!3!1!2!1!

3.5 Circular Permutation

3.5.1 Clockwise and anticlockwise are different
The number of ways n distinct objects can be arranged in a circle (clockwise and anticlockwise
are different) is equal to (n − 1)!.
For Example:
How many ways can four people sit in a round table?
Solution:
Consider four people are A, B, C and D and they are distinct. Now, arrangement of these
4 people in a circle (when clockwise and anticlockwise are different) can be shown as:

17
Thus, we have total 6 ways for circular arrangement (when clockwise and anticlockwise are
different) of four distinct people.
Also, we have n = 4. So, by definition, number of ways 4 distinct people can be arranged in
a circle (clockwise and anticlockwise are different) is equal to (n − 1)! = (4 − 1)! = 3! = 6.

3.5.2 Clockwise and anticlockwise are same

The number of ways n distinct objects can be arranged in a circle (clockwise and anticlockwise
(n − 1)!
are same) is equal to .
2
For Example:
How many ways can four people sit in a round table when clockwise and anticlockwise are
same?
Solution:
Consider four people are A, B, C and D and they are distinct. Now, arrangement of these
4 people in a circle (when clockwise and anticlockwise are same) can be shown as:

Thus, we have total 3 ways for circular arrangement (when clockwise and anticlockwise are
same) of four distinct people.
Also, we have n = 4. So, by definition, number of ways 4 distinct people can be arranged in

18
 (n − 1)! (4 − 1)! 3! 6
a circle (clockwise and anticlockwise are same) is equal to = = = = 3.
2 2 2 2

3.5.2.1 Examples of calculating n and r.

1. Find value of n if nP 4 = 20 nP 2 .
Solution:
We are given that, nP 4 = 20 nP 2
Now, apply the formula of permutation, we get
n! n!
= 20 ×
(n − 4)! (n − 2)!
1 1
=⇒ = 20 ×
(n − 4)! (n − 2)!
(n − 2)!
=⇒ = 20
(n − 4)!
(n − 2)(n − 3)(n − 4)!
=⇒ = 20
(n − 4)!
=⇒ (n − 2)(n − 3) = 20
=⇒ n2 − 5n + 6 = 20
=⇒ n2 − 5n − 14 = 0
=⇒ n2 − 7n + 2n − 14 = 0
=⇒ n(n − 7) + 2(n − 7) = 0
=⇒ (n − 7)(n + 2) = 0
=⇒ n = 7 or n = −2
As n cannot take negative values. Therefore, value of n = 7.
n
P4 5
2. If n−1= , then find the value of n.
P4 3
Solution:
We are given that,
n
P4 5
n−1 =
P4 3
 
n n−1 5
=⇒ P 4 = P4 ×
3
 
n! (n − 1)! 5
=⇒ = ×
(n − 4)! (n − 5)! 3

19
  
n × (n − 1)! (n − 1)! 5
=⇒ = ×
(n − 4) × (n − 5)! (n − 5)! 3
n 5
=⇒ =
(n − 4) 3
=⇒ 3n = 5n − 20
=⇒ 20 = 2n
=⇒ 2n = 20
=⇒ n = 10.
Hence, value of n is 10.

3. If 5P r = 2 × 6P r−1 , then find the value of r.

Solution:
We are given that,
5
P r = 2 × 6P r−1
5! 6!
=⇒ =2×
(5 − r)! (6 − (r − 1))!
5! 6!
=⇒ =2×
(5 − r)! (6 − r + 1)!
5! 6!
=⇒ =2×
(5 − r)! (7 − r)!
5! 6 × 5!
=⇒ =2×
(5 − r)! (7 − r) × (6 − r) × (5 − r)!
6
=⇒ 1 = 2 ×
(7 − r) × (6 − r)
=⇒ (7 − r) × (6 − r) = 2 × 6
=⇒ r2 − 13r + 42 = 12
=⇒ r2 − 13r + 30 = 0
=⇒ r2 − 10r − 3r + 30 = 0
=⇒ r(r − 10) − 3(r − 10) = 0
=⇒ (r − 10)(r − 3) = 0
=⇒ r = 10 or r = 3
Since r ≤ n, therefore r = 10 is eliminated and we get r = 3.

20
3.6 Unsolved Problems:
Q1. A teacher is creating a quiz paper of 11 questions from a test bank of 20 questions. In
how many ways can he select and arrange the questions?

Q2. A box contains 3 distinct white balls, 4 distinct black balls, and 3 distinct red balls.
Find the number of ways in which three balls can be drawn from the box so that all
the three drawn balls will have different colours.

Q3. In how many ways can we order (in line) the 26 letters of English alphabet so that no
two vowels (a, e, i, o, and u) occur consecutively ?

Q4. Find the number of rearrangements of the letters in the word “CRICKET”.

Q5. Seven people are going to sit at a round table. How many different ways can this be
done?
n+2
Q6. If P 3 = 6 × nP 1 , then find the value of n?

21
 Chapter : 4

4 Combination
4.1 Definition
The number of possible combinations of r objects from a collection of n distinct objects is
denoted by nC r and is given by
n n!
Cr =
r!(n − r)!
Another common notation is nr which is also referred to as the binomial coefficient.

Note: Number of possible combinations of r objects from a number collection of n distinct

object is denoted by nC r . Since, each combination of r objects from n objects give rise to
n
Pr n!
r! arrangements. So, nC r × r! = nP r =⇒ nC r = =⇒ nC r = which is the
r! r!(n − r)!
formula of nC r .
• Some useful results
n! n!
1. nC r = = = nC (n−r)
r!(n − r)! (n − r)!r!
In other words, selecting r objects from n objects is the same as rejecting n − r objects from
n objects.
2. nC n = 1 and nC 0 = 1 for all values of n.
3. nC r = n−1C r−1 + n−1C r ; 1 ≤ r ≤ n

4.1.0.1 Solved Examples:

1. How many ways can we select two students from a group of three students?
Solution:
Let A, B, and C be the three students. We can select AB, AC, BC or BA, CA, CB.
Both of the selections are same because in this case, the concern is only which of the
2 objects are chosen and not in the order in which they are chosen.
Thus, we have total 3 ways in which we can select two students from a group of three
students.
3!
Also, we can find the same by using combination formula as 3C 2 = = 3.
2! × (3 − 2)!
2. In an examination, a question paper consists of 12 questions divided into two parts i.e.,
Part I and Part II, containing 7 and 5 questions, respectively. A student is required to
attempt 8 questions in all, selecting at least 3 from each part. In how many ways can
a student select the questions ?
Solution:
We are given that a student has to attempt 8 questions in all and there are two parts,

22
 part I consists of 7 and part II consists of 5 questions.
Since, the condition is he has to choose at least 3 from each part. Therefore, he can
choose the questions in the following manner:
(i) 3 questions from part I and 5 questions from part II.
(ii) 4 questions from part I and 4 questions from part II.
(iii) 5 questions from part I and 3 questions from part II.
He cannot choose 6 questions from part I and 2 questions from part II because condition
will be violated.
Now,
(i) As 3 questions can be chosen out of 7 questions in 7C 3 ways and 5 questions can
be chosen out of 5 questions in 5C 5 ways. So, 7C 3 × 5C 5 is the total number of ways
in which student can choose 3 questions from part I and 5 questions from part II.
(ii) As 4 questions can be chosen out of 7 questions in 7C 4 ways and 4 questions can
be chosen out of 5 questions in 5C 4 ways. So, 7C 4 × 5C 4 is the total number of ways
in which student can choose 4 questions from part I and 4 questions from part II.
(iii) As 5 questions can be chosen out of 7 questions in 7C 5 ways and 3 questions can
be chosen out of 5 questions in 5C 3 ways. So, 7C 5 × 5C 3 is the total number of ways
in which student can choose 5 questions from part I and 3 questions from part II.
Total number of ways student can select questions is

= 7C 3 × 5C 5 + 7C 4 × 5C 4 + 7C 5 × 5C 3

           
7! 5! 7! 5! 7! 5!
= × + × + ×
3! × 4! 5! × 0! 4! × 3! 4! × 1! 5! × 2! 3! × 2!
= 35 + 175 + 210 = 420.

3(a). In how many ways you can choose 4 cards from a pack of 52 playing cards ?
Solution:
A ”standard” deck of playing cards consists of 52 Cards in each of the 4 suits of Spades,
Hearts, Diamonds, and Clubs. Each suit contains 13 cards: Ace, 2, 3, 4, 5, 6, 7, 8, 9, 10,
Jack, Queen, King. And, Hearts and Diamonds are red faced cards whereas Spades
and clubs are black faced card. Thus, there are 26 red cards and 26 black cards in a
pack of 52 cards. Also, Jack, Queen and King are known as face cards.
Now, we have to choose just 4 cards from a pack from 52 cards, without placing any
52!
other condition, which can be done in 52C 4 = = 270725 ways.
4! × 48!
3(b). In how many ways you can choose 4 cards from a pack of 52 playing cards if all four
cards are of same suit ?
Solution:
Since, selection of all four cards should be from same suit. Therefore, first we have to
choose one suit out of four suits and then, have to choose the 4 cards from that suit.
Now, we can choose one suit out of four suits in 4C 1 ways and within each suits we

23
 have 13 of each kind and we need to choose 4 cards from 13 cards and that can be
done in 13C 4 ways. So, the total number of ways we can choose all the 4 cards from
the same suits is 4C 1 × 13C 4 = 2860 ways.
3(c). In how many ways you can choose 4 cards from a pack of 52 playing cards if all four
cards are of same colour?
Solution:
As we know that there are cards of two colour (red and black) in a pack of 52 cards.
First, we have to choose 1 colour from 2 colours which can be done in 2C 1 ways. Now,
within each colour we have 26 cards and we need to choose 4 from each colour which
can be done in 26C 4 ways.
Hence, total number of ways in which we can choose 4 cards of the same colour are
2
C 1 × 26C 4 = 29900.
4. Select a cricket team of eleven from 17 players in which only 5 players can bowl. The
requirement is the cricket team of 11 must include exactly 4 bowlers. How many ways
can the selection be done?
Solution:
Total number of players available for selection is 17 in which 5 are bowlers. The
requirement is the there should be exactly 4 bowlers, so we need to select 4 bowlers
out of 5 which can be done in 5C 4 ways. Now, remaining 7 players can be selected
from remaining 12 players in 12C 7 ways.
Thus, total number of ways the selection can be done is 5C 4 × 12C 7 = 5 × 792 = 3960.

4.1.1 Drawing lines in a circle

Given n points on a circle, number of line segments that can be drawn connecting the points
is nC 2 .

1. If 2 points are given on a circle, then how many lines can be drawn connecting these
points ?
Solution:
We are given that 2 points on a circle, i.e, n = 2. So, number of line segments that
can be drawn connecting the points is 2C 2 = 1, which can be illustrated as follows:

24
 2. If 3 points are given on a circle, then how many lines can be drawn connecting these
points ?
Solution:
We are given that 3 points on a circle, i.e, n = 3. So, number of line segments that
can be drawn connecting the points is 3C 2 = 3, which can be illustrated as follows:

Note: The point to distinguish between situations involving combinations and situations
involving permutations is, we have to use Permutation when “order matters” and we have
to use Combination when “order does not matter”.

4.1.1.1 Some more solved examples on permutation and combination:

5(a). Consider the situation of eight athletes participating in a 100m race in a competition
with several rounds. How many different ways can you award the Gold, Silver, and
Bronze medals?
Solution:
Suppose 8 athletes are A, B, C, D, E, F, G and H. We have to award the Gold, Silver
and Bronze medals among these 8 athletes. Here order matters in awarding the medals.
Because, order of awarding Gold medal to A, order of awarding Silver medal to B and
order of awarding Bronze medal to C is different from order of awarding Gold medal
to C, order of awarding Silver medal to A and order of awarding Bronze medal to B.
So, we need permutation. Thus, number of ways in which we can award the Gold,
Silver, and Bronze medals is 8P 3 = 336.

5(b). Consider the situation of eight athletes participating in a 100m race in a competition
with several rounds. How many different ways can you choose the top three athletes
to proceed to the next round in the competition?
Solution:
We have to choose the top three athletes to proceed to the next round in the com-
petition. Now, suppose E, F and G are top three athletes then it does not matter
who came at first, second or third position. All three athletes will proceed to the next
round in the competition.

25
 Similarly, top three athletes can be D, G and H or A, E and F and so on. Hence, order
does not matter. So, we need to use combination.
Thus, number of ways in which we can choose the top three athletes out of eight
athletes is 8C 3 = 56.

6(a). Consider the situation of a class with forty students. In how many different ways can
we choose two leaders?
Solution:
We have to just choose two students out of 40 students for being leader. Here, order
is not important. So, we need to use combination.
Therefore, the number of ways in which we can choose two leaders is 40C 2 = 780.

6(b). Consider the situation of a class with forty students. In how many different ways can
we choose a captain and vice captain?
Solution:
We have to choose a captain and a vice captain. Here, order is important. So, we need
to use permutation.
Therefore, the number of ways in which we can choose a captain and vice captain is
40
P 2 = 1560.
• Important Note
Given n points on a circle, how many lines can be drawn connecting these points?
Solution:
1. If the segment has a direction line segment AB is different from BA. Order is
important. Hence, total number of ways is nP 2 .
Also, we can illustrate the same in figure as follows:

2. If segment has no direction. Line segment AB. Order is not important. Hence,
total number of ways is nC 2 .
Also, we can illustrate the same in figure as follows:

26
4.2 Unsolved Problems:
Q1. If nC 2 = nC 3 , then calculate the value of n?
Q2. Out of a group of six men and eight women, you need to form a committee of
three men and five women. In how many ways can the committee be formed?
Q3. Out of six consonants and four vowels, how many words of three consonants and
two vowels can be formed?
Q4. 20 points are chosen in the plane so that no three of them are collinear. How
many triangles do they determine?

27