PERMUTATION & COMBINATIONS

HINTS & SOLUTIONS TO ASSIGNMENT PROBLEMS (SUBJECTIVE)

Level - I

1. Since four particular guest sit on one side and three other an other side so remaining 11
are divided into two groups of 5 and 6 in 11C5 ways
Hence total number of arrangements = 11 C5  9! 9! .

2. Let the stations in between A and B be H 1, H2, ….., H10.

The person taking the train from the station H i (1 £ i £ 10) can get down any of the next
(11 – i) stations.
10
Total number of possible tickets =  (11  i)  10  9  8  .....  1  55 .
i1

The nine different tickets must be out of these 55 tickets. Therefore the required number
of ways = 55C9.

3. Choosing r balls from one of the bags can be done in mCr ways. Then choosing r balls
from the other bag also can be done in mCr ways.
Thus, the total number of ways of choosing at least one ball from both the bags is
m m

     
m
2
m
2
m
2 2n!
Cr  Cr C0  2n Cn  1   1.
r 1 r 0
n! n!

4. Here we have to fill three places

First place can be filled by numbers 1, 2, ….7, second by I II III
2, 3, ….8 and third by 3, 4,….9. i.e. the number of ways of
filling each place is seven but total number of ways is not 777= 343. Reason behind
this is that corresponding to 1 at first place, second place can be filled up by anyone of
seven digits 2–8 but when we put 2 at first place, the number of ways of filling second
place is only six. So the number of ways of doing each part is not independent. So rule
of product is not applicable in this case. The right approach for this problem is that first
select three distinct non-zero digits which can be done in 9C3 ways, then arrange them in
increasing order which can be done in one way only. Therefore, the required number of
natural numbers is 9C3  1 = 84.

5. (i) The number of words that can be formed is equal to the number of ways of filling the four
places.
Places: 1 2 3 4
5 4 3 2 Number of Choices:
Þ 5´4´3´2=120 words can be formed when repetition is not allowed.
(ii) The number of words that can be formed is equal to the number of ways of filling the
four places.
 2 RSM-78-P4-MA-PC(H&S)

Places: 1 2 3 4
5 5 5 5 Number of Choices:

First place can be filled in 5 ways. If repetition is allowed, all the remaining places can be
filled in 5 ways each.
Þ 5´5 ´ 5 ´ 5 = 625 words can be formed when repetition is allowed.

6. x1 < x2 £ x3 < x4 < x5 £ x6.

It will gives rise to following four case
(i) x1 < x2 < x3 < x4 < x5 < x6 Þ 9C6 ways
(ii) x1 < x2 = x3 < x4 < x5 < x6 Þ 9C5 ways
(iii) x1 < x2 < x3 < x4 < x5 = x6 Þ 9C5 ways
(iv) x1 < x2 = x3 < x4 < x5 = x6 Þ 9C4 ways
Therefore total number of such numbers is equal to
9
C6 + 9C5 + 9C5 + 9C4 = 11C6.

7. A natural number which is smaller than 2.10 8 and which can be written by means of the
digits 0, 1 and 2 is of the form a1 a2 … a9 where 0 £ a1 £ 1 and 0 £ ai £ 2 for i = 2, 3, ….,9
and where all a1, a2, …, a9 cannot be equal to zero.
We can choose a1 in two ways (0 or 1) and a i for i = 2, 3,…, 8 in three ways
(0, 1 or 2). After choosing a 1, a2, …. , a8 we find the sum s = a 1 + a2 + …+ a8 is of the form
3m – 2, 3m – 1 or 3m. We can now choose a9 in just one way.
Infact a9 = 2, 1 or 0 depending on whether S = 3m – 2, 3m – 1 or 3m. Therefore, we can
choose the numbers in (2) (37) (1) ways. But this includes a choice in which each of ai= 0.
Thus, the required number of numbers = (2) (37) (1) – 1 = 4373.

8. (a) There are 8 places to be filled.

First place can not be filled by 0. I.e. First place can be filled in 7 ways. 2 nd place can be
filled either by the 6 remaining digits or by 0 i.e. in 7 ways. 3 rd place can be filled in 6
ways (by the 6 remaining digits) and so on.
7 ´ 7 ´ 6 ´ 5 ´ 4 ´ 3 ´ 2 ´ 1 = 7 ´ 7!
Alternative:
Total no. of possible permutations = 8! Of these, there are some permutations in which 0
comes in the first place i.e. they are actually 7 digit numbers. No. of such permutations =
1 ´ 7! (there is only 1 choice for the first place i.e. 0)
So that no. of 8-digit numbers = 8! - 7! = 7! (8 - 1) = 7 ´ 7!
(b) Even nos. can be categorised into two categories.
(i) Last digit is 0. For the remaining 7 digits, there are 7 choices
Þ 7! ways.
(ii) Last digit is not 0. For the last place, there are 3 choices i.e. 2, 4 and
9. First zebra can been seen or not seen i.e. 2 ways
2nd zebra can been seen or not seen i.e. 2 ways and so on.
RSM-78-P4-MA-PC(H&S) 3

\ No. of ways = 2 ´ 2 ´ 2 ´…. for 25 zebras = 225

similarly for giraffes, 214 ways are there
similarly for lions, 216 ways are there
similarly for tigers, 22 = 4 ways are there
of these 4 ways, we must subtract that case in which the tourist sees no tigers.
No of ways = 22 – 1 = 3 ways
total no. of ways = 225, 214, 216, 3 = 3. 255
Alternative:
Tourist can seen either none or one or two .….
or all 25 zebras. And similarly for other animals.
\ Required w of ways = (25C0 + 25C1 + 25C2 + …. 25C25)
(14C0 +14C1+…. +14 C14)(16C0+16C1+….+16C16)(2C1+2C2)=225. 214. 216 . 3 = 3. 255

10. The letter ‘a’ can take any position from 1 to 18. Corresponding to these positions of ‘a’,
‘b’ can take positions from 9 to 26. Also position of ‘a’ and ‘b’ can be interchanged. Rest
24 letters can be arranged in 24! ways.
so, required numbers of ways = 18 ´ 2 ´ 24 ! .

11. Required number of ways will be same as number of derangements of four objects=
 1 1 1 1 1 1 1 
4 !  1      = 24     =9.
 1! 2! 3! 4!   2 6 24 

12. Case - I: We select one question each from two sections and three questions from one
section.
Required number of ways = 4C1 ´ 4C1 ´ 4C3 ´ 3 = 192
Case – II: We select two questions each from two sections and one question from third
section.
Required number of ways = 4C1 ´ 4C2 ´ 4C2 ´ 3 = 432
Total number of ways = 192 + 432 = 624.

13. Three integers can be selected from the integers 1, 2, …, 1000 in 1000C3 ways . Now sum
of these integers will be one of the forms 4k, 4k+1, 4k+2, 4k +3. Now out of these 1000
integers, exactly 250 of them belong to each of the group 4k, 4k+1, 4k +2, 4k +3.
Therefore, because of the symmetry of the problem, number of selections of three
1
integers such that their sum is divisible by 4 = , 1000C3 ways = 41541750.
4
Alternative:
Three selected integers will belongs to one of these following cases:
Case – I: All the three integers are of the form 4k
No of possible selections = 250C3
Case – II: Integers are of the form 4k, 4k +1, 4k+3.
No of possible selections = 250C1 ´ 250C1 ´ 250C1
Case – III: Integers are of the form 4k, 4k +2, 4k + 2 = 250C1 ´ 250C2
4 RSM-78-P4-MA-PC(H&S)

Case –IV: Integers are of the form 4k + 1, 4k + 1, 4k +2 = 250C2 ´ 250C1

Case – V: Integers are of the form 4k +2, 4k + 3, 4k +3 = 250C2 ´ 250C1
Total number of ways = 250C3 + (250C1)3+ 3´ 250C1 ´ 250C2 = 41541750.

14. Let the n different things be a 1, a2,…..,an. Suppose that a1 is taken first. If the second one
to be selected is either a3 or an –1, then the third can be selected in (n –5) ways. If the
second object selected is any of the remaining (n –5) objects, then the third can be
selected in (n –6) ways. Thus, the number of ways of selecting 3 things (in order first,
second and third) with a1 as the first is 2(n – 5) + (n – 5)(n – 6) = (n – 4)(n – 5).
The number of ways remains unchanged if any other object is taken as the first.
Therefore, the number of ways of choosing 3 objects when the order is immaterial is
1 1
n  n  4  n  5  n  n  4   n  5  .
3! 6
Alternative:
We can choose the first object in nC1 = n ways. The number of ways of choosing two of
the remaining two objects so that they are not together is

 n3
 1
C2   n  4    n  4   n  5  .
2
Since these two objects can be arranged in 2! Ways, the number of ways of choosing
1
three objects (in order first, second and third) is n.  n  4   n  5  2  n  n  4   n  5  .
2
Since the order in which the objects are taken is immaterial, the number of ways of
1
choosing the objects is n  n  4   n  5  .
6

Part Max. Marks Marks Secured

1 10 x1
2 10 x2
3 10 x3
4 20 x4
Where 0 £x1 £ 10, 0 £ x2 £ 10
0 £ x3 £ 10, 0 £ x4 £ 20
\ No. of ways in which the candidate can get 30 marks
= Coefficient of x30 in the expression
3
 1  x11   1  x 21 
(x° + x1 + x2 + …+ x10)3 (x° + x1 + x2 + … + x20)= Coefficient of x30 in    
 1 x   1 x 
= Coefficient of x30 in (1 – x11)3 (1 – x21) (1 – x)-4
= Coefficient of x30 in (1 – 3x11 + 3x22) (1 – x21) (1 – x)-4
= Coefficient of x30 in (1 – 3x11 + 3x22 – x21) (1 – x)-4
 4  30  1 !  4  19  1 !  4  8  1 !  4  9  1 !
= + (-3) + (3) + (-1) = 1111.
 30  !  4  1 !  19  !  4  1 ! 8!  4  1 ! 9!  4  1 !
 RSM-78-P4-MA-PC(H&S) 5

Level – II

1. The number of selections of r objects from n identical objects and (n - r) objects from 2n
different objects is 1  2n Cnr  2n Cnr
n
So required number of selections  
r 0
2n
Cn r

2n
1

1
2
 2n

C0  2n C1  ...2n Cn 
Cn
2
 22n1 
2
2n
Cn .

2. Let abcde be the required odd integers. a can be chosen from 3, 4, 5, 6 and 7 and e can
be chosen from 1, 3, 5, 7, 9. Here 3, 5 and 7 can occupy both the positions a and e.
So, let us consider the case where one of 3, 5, 7 occupies the position a.
Case I: If a gets one of the values 3, 5, 7, then there are three choices for a, but then e
has just four choices as repetition is not allowed. Thus, a and e can be chosen in this
case in 3 ´ 4 = 12 ways.
The 3 positions b, c, d can be filled from among the remaining 8 digits in
8 ´ 7 ´ 6 ways. Total number of ways in this case = 12 ´ 8 ´ 7 ´ 6 = 4032.
Case II: If a takes the values 4 or 6, then there are two choices for a and there are five
choices for e.
There are again eight choices altogether for the digits b, c, d which could be done in 8 ´ 7
´ 6 ways. Therefore in this case, the total numbers are
2 ´ 5 ´ 8 ´ 7 ´ 6 = 3360.
Hence total number of odd numbers between 30000 and 80000 without repetition of
digits are 4032 + 3360 = 7392.

3. CALCUTTA has letters CC, AA, TT, U,L. There are different number of cases where 3
letter words can be formed.
I. 3 alike NOT POSSIBLE.
II. 2 alike, 1 different.
III. 3 different.
For case (II), the number of ways it can be done is 3C1 4C1, since there are 3 pairs of
identical letters and 2 other different letters. Now, these 3 letters can be arranged in 3!/2!
ways since 2 of them are identical. Hence, the total number for case (II) is
3
C1. 4C1. (3!/2!) = 36.
For case (III), the number of ways we can choose 3 different letters from 5 different
letters is 5C3. These 3 letters can be arranged in 3! Ways, so that the number of ways =
5
C3. 3!=60
Hence the total number of letters that can be formed =36+60 = 96

4. (i) The number of ways to select any number of mangoes

5 C0 5 C1 5 C2  ..... 5 C5  25
The number of ways to select any Number of apples
 4 C0  4 C1  .....  4 C4  24
Required no of ways to select fruits 25  24  1  29  1
(ii) The required number of ways = (5 + 1) (4 + 1) - 1 = 29
6 RSM-78-P4-MA-PC(H&S)

5. Digits that can be read up side down on the screen of the calculator are 0, 1, 2, 5, 6, 8
and 9 .
Now all one digit numbers that can be read up side down = 7.
2 digit numbers that can be read up side down
= 6.6 =62 ( as we can’t use 0 at the beginning or at the end)
3 digit numbers that can be read up side down =6.7.6 = 7.6 2
4.digit numbers that can be read up side down = 6.7.7.6 = 6 2 . 72
5 digit numbers that can be read up side down = 6.7.7.7.6 = 6 2. 73
6 digit numbers that can be read up side down = 6. 74.6 = 62 . 74
7. digit numbers that can be read up side down = 6.7 5.6 = 62 . 75
8. digit numbers that can be read up side down = 6.7 6.6 = 62 . 76
Thus the numbers of required numbers
= 7+62 + 7.62 + 62. 72 + 62. 73 + 62 . 74 + 62 . 75 +62 . 76
2  7  1
7
2
 2 3 4 5 6
= 7  6 1  7  7  7  7  7  7 = 7  6   7  1
 = 7 + 6.77 – 6 = 6.77 + 1.
 

6. Let x1  y1  1, x 2  y 2  2,......xk  yk  k
Putting these in given equation
 y1  1   y 2  2   ....  yk  k   n
k  k  1
or y1  y 2  ......yk  n 
 m (say)
2
So we have to find non-negative integral solution. Which mk 1 Ck 1 where
k  k  1
m n
2

7. Here we apply principle of inclusion and exclusion. So total numbers

= 46  4 C1  36  4 C2 26  4 C3  16 .

8. Let there are r seats between A and B, p seats between B and C and 2n – r – p seats
between A and C.
total number of ways of seating arrangements when there is no restriction = 2n!
now we count the cases when two particular persons sit together.
Number of ways in which two persons sit together between A and B = (r – 1)2
Number of ways in which two persons sit together between B and C = (p – 1)2 and
between A and C these ways are (2n – r – p – 1)2 so total number of ways of their sitting
together
= 2(2n – r – p – 1 + r – 1 + p – 1) = 2(2n – 3)
with each of such cases remaining persons can sit in (2n – 2)! ways.
So total number of cases = (2n – 3)2(2n – 2)!
The number of cases in which two particular persons does not sit together
= 2n! – 2(2n – 3) (2n – 2)! = (4n2 – 6n + 6) (2n – 2)!

9. Let n (A) = number of positive divisors of 1060 = 260 ´ 560 is 612.

Let n (B) = number of positive divisors of 2050 = 2100 ´ 550 is 101 ´ 51 and
Let n (C) = number of positive divisors of 3040 = 240 ´ 340 ´ 540 = 413
RSM-78-P4-MA-PC(H&S) 7

The set of common factors of A and B will be of the form 2 m5n where 0 £ m £ 60 and
0 £ n £ 50.
So, n (A Ç B) = 61 ´ 51
Similarly, since the common factors of B and C is also of the form 2 m ´ 5n where
0 £ m £ 40 and 0 £ n £ 40.
So, n (B Ç C) = 41 ´ 41
Similarly n (A Ç C) = 41 ´ 41
and n (A Ç B Ç C) is also 41 ´ 41
Hence n (A È B È C) = n (A) + n (B) + n (C) – n (A Ç B) – n (B Ç C)
– N (A Ç C) + n (A Ç B Ç C)
2 3 2 2 2
= 61 + 101 ´ 51 + 41 – 61 ´ 51 – 41 – 41 + 41 = 73001.

10. Obviously 2 £ y £ 9. If y = k, then x can take values from 1 to k – 1 and z can take values
from 0 to k-1.
9
Thus required number of numbers =   k  1  k   240 .
k 2

11. Let us assume he invites r people at a time

Number of parties 24Cr
24
Cr should be max Þ r = 12
For the same man 24-1C12–1 = 23C11.

12. Total number of ways of drawing three balls = 9C3 of these, reject those ways in
which no black ball is included i.e. 6C3 ways.
Hence number of ways = 9C3 – 6C3 = 64 ways .

13. No. of ways we can choose the steerer is 3C1

Since 8 people can row on one side A only, therefore 12 more people need to be chosen
for that side. We are left with 29 people to choose from i.e. 40-8-3 = 29.
Number of ways of choosing these 12 people out of 29 is 29C12.
Now, we are left with 29-12 = 17 people and we have to choose 17 people on side B,
from these 17 people. Number of ways of doing that 17C17.
Hence the total number of ways of selecting the crew is 3C1 29C12 17C17
But, we can arrange the 20 people on side A in 20! ways. Similarly, the 20 people on side
B can be arranged in 20! ways. Hence the total answer is 3C1 29C12 17C17 20! 20!

14. Let the number of men participating in a chess tournament be n. since each participant
played two games with the other, the number of games played between men themselves
is (nC2) (2) = n(n –1). The number of games men played with women is (2) (2)n = 4n.
According to the given condition, n(n –1) –4n = 66
Þ n2 –5n –66 = 0 Þ (n –11) (n + 6) = 0
As n > 0, we get n –11 = 0 or n = 11.
\ The number of participants = 11 + 2 = 13 and the first number of games played by
them is 2(13C2) = 13 ´ 12 = 156.

15. Children of Mr. A and Ms. B is 10 –(x + x + 1) = 9 –2x.

8 RSM-78-P4-MA-PC(H&S)

Let N = the number of fights between children of different parents

= total number of fights that can take place among children
-[the number of fights among the children of the same parents]
10  9  x  x  1 x  x  1  9  2x   8  2x  
=10C2 – [xC2 + x +1C2 + 9-2xC2 ] =    
2  2 2 2 
1 2 2  2 17 
= 45  x  x  x 2  x  72  34x  4x 2  = 9  17x  3x  3  x  x  3
2  3 
 17 
2
397  397  17 
2
= 3  x      3x 
 6  36  12  6 
2
397  17 
Since y =  3x  is a parabola open down wards,
12  6 
For the maximum, x must be 17/6. As x cannot be in fraction, we take x = 3. Thus,
maximum value of N = 33 and is attained when x = 3.
 RSM-78-P4-MA-PC(H&S) 9

HINTS & SOLUTIONS TO ASSIGNMENT PROBLEMS (OBJECTIVE)

Level - I

1. Number of different garlands will be equal to number of different solutions of the equation
a + b + c = 12 without taking order of a, b and c into consideration.

4
2 2 women can be made to sit in chairs marked 1 to 4 in. P2 ways and 3 men in remaining
6 4 6
six chairs in P3 ways so no of ways = P2  P3 .

3. We have two sets of parallel lines each containing (m + 2) lines. So number of

parallelograms = m 2
C2 m  2 C2 =  m  2  2  m  1 2
4

3
 x2 
4. No. required flags = 3! ´ coefficient of x in  1  x 
3

 2! 
= 6 ´4 = 24.

6. There are 3 pairs i.e. M, A, T and 5 singles i.e. H, E, I, C, S in Mathematics. Following

possibilities arise:
3
C2  4!
(i) Two pairs possible nos. =  18
2! 2!
3 7
C1
C2  4!
(ii) One pair possible nos. =  756
2
(iii) All single letters possible nos. = 8P4 = 1680
Total no. of words = 18 + 756 + 1680 = 2454

7. First we seat 6 boys which can be done in 6! ways. Now two brothers can be seat in 7
places in 7P2 ways so number of ways = 7P2  6!

9. Let us count total no. of possibilities for the 1 st type of book, either 0 copy or 1 or 2 or L I
copies can be taken i.e. I + 1 possibilities. Similarly for other type of books, there are I + 1
possibilities.
Total no. of possibilities = (I + 1)K
Of these, remove one possibility i.e. if no book of any kind is taken.
\ Net possibilities = (I + 1)K - 1

11. Total number of numbers will be equal to the sum of numbers of all possible
1-digit, 2-digit, 3-digit, 4-diigit and 5-digit numbers .
Þ Total number of numbers = 3 + 32 + 33 +34 + 34

=

3 34  1  3 4

35  2.34  3 .
2 2

12. The required number of ways 210  1  1023

10 RSM-78-P4-MA-PC(H&S)

9 !
13. Total number of permutations =
2 !
Number of those containing ‘HIN’ = 7!
7!
Number of those containing ‘DUS’ =
2!
Number of those containing ‘TAN’ = 7!
Number of those containing ‘HIN’ and ‘DUS’ = 5!
Number of those containing ‘HIN’ and ‘TAN’ = 5!
Number of those containing ‘TAN’ and ‘DUS’ = 5!
Number of those containing ‘HIN’, ‘DUS’ and ‘TAN’ = 3!
9!  7! 
Required number =   7! 7!   3 ´ 5! – 3! = 169194.
2!  2

14. (3)6 = 729 < 900 and (3)7 = 2187 > 900

15. The last place may be filled in 3 ways. The middle and first place may be filled in 6 ways.
So no of numbers = 6 × 6 × 3 = 108.

20. Total no. of onward journey Tickets = 20C2 similarly total no. of downward tickets = 20C2
Total No. of tickets = 2 ´ 20C2 = 380

n
21. Cr  2 n Cr 1 n Cr  2
=  n
Cr n Cr 1   n
Cr 1 n Cr  2 
n1
= Cr 1 n 1 Cr  2 n 2 Cr  2 .

22. There are four even and five odd places in a nine digits number. 4 even places can be
4! 5!
filled by 3 and 5 in  6 ways and 5 odd places can be filled by 2 and 8 in  10
2! 2! 2! 3!
ways so total numbers formed = 16.

P
23. Distinct numbers of the form are 36 minus the number of numbers where greatest
q
common divisor of p and q is more than 1. Such numbers are 23.

24. The last digit of powers of 3 will be 3, 9, 7, 1 and it repeats in the same order. The last
digit of powers of 7 will be 7, 9, 3,1 and it repeats in same order. Now 3 m + 7n will be a
multiple of 10 as 3+7, 9+1, 7+3, 1+9. Þ (m, n) will be
of the form (4t+1, 4k+1), ( 4t +2, 4k), ( 4t+3, 4k+3) and (4t , 4k+2)
So total number of ways = 5 ´ 5 + 5 ´ 5 + 5 ´ 5 + 5 ´ 5 =100

4!
25. First we arrange B, A, A and A in ways B × A × A × A ×, Now × denotes the place for
3!
5
N . So N can be arranged in C2 ways. So total ways = 4 × 10 = 40.
RSM-78-P4-MA-PC(H&S) 11

26. Here x1x2 x3 =22 ´ 3 ´ 5. Let number of two’s given to each of x1, x2, x3 be a, b, c .
Then a+b+c = 2, a, b, c ³ 0
The number of integral solutions of this equations is equal to coefficient of
x2 in (1-x)-3 i.e. 4C2
i.e. the available 2 two’s can be distributed among x 1, x2 and x3 in 4C2 = 6 ways.
Similarly, the available 1 three can be distributed among x 1 , x2 , x3 in 3C2 = 3 ways( =
coefficient of x in (1 – x)-3 )
\ Total number of ways = 4C2 ´ 3C2 ´ 3C2 = 6 ´ 3 ´ 3 = 54 ways.

27. Total no. of words = 7!

Words in which ‘beg’ appears = 5!
Words in which ‘cad’ appears = 5!
Words in which ‘beg’ and ‘cad’ appears = 3!
Required no. 7! - 2 ´ 5! + 3! = 4806

28. Put x4 = 0 Þ x1 + x2 + x3 = 20
No. of solutions = 22C2
X4 = 1, x1 + x2 + x3 = 16. No. of solutions 18C2 and so on till x4 = 5.
Total no. of solutions = 22C2 + 18C2 + 14C2 + 10C2 + 6C2 + 2C2 = 536

29. Required no. = Coefficient of x100 in (x + x2 + L x100)3

= Coefficient of x97 in (1 + x + Lx99)3
= Coefficient of x97 in (1 + x + x2 + L )3
= Coefficient of x97 in (1 - x)-3 = 99C2 = 4851 .

30. The required number can have at most 3 digits.

(i) number of single digit numbers = 6
(ii) number of two digit numbers = 5 ´ 5 = 25
(iii) number of three digit number = 5 ´ 5 ´ 4 = 100
Total = 131

32. The number having 3 at units place are 3  6 . Similarity the numbers having unit digits
as 4, 5, 6 all will be 6 each.
So the sum of the digits at unit place 6(3 + 4 + 5 + 6) = 6 × 18 = 108.

38. Permissible digits are 2, 3, 4, 5 6, 7

Number of n-digit numbers made by these digits = 6 n
Number of n-digit number which don’t contain 2 = 5 n
Number of n-digit numbers which don’t contain 7 = 5 n
Number of n-digit numbers which don’t contain 2 and 7 both = 4 n
Required No. = 6n - 2.5n + 4n

39. The first digit can be chosen in 9 ways( other than zero), the second can be chosen
in 9 ways ( any digit other then the first digit), the third digit can be chosen in 9
ways( any digit other then the second digit ) and so on.
Hence required number of numbers is 9 ´ 9 ´ . . . . ´ 9 ( n times) = 9n .
12 RSM-78-P4-MA-PC(H&S)

40. 3630 = 2 ´ 3 ´ 5 ´ 112 .

Now a factor will be of the form 4n +1 if either all the factors are of the form
(4n+1) or number of factors of the form ( 4n+3) is even.
Hence divisors are 1, 5, 3 ´ 11, 112 , 5 ´ 112, 5 ´3´ 11 , i.e. , 6 .

41. 676 = 262 = 132.22 = n1.n2 (let).

22
Total number of ways in which n1 and n2 can be co-prime is equal to = 2.
2

42. We first choose the 6 cards which will go to the right places and dearrange the remaining
4.
Þ Number of ways to select the 6 = 10C6
1 1 1
and number of ways to dearrange = 4 !     =9
 2 ! 3 ! 4 !
Þ Total number of ways = 10C6 ´ 9 = 1890

43. Suppose ‘r’ things are selected from third pile and ‘n– r’ things are selected from first and
second pile. Corresponding ways = nCr (n – r +1)
n n
Þ Total ways =  n
Cr (n – r +1) =  n
Cr  r  1 = 2n– 1(n+2).
r 0 r 0

44. 8, 7, 6, 4, 2, x & y
Any number is divisible by 3 if sum of digits is divisible by 3.
i.e. x + y + 27 is divisible by 3.
x & y can take values frm 0, 1, 35, 9
possible pairs (5, 1) (3, 0) (9, 0) (9, 3) & (1, 5), (0, 3) (0, 9) (3, 9)

45. Required number will be non-negative integral solution of the equation x 1 + x2 + x3 + x4 =

12
where 0 £ xi £ 9, i = 1, 2, 3, 4 and it is equal to 15C12 –45C2 = 455 –40 = 415

46. Let us assume x < y < z. a = x, b = y –x, g = z –y Þ 3a + 2b + g = 6 where a, b, g ³ 1

there is clearly one solution a = b = g = 1 Þ total number of solution is 3 !.

47. Total number = 3P2 . 5P4

48. The last digit of powers of 3 can be 3, 9, 7, 1 similarly last digit of powers of 7 can be
7, 9, 3, 1 Þ total number of ways = 5´5 + 5´5 + 5´5 + 5´5 = 100.

49. 4n + 2 = 2(2n +1) Þ number of required divisors = 1.(4. 4.6) – 1= 95.

50. Let n1 = x1x2x3 and n2 = y1y2y3 Þ n1 and n2 can be added without carrying if xi + yi £ 9
if xi = r, yi = 0, 1, 2, …(9 –r) for i = 1, r Î [0, 9] and yi = 1, 2, …(9 –r) for i = 2, 3, r Î [1, 8]
2
 8  9 
Þ Required pairs = 
  9  r  

 10  r   = 36 . 552
 r 1  r 0 

N 10000 y 1  1000 y 2  100 y 3  10 y 2  y 1

51. =
y1  y 2  y 3  y 4  y 5 y1  y 2  y 3  y 4  y 5
RSM-78-P4-MA-PC(H&S) 13

9000 y 2  9900 y 3  9990 y 4  9999 y 5

= 10000 – £ 10000.
y1  y 2  y 3  y 4  y 5

52. Total number of rectangular = ån3

Total number of square formed = ån2
 n3 10 6n n  1 10
 Þ  Þ (3n2 + 3n)3 = (4n+ 2) + 20 Þ 9n2 + 9n = 40n + 20
 n 2
3 4 2n  1 3
Þ 9n2 – 31n – 20 = 0 Þ (9n + 5) (n – 4) = 0 Þ n = 4.

53. The word MAT cannot be written if at least one letters is not selected.
Þ Total number of ways = 3(2k –1) = 93 Þ k = 5.

54. Other than 2, remaining (n - 2) places will be filled by 1 and 3.

\ Number of ways to do this = 2 ´ 2 ´ ….(n - 2) times = 2n-2
Now for 2, selecting 2 places out of n = nC2
\ required number of ways
n!
n
C2 . 2n-2 = 2 n 2  n n  1 2 n3
2 !  n  2 !

55. x = -4 + t1, y = -4 + t2, z = -4 + t3

where t1 + t2+ t3 = 12
the required number of solutions = coefficient of a12 in (1 + a + a2 +. . . . .+ a12)3
= coefficient of a12 in (1 - a)-3 = 14C2
14 RSM-78-P4-MA-PC(H&S)

Level – II

3. First we seat remaining (n - 2) persons which can be done in (n - 2)! ways. In any such
arrangement, the two particular persons can be made to sit in (n -1) gaps in n-1P2 ways.
\ Total ways = (n - 2)! n-1P2
Also, we may calculate the required ways as:
Total ways - (ways in which the 2 particular persons always sit together)
Ways in which both are together = n-1Pn-1 ´ 2P2 = 2(n- 1)!
\ Required ways = n! - 2(n- 1)!

6. Let 2m divides 24!

 24   24   24   24 
Then, highest value of m =     2    3    4   ...
 2  2  2  2 
= 12 + 6 + 3 + 1 = 22
Let 3m divides 24!, then
 24   24   24 
Highest value of M =     2    3   ...
 3  3  3 
= 8 + 2 = 10
\ 222 ´ 310 divides 24!
Also 247 = (23 ´ 3)7 = 221 ´ 37
1210 = (22 ´ 3)10 = 220 ´ 310
As both 247 and 1210 divide 222 ´ 310,
\ 247 and 1210 divide 24!.

9. 2. nC5 = nC4 + nC6

On solving, n2 - 21n + 98 = 0
Þ n = 7 or 14

10. He can invite or not invite each of his friends. Total ways in which this can be done = 2 ´
2 ´ … ´ 2 ( 8 times) = 28.
But this also includes one way in which none of these of his friends is invited. Rejecting
that way, the number of ways are 28 - 1.
Also, he may invite one friend in 8C1 way
2 friends in 8C2 ways
and so on
\ Required ways = 8C1 + 8C2 + …+ 8C8 .

n  n  3
12. No. of diagonals =
2
n  n  3
\ = 4n - 15
2
Þ n2 - 11n + 30 = 0 Þ n = 5, 6.
35
13. Cn+7 = 35C4n-2
Þ n + 7 = 4n - 2 or
n + 7 + 4n - 2 = 35
On solving, n = 3 or n = 6.

14. Two straight lines can interest in atmost one point.

\ max. no. of points of intersection of m lines = mC2 ´ 1 = mC2.
Again, 2 circles can intersect in atmost 2 points.
RSM-78-P4-MA-PC(H&S) 15

\ Max. no. of points intersection of n circles = nC2 ´ 2.

A line can intersect a circle in atmost 2 point.
\ Max. number of points of intersection of m lines and n circles = 2(mn).
\ N = mC2 + 2. nC2 + 2mn
N - mC2 = 2. nC2 + 2mn
= n(n - 1) + 2mn
= n(n - 1 + 2m)
\ n divide N - mC2
N - nP2 = mC2 + 2mn ( since 2. nC2 = nP2)
m  m  1
=  2mn
2
m 1 
= m  2n 
 2 
\ m divides N - nP2 only if m is even.
\ in general, m does not divide N - nP2.
N - mC2 = 2. nC2 + 2mn
= 2(nC2 +mn)
which is even integer.
N - mC2 - nP2 = 2mn
Which is an even integer.

2n!  n  1  n  2  ...  2n 
15. N= 
n! n! n!
\ n! n! = (n + 1) (n + 2) (n +3) … (2n).
Now, p divides (n + 1) (n + 2) … (2n) ( since n < p < 2n)
 p divides (n! N)
 p divides N ( since n < p < 2n Þ p does not divide n!)
If possible, let p2 divides n!N
Þ p2 divides n! N
Þ p2 divides (n + 1) (n + 2) … (p - 1) p(p + 1) … (2n)
Þ p divides (n + 1) (n + 2) … (p - 1) p(p + 1) … (2n)
which is not possible.
\ p2 does not divide N.

16. No. of ways of arranging remaining (n -3) boys = (n -3)!

n-2
Here, there are (n -2) gaps in which the 3 particular boys can be seated in C3 ways. The
three boys can rearrange among themselves in 3! ways.
Total ways k = (n - 3)! n-2C3 . 3!
 n  2 !
= (n - 3)! 3!
3!  n  5  !
= (n -3) (n - 4) (n -2)!
= (n - 3)2 (n - 4)2 (n - 5)!

20. First and second prime in Mathematics (Physics) can be awarded in 30P2 (30P2) ways.
First prize in Chemistry (Biology) can be awarded in 30 (30) ways.
\ N = (30P2)2 . (30)2
= 304 . 292
= 24 ´ 34 ´ 54 ´ 292
since 400 = 24 ´ 52
600 = 23 ´ 3´ 52
8100 = 22 ´ 34 ´ 52
16 RSM-78-P4-MA-PC(H&S)

\ N is divisible by each of 400, 600, 8100.

Also, N is divisible by four distinct primes i.e. 2, 3, 5, 29.

SOLUTIONS TO COMPREHENSIONS

1. Let person Pi gets xi number of things such that

x1 + x2 + x3 + x4 + x5 = 25
where x1, x2, x3, x4, x5 ³ 1
let ai = xi- 1 ³ 0, 1 £ i £ 5; i ÎN
\ x1 + x2 + x3 + x4 + x5 = 20
Þ a1 + a2 + a3 + a4 + a5 = 20
\ No. of solutions are 20+5-1C5-1 = 24C4.

2. To calculate the number of ways each receive odd number of things.

Let xi = 2li + 1 where li ³ 0, 1 £ i £ 5, i Î N
Þ 2 ( l1 + l2 + l3 + l4 + l5) + 5 = 25
Þ l1 + l2 + l3 + l4 + l5 = 10
We simply have to attain the number of non-negative integral solutions of this equations,
which is 14C10 = 14C4 .

3. In this case, 1 £ xi £ 11
Required number of ways is equal to the coefficient of x 25 in (x + x2 + x3 + ….+x11)5
= coefficient of x20 in (1 + x + x2 + ….+x10)5
= coefficient of x20 in (1 - x11)5 (1 - x)-5
= coefficient of x20 in (1 - 5x11)5 (1 - x)-5
= 24C20 - 5. 13C9
= 24C4 - 5. 13C4

4. (min A) ³ 1
Also min A £ min { S - {1, 2, 3, …, n - r}}
= min {n - r + 1, n - r + 2, … n} = n - r + 1

5 1 £ min A £ n - r + 1
Let min A = k
\1£k£n-r+1
The remaining r - 1 elements can be chosen from k +1, k + 2, …, n. So number of such
subsets = k + k + k + … + k (n-kCr-1 times) = k.n-kCr-1.

 
6. 420 = 22.3.5.7 = P1 1P2 2    Pnn
Number of ways of resolving N in two co-prime factor is 2n-1 = 23 = 8.
Number of ways in which N can be resolved in two factors is
(1  1)( 2  1)    (n  1)  1
if N is perfect square
2
(1  1)( 2  1)    (n  1)
if N is not perfect square
2
3.2.2.2
\  12 .
2
Number of ways in which 420 can be factor in two non-coprime factors is 12 - 8 = 4.

7. Number of the integral solution of

x1x2x3x4 = 420
 RSM-78-P4-MA-PC(H&S) 17

420 = 22.3.5.7
x1  2a1 3b1 5c1 7d1
x 2  2a2 3b2 5c 2 7d2
x 3  2a3 3b3 5c 3 7d3
x 4  2a4 3b4 5c 4 7d4
x1x 2 x 3 x 4  2a1  a2  a3  a4 7d1  5b1 b2 b3 b4  7d1  d2  d3  d4
Number of negative integral solution of
a1 + a2 + a3 + a4 = 2 is 4+2-1C2 = 10
b1 + b2 + b3 + b4 = 1 is 4+1-1C1 = 4
c1 + c2 + c3 + c4 = 1 is 4+1-1C1 = 4
d1 + d2 + d3 + d4 = 1 is 4+1-1C1 = 4
Number of positive integral solution of
x1x2x3x4 = 420 is 10.4.4.4 = 640.

8. Sum of all the even divisors of 420

420 = 22.3.5.7
 221  1  32  1  52  1  72  1  7.8.24.48
Sum of all divisors of 420   
 
     = 7.4.48
 1  2  4   8  2.4.6
Sum of all odd divisors of 420 = sum of all divisors of 105 (3.5.7)
 32  1  52  1  72  1

 2   4   6  = 4.48.
   
Sum of all even divisors of 420 = 4.48(7 - 1)
= 4 × 48 × 6 = 1152.

9. A : Set of numbers which are divisible by 3.

B : Set of numbers which are divisible by 5.
C : Set of numbers which are divisible by 7.
Number of numbers which are divisible by at least one of 3 or 5 or 7
= n(AÈBÈC)= n(A) + n(B) + n(C) - n(AÇB) - n(BÇC) - n(CÇA) + n(AÇBÇC)
100   100   100  100  100  100  100 
=          55
 3   5   7   15   21   35  105 
\ Desired number = 100 - 55 = 45.

10. We can select three different letters in 8 C3 ways. Suppose we select A, L, M

Let X = set of words in which A is absent,
Y = set of words in which L is absent and
Z = set of words in which M is absent.
Then n(XÈYÈZ) = (26 + 26 + 26) - (16 + 16 + 16) + 0 = 189.
So, the number of six letter words formed by using A, L and M = 3 6 - 189 = 540.
\ The desired number of words = 8 C3  540  30240 .

11. Desired number = 2985984 - { 2985984  3 2985984  6 2985984 }

= 2985984 - 1860 = 2984124
[Note that 2985984 = 212×36].
18 RSM-78-P4-MA-PC(H&S)

SOLUTIONS TO MATCH THE FOLLOWING

1(A). Put x + 4 = x1, y + 4 = y1, z + 4 = z1

Þ x1 + y1 + z1 = 13
x1, y1, z1 ³ 0
number of solutions = coefficient t13 in (1 – t)–3 = 105.

 n  1   13   13 
 
(B). r=  a  1  1  2  = 5
1   1  
 x   1/ 2 
5
4  1 
greatest term =  12 C5    132 .
3 2  2

(C). a2 – a1 = a1a2d
a3 – a2 = a2a3d
: :
a100 – a99 = a99a100d
–––––––––––––––––––
99
a100 – a1 = d a a
i 1
i i 1 = 99 a1a100d

99
aiai1
Þ a a
i 1 1 100
= 99.

(D). Number of triangles = 11C3 – 8C3

11 10  9 8  7  6
= 
6 6
= 11 ´ 15 – 56 = 109.
2(a). xyz = 35
number of solution (x, y, z) is 3 + 5 – 1C5 = 21.

(b). Number of terms = 6 + 3 – 1C3 – 1 = 28.

(c). x2 + x – 400 £ 0
x(x + 1) £ 400
solutions are 1, 2, 3, …, 19.
Number of solutions = 19.

(d). x + y + z = 10
number of solutions = coefficient of x10 in (t + t2 + … + t8)3
3
 8 
= coefficient of x10 in t3  1  t 
 1 t 
= coefficient of x7 in (1 + 3C1 t + 3C2 t2 + …) = 9C7 = 36.