Maths Short Notes For NDA

By : Arpit Choudhary

Join Free Telegram Channel For More Content

 Permutation &
Combinations
Short Notes For NDA
By : Arpit Choudhary
Join Free Telegram Channel For More Content
 Chapter 1.4
Permutation and Combination
(a) Fundamental Principle of Counting or Multiplication Principle
If an event occurs in m distinct ways following which a second event occurs in n distinct ways, then the
two together will occur in mn ways in the given order.
(b) Addition Principle
If an operation can be performed in m different ways and if another operation can be performed in n
different ways and the two operations are mutually exclusive, then either of the two operations can be
performed in (m + n) different ways.

Permutations
The number of ways of arranging n distinct objects in a row taking r (0  r  n) of them at a time is
denoted by n pr and its value is given by
n!
n
pr 
 n  r !
Note that
n
P0  1, n P1  n, n Pn 1  n Pn  n !
Circular Permutations
The number of ways of arranging n distinct objects along a circle is(n — 1)!
Note that even if one object is lying on the circle, then the circle has to be treated as a row so far as arranging of
objects is concerned along it.

Permutation of n objects out of which some objects are identical

If out of n objects a are exactly identical and are of one kind, b are exactly identical and are of a second kind,
n!
and so on, then the number of ways of permuting the n objects is given by
a !b !
Combinations
The number of ways of selecting  0  r  n  objects out of n distinct object is denoted by n
Cr and its value is
n!
given by nCr ’
r ! n  r  !
Note that;
(i) n
C0  1, nCn  1, nC1  n.
(ii) n
Cr  nCn r 0  r  n
(iii) n
Cr 1  nCr  Cr 1  r  n
n 1

(iv) n
Cx  Cy n
implies, x = y or x + y = n
n
(v) If n is even, then the greatest value of n
Cm ' where, m  ,
2
n 1 n 1
(vi) If n is odd, then the greatest value of n
Cm ' where, m  , or m  .
2 2
More results
1. The number of straight lines formed by n points, no three of which are collinear except for m of them which lie on a
line is n C 2  m C 2  1.
2. If no three points are collinear, then the number of lines formed is n C 2 .
n (n  3)
3. The number of diagonals of a convex polygon of n vertices is n C 2  n =
2
4. The number of triangles formed by n points, no three of which are collinear is n C 3
5. If out of n points, no three are collinear except for m of them which lie on a line, the number of triangles formed is
n
C3  m C3
n m
6. The number of combinations of n things, taken r at a time, with m particular things excluded is C r , and
n m
included is Cr m .
7. The number of ways of answering one or more of n questions = 2 n  1
8. The number of ways of answering one or more of n questions with an alternative (as true or false) is 3n  1.
n   n 
9. The maximum power of a prime p in n! =     2   ......... where [x] = greatest integer less than or equal to x.
 p   p 
10. The number of divisors of a natural number, n = 2a.3b.5c.7d......... is
2a1  1 3b1  1 5 c 1  1
(a + 1) (b + 1) (c + 1) (d + 1)…and the sum of divisors =    ...
2 1 3 1 5 1

Examples
1. A man invites 15 guests to a dinner and places 8 of them at one table and remaining 7 at the other, the
tables being round. The number of ways he can arrange the guests is.

11!
(a)
40

15!
(b)
56

24!
(c)
40

21!
(d)
32
Answer: (b)
Explanation:
The number of ways in which 15 guests may be divided into groups of 8 and 7 = 15C7  15!
7!8!
Now, corresponding to one such group, the 8 guests may be seated at one round table in (81)! i.e., 7! ways
and the seven guests at the other table in (71)! i.e., 6! ways.
But each way of arranging the first group of 8 persons can be associated with each way of arranging
the second group of 7, therefore, the two processes can be performed together in 7! × 6! ways.
Hence required number of arrangements
15! 15! 7! 6! 15!
  7! 6!  
7!8! 7.6!8.7! 56

2. If there are 16 persons in a party, and if each of them shakes hands with each other, then
number of handshakes happen in the party is

(a) 166

(b) 148
 (c) 172

(d) 120
Answer: (d)
Explanation:
Total number of handshakes = The number of ways of selecting 2 persons from among 12 persons
16 15
 16C2   120
2 1

3. Four boys and four girls are to be seated around a table, in a circle. Among them, the boy P,Q does
not want any girl neighbor and the girl R,S does not want any boy neighbor. The number of such
arrangements possible is

(a) 4

(b) 6

(c) 8

(d) 2
Answer: (a)
Explanation:
1,2 ,P and Q are the four boys and 3,4, R and S are four girls, Boy P,Q will have neighbors as boys 1 and 2
and the girl R and S will have neighbors as girls 3 and 4. 1 and 2 can be arranged in P (2, 2) ways=2! = (2×
1)= 2ways.
Also, 3 and 4 can be arranged in P (2, 2) ways = 2! = 2 ×1 = 2 ways.
Hence required no. of permutations = 2 × 2 = 4.

4. There are 8 lights in a auditorium. Each one of them can be switched on independently. The
number of ways in which the auditorium can be illuminated is

(a) 312

(b) 224

(c) 255

(d) 513
Answer: (c)
Explanation:
Each light has two choices, either switched on or off
 Required number of ways = 2 8 1 = 2561 = 255
[Since in one way when all are switched off, the hail will not be illuminated].

5. A telegraph has 6 arms and each arm is capable of 5 distinct positions, including the position of rest. The
total number of signals that can be made is

(a) 15624

(b) 3124
 (c) 124

(d) 624
Answer: (a)
Explanation:
Each arm can be set in 5 ways.
six arms can be set in 5×5×5×5×5×5 ways.
But this includes the way when all the arms are in the position of rest, when no signal is sent.
Hence, required number of signals =5 61 = 156251 = 15624.

6. The number of ways in which Four 10-paise, three 20-paise, three 25-paise and two 50-paise coins
can be distributed among 12 children so that each child gets only one coin, is

(a) 11880

(b) 11680

(c) 11570

(d) 11410
Answer: (a)
Explanation:
Total no. of coins = 4 + 3 + 3 + 2 = 12.
4 coins are 10 paise, 3 are 20 paise, 3 are 25 paise and 2 is of 50 paise.
Required no. of ways =12C 4 =12×11×10×9=11880.

7. There are six Players. Out of them two are cricket players, two are Hockey players and two volleyball
players. They are to stand in a row, so as the cricket players, hockey players and volleyball players are
always in a set. The number of ways in which they can do so, is

(a) 48

(b) 36

(c) 42

(d) 24
Answer: (a)
Explanation:
There are 2 cricket players. They can stand in a row in P(2,2) = 2!
= 2 × 1 ways = 2 ways.
There are 2 hockey players. They can stand in a row in P(2,2) =2! = 2 × l ways = 2 ways.
There are 2 volleyball players. They can stand in a row in P(2,2) = 2! = 2 × l ways = 2 ways.
These three sets can be arranged in themselves in =3! =3×2× 1 = 6 ways.
Hence the required number of ways = 2 × 2×2× 6 = 48.
 8. A 'Letter Lock' contains 6 rings each marked with three different letters. The number of all
possible unsuccessful attempts to open the lock is

(a) 243

(b) 729

(c) 281

(d) 342
Answer: (b)
Explanation:
Number of options on 1st Ring = 3
Number of options on 2nd Ring = 3
Number of options on 3rd Ring = 3
Number of options on 4th Ring = 3
Number of options on 5th Ring = 3
Number of options on 6 th ring = 3
Total number of options/arrangements = 3 × 3× 3×3×3 ×3 = 729

9. If each of 12 points on a straight line be joined to each of 12 points on a parallel line then the total
number of triangles that can be formed with the given points as vertices, is

(a) 1748

(b) 1656

(c) 1524

(d) 1452
Answer: (d)
Explanation:
A triangle is formed for each selection of 2 points from one line and 1 point from the other line.
 The number of triangles
 12C2  12C1  12C1  12C2
12 11 12 11
 11  11  66 11  11 66  1452
2 2

10. A boat is to be manned by ten men of whom 3 can only row on bow side and 1 can only row on stroke
side; the number of ways in which the crew can be arranged is

(a) 240 × 6!

(b) 124 × 5!

(c) 300 × 6!

(d) 342 × 4!
Answer: (c)
Explanation:
3 men on the bow side can be arranged in 5P2 ways = 60 ways
1 men on the stroke side can be arranged in 5P1 ways = 5 ways
Remaining 6 men can be arranged in 6! Ways
number arrangements of the crew = 60 × 5 × 6!
= 300 × 6!

11. A family consists of grandmother, 6 sons and daughters and 10 grandchildren. They are to be
seated in a row for dinner. The grandchildren wish to occupy the 5 seats at each end and the
grandfather refuses to have a grandchild on either side of him. The number of ways in which the family
can be made to sit is

(a) 113600

(b) 432000

(c) 215300

(d) 354600
Answer: (b)
Explanation:
The total number of seats = 1 grandmother + 6 sons and daughters + 10 grandchildren = 17
The grand children wish to occupy the 5 seats on either side of the table = 5! ways
= 120 ways
and grandmother can occupy a seat in (61) ways = 5 ways
(Since 5 gaps between 6 sons and daughters)
and the remaining seats can be occupied in 6! ways
= 720 ways (6 seats for sons and daughters)
Hence, required number of ways
= 120 × 5 × 720 = 432000

12. The number of ways in which a mixed doubles game in tennis can be arranged from 7 married couples,
if no husband and wife play in the same game, is

(a) 446

(b) 454

(c) 460

(d) 420
Answer: (d)
Explanation:
Let the sides of the game be A and B.
Given 7 married couples, i.e., 7 husbands and 7 wives. Now, 2 husbands for two sides A and B can
be selected out of 7 = 7C2 = 21 ways.
After choosing the two husbands their wives are to be excluded (since no husband and wife play in
the same game). So we are to choose 2 wives out of remaining 7  2 = 5 wives, i.e., C2= 10ways.
5

Again two wives can interchange their sides A and B in 2! = 2 ways.

Therefore, the required number of ways =21 × 10 ×2 = 420.
 13. Five girls picked up 40 apples The number of ways in which they can divide them if all apples be
identical, is

(a) 113452

(b) 134562

(c) 135751

(d) 124614
Answer: (c)
Explanation:
Clearly, 40 apples can be distributed among 5 girls such that each girl can receive any number of apples.
Hence total number of ways= 40 + 51C5 1 = 44 C4
44  43  42  41
  135751
4  3  2 1

14. In a tournament where the participants were to play one game with another, two players fell ill, having
played 3 games each. If the total number of games played is 126, the number of participants at the
beginning was

(a) 18

(b) 15

(c) 17

(d) 16
Answer: (a)
Explanation:
Suppose the two players did not play at all so that the remaining (n  2) players played n2C
2 matches. Since
these two players played 3 matches each, hence the total number of matches is
n1
C2 + 3 + 3 = 126 (given)
 n  2 n  3
or  120 or n 2  5n  6  240
1.2
or n2  5n  234  0 or  n 18 n 13  0
  n = 18  n  13

15. Given 6 different green marbles, 4 different Orange marbles and 3 different red marbles, the number
of combinations of marbles that can be chosen by taking at least one green and one orange
marbles is

(a) 2480

(b) 7560
 (c) 3720

(d) 4650
Answer: (b)
Explanation:
Number of ways of selecting at least one green marble out of 5 different green marbles
6
C1 + 6C2 + 6C3 + 6C4 + 6C5 +6C6= 26  1
Also, at least one Orange marbles can be selected out of 4 Orange marbles in
4
C1 + 4C2 + 4C3 + 4C4 = 24  1
Again, 3 different red marbles can be selected in
3
C0+ 3C1 + 3C2 + 3C3 = 23 ways
Required ways = (26 1) (24 1) (23)
63 × 15 × 8 = 7560

16. Out of 24 points in a plane no three are in the same straight line except seven points which
are collinear. The number of straight lines that can be formed joining them is

(a) 2243

(b) 244

(c) 253

(d) 256
Answer: (d)
Explanation:
The number of Straight lines
= 24C2  (7C2 1) = 276 (211) = 276  20 = 256.

p
17. If A = number of distinct rational numbers (0,1) such, that p, q  (1,2,3,4, 5} and B= number of
q
mappings from (1,2,3,4) onto {l,2},then AB is

(a) 5

(b) 5

(c) 0

(d) 1
Answer: (b)
Explanation:
p
Here   0,1
q
p 1 1 1 1 2 2 3 3 4 
   , , , , , , , ,  = 9 values
q 2 3 4 5 3 5 4 5 5
A= 9
Now, B = 242= 14
A  B = 914 = 5

18. If ten coordinators are to address a meeting then the number of ways in which a specified coordinator is
to speak before another specified coordinator, is

(a) 1403200

(b) 1814400

(c) 1201600

(d) 1524300
Answer: (b)
Explanation:
Let A, B be the two corresponding coordinator. Without any restriction the ten coordinator can be arranged
among themselves in 10! ways, but the number of ways in which A speaks before B and the number of
ways in which B speaks before A make up 8!. Also number of ways in which A speaks before B is
exactly same as the number of ways in which B speaks before A. the required number of ways
1 3628800
 10!   1814400
2 2

19. The number of ways of selecting 10 marbles from the unlimited number of orange, black, white and
blue marbles, if selection must include 2 orange and 3 blue marbles, is

(a) 36

(b) 56

(c) 112

(d) 28
Answer: (b)
Explanation:
Number of 10 marbles selections
= coefficient of x10 in (x2 + x3 + ...) (1+ x + x2 +...)
1  x  x 2
 ... x 3  x 4  ...

= coefficient of x5 in 1  x  x 2  ....
4

= coefficient of x5 in (1 x)-4
 4  5 1 8! 8 7  6
 C5  8C5    56 ways
3! 5! 3  2 1

20. If a represents the number of permutations of (x + 2) things taken together, b represents the
number of permutations of 18 things taken together out of x things, and c represents the
number of permutations of(x 18) things taken together so that a = 342bc,then x=
 (a) 15

(b) 17

(c) 19

(d) 18
Answer: (b)
Explanation:
x2
a Px  2 , b  x P18 , C  x 18 Px 18
x!
 a   x  2 !, b  , c   x  18 !
 x  18!
Now, a  342bc
x!
  x  2 !  342  x  18!
 x  18!
  x  2 x  1 x!  342x!
  x  2 x  1  342  19 18
 x  1  18
 x  17