MODULE 14 – PERMUTATION AND COMBINATION

1. A new flag is to be designed with seven vertical stripes using some or all of the colours yellow,
green, blue and red. Then, the number of ways this can be done such that no two adjacent stripes
have the same colour is:
(a) 36 x 81 (b) 16 x 192 (c) 20 x 125 (d) 24 x 216

Solution:
For the first vertical stripe we can use any of 4 colours, for the second we would have only 3 options,
same for the third to the seventh stripe. Hence, the required answer would be 4 x 3 x 3 x 3 x 3 x 3 x 3
= 36 x 81. Option (a) is correct.

2. In how many ways is it possible to choose a white square and a black square on a chess board so
that the squares must not lie in the same row or column?
(a) 56 (b) 896 (c) 60 (d) 768

Solution:
The white square can be selected in 32 ways and once the white square is selected 8 black squares
become ineligible for selection. Hence, the black square can be selected in 24 ways.
32 x 24 = 768. Option (d) is correct.
Alternatively
The white square can be chosen in 32 ways.
If we remove the row and the column which contains the chosen white square, we will be left with 7
Rows & 7 Columns containing a total of 49 squares (24 black and 25 white). We would have
removed 15 squares (7 white and 8 black)
Required ways = 32*24 = 768

3. In a question paper, there are three multiple-choice questions. Each question has six choices with
only one choice as the correct answer. What is the total number of ways in which a candidate will not
get all the three answers correct?
(a) 215 (b) 216 (c) 729 (d) 728

Solution:
6 = 216 would be the total number of ways in which the questions can be answered.
3

Out of these there would be only 1 way of getting all 3 correct. Thus, there would be 215 ways of not
getting all answers correct.

1
4. How many quadrilaterals can be formed from 20 points out of which 7 are collinear?
(a) 5206 (b) 2603 (c) 1198 (d) 4250

Solution:
Octal number of quadrilateral combination possible if none of points are collinear = 20C4 = 4845

If we form a geometry by joining any three points out of seven collinear points and one point from
16 non collinear points, it will give us a triangle instead of quadrilateral.
So we have to eliminate number of combinations which can be formed in this way, which is 7C3 *
16C1 = 35 * 16 = 560

We also can’t form a quadrilateral if we choose all four vertices of the quadrilateral to be any 4
points from 7 collinear points. It will come out to be a straight line. So we have to eliminate such
combinations also
Which is 7C4 = 35

So net number of possible quadrilaterals = 4845 – 560 – 35 = 4250

5. How many four digit numbers, which are divisible by 6, can be formed using the digits 0, 2, 3, 4,
6, such that no digit is used more than once and 0 does not occur in the left-most position?
(a) 10 (b) 50 (c) 25 (d) 100

Solution
We have to find the no. of four digit numbers which are divisible by 6 that are to be formed using the
digits 0, 2, 3, 4, 6.
We should know that 0 does not occur in the left most position. If the numbers are to be divisible by
6 it should be a multiple of 2 and 3.
So it should be an even number and also should be a multiple of 3.
⟹ 2 + 3 + 4 + 6 + 0 = 15
Here we have two choices, drop something such that the number should be a multiple of 3 or we can
drop a multiple of 3.
The following are the possibilities,
Drop 3 ⟹ 2 + 4 + 6 + 0 = 12 which is a multiple of 3.
Drop 6 ⟹ 2 + 3 + 4 + 0 = 9 which is a multiple of 3.
Drop 0 ⟹ 2 + 3 + 4 + 6 = 15 which is a multiple of 3.
We have to check the possible outcomes,
For 2 , 4 , 6 , 0 ⟹ 3 × 3 × 2 × 1 = 18 ways.
For 2 , 3 , 4 , 0 ⟹ 3 × 3 × 2 × 1 = 18 ways.
But out of these 18 outcomes there will be some possibilities where the last digit is 3.
4 such possibilities exist here which need to be eliminated.
Therefore 18 – 4 = 14 ways.
For 2, 3, 4 and 6 if we have the last digit as 3 i.e. _ _ _ 3, we can rearrange 2, 4 and 6 in 3! ways
Hence 2, 3, 4 and 6 can be arranged in 4! - 3! = 24 – 6 = 18 ways.
Therefore, in total we can form 18 + 14 + 18 = 50 four digit numbers.

6. Find the number of 6-digit numbers that can be formed using the digits 1, 2, 3, 4, 5, 6 once such
that the 6- digit number is divisible by its unit digit. (exclude the numbers ending in 1)
(a) 620 (b) 456 (c) 520 (d) 528

2
Solution:
The unit digit can either be 2, 3, 4, 5, or 6.

When the unit digit is 2, the number would be even and hence will be divisible by 2. Hence numbers
with unit digit 2 will be included which is equal to 5! or 120.

When the unit digit is 3, then in every case the sum of the digits of the number would be a multiple
of 3.

Hence all numbers with unit digit 3 will be divisible by 3 and hence be included. Total number of
such numbers is 5! or 120.

Similarly, for unit digit 5 and 6, the number of required numbers is120 each.
When the unit digit is 4, then the number would be divisible by 4 only if the ten's digit is even.
Total number of such numbers is 2 * 4! or 48.
Hence total number of required numbers is (4×120) + 48=528.

7. Find the sum of all 5 digit numbers formed by the digits 1, 3, 5, 7, 9 when no digit is being
repeated.
(a) 4444400 (b) 8888800 (c) 13333200 (d) 6666600

Solution:
Five numbers can be arranged in 5! = 120 ways
In which, the last digit can be 1, 3, 5, 7, 9
_ _ _ _ 1
_ _ _ _ 3
_ _ _ _ 5
_ _ _ _ 7
__ _ _9
Sum of all these 1 + 3 + 5 + 7 + 9 = 25
In 120 ways we have 24 sets which gives the sum as 25. Hence, 24 x 25 = 600.
So the unit place will be ‘0’ and 60 is carried to the ten’s place.
In ten’s place again we get a sum of 600 + 60 (carried from unit’s place) = 660. Hence, in ten’s place
we will have ‘0’ and 66 is carried to the hundred’s place.
In hundred’s place again we get a sum of 600 + 66 (carried from ten’s place) = 666. Hence, in ten’s
place we will have ‘6’ and 66 is carried to the thousand’s place and it continues.
Hence, the answer is option (d).

8. In a tournament, there are 43 junior level and 51 senior level participants. Each pair of juniors play
one match. Each pair of seniors play one match. There is no junior versus senior match. The number
of girl versus girl matches in junior level is 153, while the number of boy versus boy matches in
senior level is 276. The number of matches a boy plays against a girl is
(a) 1098 (b) 1024 (c) 125 (d) 1728

Solution
In a tournament, there are 43 junior level and 51 senior level participants.
Let 'n' be the number of girls at junior level. It is given that the number of girl versus girl matches in
junior level is 153.
 nC2 = 153

3
 n(n-1)/2 = 153
 n(n-1) = 306
n – n – 306 = 0
2

 (n + 17) (n+ 18) = 0

 n = 18 (rejecting n = -7)
Therefore, the number of boys on junior level = 43 - 18 = 25.
Let 'm' be the number of boys on senior level. It is given that the number of boy versus boy matches
in senior level is 276.
 mC2 = 276
 m = 24
Therefore, the number of girls at senior level = 51 - 24 = 27.
Hence, the number of matches a boy plays against a girl = 18*25+24*27 = 1098

9. If we have to make 7 boys sit with 7 girls around a round table, then the number of different
relative arrangements of boys and girls that we can make so that there are no two boys nor two girls
sitting next to each other is:
(a) 2 x (7!)
2
(b) 7! x 7! (c) 6! x 7! (d) None of these

Solution:
First step – arrange 7 boys around the table according to the circular permutations rule. i.e. in 6!
Ways.
Second step – now we have 7 places and have to arrange 7 girls in these places. This can be done in
P ways. Hence, the total number of ways = 6! x 7!
7
7

10. A tea party is arranged for 16 people along two sides of a long table with 8 chairs on each side.
Four people wish to sit on one particular side and two on the other side. In how many ways can they
be seated?
(a) 10C4 * 8! (b) 10P4 * 8! (c) 10C4 * 6C6 *8!*8! (d) 4!*2!*(8!)

Solution:
No of persons = 16
Condition on specific persons = 4 + 2 = 6
Remaining people = 16- 6 = 10
So, let's fill 8 people on both sides first from these 10.

First, we can select 4 out of 10.

10C4 * 6C6
Now we can arrange these 8 people on both sides in 8!*8!
Answer = 10C4 * 6C6 * 8! * 8!

11. A lady gives a dinner party to 5 guests to be selected from nine friends. The number of ways of
forming the party of 5, given that two particular friends A and B will not attend the party together is
(a) 56 (b) 126 (c) 91 (d) None of these

Solution:
Let the 9 friends be A, B, C, D, E, F, G, H and I respectively.
A and B do not attend the party together.
Total number of ways to select 5 from 7 = 7C5
= (7*6)/(2*1)

4
= 42/2
= 21 ways
Either of A or B is selected for party, then number of ways = 2C1*7C4
= (2*1)*(7*6*5)/(3*2*1)
= 420/6
= 70 ways
Total number of ways = 21 + 70
= 91 ways

12. While packing for a business trip Mr. Kapoor has packed 3 pairs of shoes, 4 pants, 3 half-pants,6
shirts, 3 sweaters and 2 jackets. The outfit is defined as consisting of a pair of shoes, a choice of
"lower wear" (either a pant or a half-pant), a choice of "upper wear" (it could be a shirt or a sweater
or both) and finally he may or may not choose to wear a jacket. How many different outfits are
possible?
(a) 567 (b) 1821 (c) 743 (d) 1701

Solution:
No of ways a pair of shoes can be selected=3C1 - 3 ways
No of ways lower wear can be selected= (3+4) = 7 ways
No of ways "upper wear" can be selected=3+6+3x6-27 ways
No of ways jacket can be chosen or not chosen-3 ways (No jacket, 1st jacket, 2nd jacket)
Total no of different outfits=3x7x27x3=1701 ways.

13. In how many ways can the letters of the word ‘SIMULTANEOUS’ be arranged such that
vowels are always together?
(a) 7!*6! / 2!*2! (b) 7!*6! (c) 6!*6! (d) 7!*6! / 2!

Solution:
The word ' SIMULTANEOUS ' has 12 letters.
It has the vowels 'O','I','A' ,’U’, ‘E’, ‘U’ in it and these 6 vowels should always come together. Hence
these 6 vowels can be grouped and considered as a single letter.
That is, SMLTNS(IUAEOU).

Hence we can assume total letters as 7 and all these letters are different.
Number of ways to arrange these letters
=7!

All the 6 vowels (OIAUEU) are different

Number of ways to arrange these vowels among themselves
=6!
And 2 letters are repeating twice( S and U)
Hence, required number of ways
= 7!*6! / 2!*2!

14. Find the rank of the word MOTHER in dictionary format.

(a) 306 (b) 307 (c) 308 (d) 309

Solution:
Arrange all the alphabet of word MOTHER in alphabetical order like [E, H, M, O, R, T]

5
Now, strike off the first letter M from [E, H, M, O, R, T]
Then count the no. of letters before M, and it is equal to 2, which is 5!
Now, net word O,
Then, count the no. of letter before O and it is equal to 2, which is coefficient of 4!
Next letter T → 3!
Next letter H → 2!
and nett letter E → 1!
So, Rank of the word is
=2(5!) + 2(4!) + 3(3!) + 1(2!) + 0(1!) + 1
=240 + 28 + 18 + 2 + 1
=309
The word MOTHER is 309.

15. The letters of the word HASTE are written in all possible orders and these words are written out
as in the dictionary. Then the dictionary rank of the word HEATS is:
(a) 56 (b) 57 (c) 38 (d) 39

Solution:
The letters available to us are:
A, EH, S and T in their alphabetical order. When we form 5 letter words out of these, the following
order of appearing in the dictionary would hold…
Words starting with A…..4! = 24
Words starting with E……4! = 24
Words starting with HA…. 3! = 6

Words starting with HE …..complete description:

First word: HEAST,
Second word = HEATS
Hence, the 56th word in the list would be HEATS

HOMEWORK:
1. In how many ways can 7 identical erasers be distributed among 4 kids in such a way that each kid
gets at least one eraser but nobody gets more than 3 erasers?
(a) 20 (b) 14 (c) 15 (d) 16

Solution:

Each kid gets at least one eraser. There are 7 eraser & 4 kids, so we can give 4
erasers to 4 kids remaining erasers are 3

They can be distributed in two ways

First: Each kid can get 1 eraser

4
c = 4 ways
3

Second: One kid gets 2 eraser and remaining one eraser give to another kid
c x 3c = 12 ways
4
1 1

6
Total number of ways = 4 + 12 = 16

The required result will be 16.

2. In how many ways can 10 identical presents be distributed among 6 children so that each child
gets at least one present?
(a) 15C5 (b) 16C6 (c) 9C5 (d) 6 10

Solution:
The question says that each child must get at least one present.
So, let's start by giving one present to each child. Number of presents remaining
 10 - 6 = 4.

Now we need to count the ways to distribute 4 presents among 6 children.

We can use the formula = (n + r - 1) C (r-1) where n = 4 and r = 6
that gives us: (4 + 6-1) C (6-1)
= 9C5

3. How many integers, greater than 999 but not greater than 3000, can be formed with the digits 0, 1,
2, 3 and 4 if repetition of digits is allowed?
(a) 376 (b) 375 (c) 250 (d) 251

Solution:

First place can be filled by 2 ways = 2

Remaining places can be filled by any of 5 digits

= 2 * 5 * 5* 5 + 1= 251

4. There are 5 managers, 8 team leaders, and 7 daily wagers in a chess club. A group of 6 employees
will be chosen to compete in a competition. How many combinations of employees are possible if
the group is to consist of exactly 3 managers?
(a) 5000 (b) 4550 (c) 4000 (d) 3550

Solution:
Here we need the no of possible combinations of 3 out of 5 managers, 5C3, & no of possible
combinations of 3 out of the 15 team leaders & daily wagers, 15C3; Note that we want 3 managers &
3 employees from other classes; Therefore, we multiply the no of possible groups of 3 of 5 managers
times the no of possible groups of 3 of the 15 students from other classes;
5C3 * 15C3 = 4,550

5. What is the rank of the word PRIME, if the letters are rearranged and ordered as they are in the
dictionary such that each letter is used only once.
(a)93 (b)92 (c) 94 (d) 95

7
Solution:
The word 'PRIME' has 5 letters in which no letters are repeated.
Number of words starting with E = 4!=24
Number of words starting with I = 4! = 24
Number of words starting with M = 4! = 24
Number of words starting with PE = 3! = 6
Number of words starting with PI = 3! = 6
Number of words starting with PM = 3! = 6
Number of words starting with PRE = 2! = 2
Number of words starting with PRIE = 1! = 1
Next word is 'PRIME'. Therefore, rank = 24 + 24 + 24 + 6 + 6 + 6 + 2 + 1 + 1 = 94