EXERCISE-I

Q.5 In how many ways can a team of 6 horses be selected out of a stud of 16 , so that there shall always be
3 out of A B C A  B  C  , but never A A  , B B  or C C  together .
[Sol. Stud means establishment or a farm in which horses are kept by an owner .

16 horses

Number of ways = 10C number of ways of choosing 3 out of A B C A  B  C 

3
so that A A  , B B  or C C  are not together
= C 3 [ C 3  3C 1 . 4C 1 ]
10 6 = 10C3 [ 20  12 ]= 10C3 . 8
10 . 9 . 8
= . 8 = 960 (Ans.)
1. 2 . 3
Alternative : Any 3 from 10 others can be taken in 10C3 ways 3 from ABCABC can be selected so
that AA, BB, CC are not together is =

2 × 2 × 2 = 8 ways ]

EXERCISE-I
Q.8197/1 Find the number of distinct natural numbers upto a maximum of 4 digits and divisible by 5, which can be
formed with the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 each digit not occuring more than once in each number.
[Ans. 1106]
[Sol. Single digit numbers = 1
5  8
two digit numbers = 17
0  9
5  8 . 8  64 
three digit numbers = 136
0  9 . 8  72
5  8 . 8 . 7  504
four digit numbers = 952
0  9 . 8 . 7  448
Hence total = 1 + 17 + 136 + 952 = 1106 ]
 EXERCISE-I
Q.9 The Indian cricket team with eleven players, the team manager, the physiotherapist and two umpires are
to travel from the hotel where they are staying to the stadium where the test match is to be played. Four
of them residing in the same town own cars, each a four seater which they will drive themselves . The bus
which was to pick them up failed to arrive in time after leaving the opposite team at the stadium . In how
many ways can they be seated in the cars ? In how many ways can they travel by these cars so as to
reach in time, if the seating arrangement in each car is immaterial and all the cars reach the stadium by the
same route .
[Sol. 11 players
15 2 umpires
1 doctor
1 manager
4 people drive their own cars . There are 12 seats for 11 people .
Hence Total ways = 12C11 . 11 ! = (12) !
for the 2nd part 11 people can sit in 4 cars in group of 3, 3, 3 & 2 only
(11) !
which can be done in and can be distributed in four cars in 4 ! ways .
(3 !)3 . 2 ! . 3 !

(11) ! 4 ! (11) !
Hence, Total ways = 4 = = 369600 Ans. ]
2 ! (3 !) 108

EXERCISE-I
Q.12 A crew of an eight oar boat has to be chosen out of 11 men five of whom can row on stroke side only,
four on the bow side only, and the remaining two on either side. How many different selections can be
made?
[Sol. number of ways
= 11C8 – [ 5C5 . 6C3 ]
= 165 – 20 = 145 ]

EXERCISE-I

Q.13 How many ten digits whole number satisfy the following property they have 2 and 5 as digits, and there
are no consecutive 2's in the number (i.e. any two 2's are separated by at least one 5).
[Ans. 143]
[Sol. Exactly one 2, 10
0 0
Exactly two 2's 9C = 36 | |  | |  | | | | |
2
00 0
Exactly three 2's 8C
3 = 56
| | | |  |  | | |
0000
Exactly four 2's 7C
4 = 35
| |  |  |  | | |
0000 0
Exactly five 2's 6C
5 = 6 
————
143 ]
 EXERCISE-I
Q.19 Find the number of distinct throws which can be thrown with 'n' six faced normal dice which are
indistinguishable among themselves . [ Ans. : n + 5c5 ]
[Hint: consider the six faces to be beggars and 'n' identical dice to be identical coins.
Find the number of ways in which these 'n' identical coins can be distributed in six beggars ]

EXERCISE-I

Q.21 How many different ways can 15 Candy bars be distributed between Ram, Shyam, Ghanshyam and
Balram, if Ram can not have more than 5 candy bars and Shyam must have at least two. Assume all
Candy bars to be alike. [Ans. 440]
[Sol. R + S + G + B = 15
giving Ram 2 Candy bars we have
R + S + G + B = 13 ....(1)
solution to (1) is = 16C3 0 0 0.......

0 Ø Ø Ø = 560
13
now Shyam must have  5 Candy
if shyam is given 6 then (1) becomes
R+S+G+B=7 ....(2)
solution of this equation will be invalid
number of solutions of (2) are
= 10C 0000000ØØØ
3     
10 ·9 ·8
= 1·2 ·3 = 120

Hence required number of solutions are 560 – 120 = 420 Ans. ]

 EXERCISE-I
Q.22 All the 7 digit numbers containing each of the digits 1, 2, 3, 4, 5, 6, 7 exactly once, and not divisible by
5 are arranged in the increasing order . Find the (2004)st number in this list.
[ Ans. : 4315762 ]
[Sol. Total numbers which are not divisible
by 5 are = 6 !  6 = 4320

Now when 1 or 2 or 3 occupies the 7th place,

then the number of numbers = 3  5 !  5
= 1800
(last can be filled only in 5 ways)
when 1st two places are 41 .......... then
number of numbers = 4 !  4 = 96
with 42 ..........
number of numbers = 4 !  4 = 96
Total so far = 1800 + 192 = 1992 .
1st three places are filled as
4 3 1 2 ..........
number of numbers = 2 !  2 = 4 [ Total = 1992 + 4 = 1996 ]
Now, when first 4 places are , 4 3 1 5 
then the remaining 3 places in each case be filled in 3 ! = 6 ways
which makes total numbers = 2002 and the (2002)th number is 4315762
Hence (2001)st number is just before it = 4315726 (Ans) ]
 EXERCISE-II
Q.3 There are counters available in 7 different colours. Counters are all alike except for the colour and they
are atleast ten of each colour. Find the number of ways in which an arrangement of 10 counters can be
made. How many of these will have counters of each colour.
 49 
[ Ans. : 710 ;   10 ! ]
 6
[Sol.  A : Violet
B : Indigo
1st place we have 7 choices C : Blue
2nd place we have 7 choices etc D : Green
E : Yellow
Hence total number of ways F : Orange
10 places can be filled = 710 Ans. G : Red
For counters of all colours : 
A B C D E FG
exactly one counter repeats
eg. A B C D E F G AAA
exactly two counter repeats
eg. AB C D E F G AB B & A B C D E F G AA B
exactly three counter repeats
eg. AB C D E F G AB C

10 ! 7 . 10 !
Now (i) = 7
C1  =
4! 4!

10 ! 7 . 10 !
(ii) = 7
C2 . 2 =
2! 3! 2!

10 ! 35 . 10 !
(iii) = 7
C3 . =
2! 2! 2! 8

 7 7 35   7  84  105 
Total = 10 !    = 10 !  
 24 2 8   24 

 196   49 
=   10 ! =   10 ! Ans.
 24   6
 EXERCISE-II
Q.8 There are 2n guests at a dinner party. Supposing that the master an d mistress of the house have fixed
seats opposite one another, and that there are two specified guests who must not be placed next to one
another. Show that the number of ways in which the company can be placed is (2n  2) !·(4n2  6n + 4).
[Hint : Excluding the two specified guests, 2n persons can
be divided into two groups one containing n and the other
(2 n  2) !
(n  2) in and can sit on either side of Master &
n ! (n  2) !
Mistress in 2 ! ways and can arrange themselves in n ! (n  2) !
Now the two specified guests where (n  2) guests are seated
will have (n  1) gaps and can arrange themselves in 2 ! ways .
Number of ways when G1 G2 will always be together
( 2 n  2) !
= 2 ! n ! (n  2) ! (n  1) . 2 ! = (2 n  2) ! . 4 (n  1)
n ! ( n  2) !
2!
Hence number of ways when G1 G2 are never together= 2 !.n !.n !  4(n  1).(2 n  2)!
n! n! 2!
= (2 n  2) !  2 n (2 n  1)  4 (n  1)  = (2 n  2) !  4n 2
 6n  4  ]
[ Alternate Solution: Total ways = (2n)!
number of ways when two specified people are together =
2(n  1) . 2!(2n  2)! = 4(n–1). (2n–2)!
  
adj. places on
both sides
 required number of ways = (2n)! – 4(n–1)!.(2n–2)!
= (2n–2)! [ 2n(2n–1) – 4n + 4] = (2n–2)! [4n2 – 6n+ 4]
 EXERCISE-II
Q.15 Find the number of three digits numbers from 100 to 999 inclusive which have any one digit that is the
average of the other two. [Ans. 121]
[Sol. with one of the digit as 1
102, 111  4 + 1 = 5
with 2 as digit 240, 231, 222  4 + 6 + 1 = 11
with 3 306, 315, 324, 333  4 + 6 + 6 + 1 = 17
with 4 408, 417, 426, 435, 444  4 + 6 + 6 + 6 + 1 = 23
with 5 519, 528, 537, 546, 555  6 + 6 + 6 + 6 + 1 = 25
with 6 639, 648, 657, 666  6 + 6 + 6 + 1 = 19
with 7 759, 768, 777  6 + 6 + 1 = 13
with 8 879, 888  7
with 9 999  1
Total = 5 + 11 + 17 + 23 + 25 + 19 + 13 + 7 + 1 = 121 Ans.
Alternatively : Consider two sets 1, 3, 5, 7, 9 ....(1)
0, 2, 4, 6, 8 ....(2)
required number of ways = (any two from set (1) + any two from set 2 (excluding zero) 3!
+ (o along with any one from set 2) · 4 + all four alike
= ( C2 + 4C2) 3! + 4C1 · 4 + 9 = 121 Ans. ]
5

EXERCISE-II
Q.16 Prove by combinatorial argument that
(a) n+1C = nC + nC
r r r – 1.
(b)63/01 n + m cr = c0 . cr + nc1 . mcr  1 + nc2 . mcr  2 + ....... + ncr . mc0.
n m

[Sol. n + 1C = nC + nC
r r r–1

T0
consider (n + 1) different toys
T1T2 .....Tn

 no. of ways of   no. of ways of selecting   no. of ways of 

 selecting r toys out of   (r  1) toys out of n toys   selecting r toys when T 
=
 (n  1) different toys   when T is always included   + 0
   0   is always excluded 
= nC r – 1 + nC r
Hence n + 1Cr = nCr – 1 + nCr ]
(b) Note : It is Vandermonde's identity.
Let there be 'n' boys and 'm' girls . We want to choose a team of 'r' persons, the boy-girl proportion
allowed to be all possible . The 'r' persons can be chosen from n + m persons in n + mcr ways . Also,
number of ways ;
when no boy and 'r' girls = nc0 . mcr
when 1 boy and r  1 girls = nc1 . mcr  1
Similarly 'r' boys and no girls = ncr . mc0
Hence, total = nc0 . mcr + nc1 . mcr  1 + ...... + ncr . mc0 = m + ncr
r
Alternatively : compare the co-efficient of x in (1 + x) m + n and (1 + x)m . (1 + x)n ]
 EXERCISE-II
Q.17 A man has 3 friends. In how many ways he can invite one friend everyday for dinner on 6 successive
nights so that no friend is invited more than 3 times. [Ans. 510]
[Sol. Let x, y, z be the friends and a, b, c denote the case when x is invited a times, y is invited b times and z
is invited c times.
Now we have the following possibilities
(a, b, c)  (1, 2, 3) or (3 3 0) or (2 2 2) [grouping of 6 days of week]
6!3! 6!3! 6! 3!
Hence the total ways 1! 2! 3!  3! 3! 2!  (2! 2! 2!) 3! ]

EXERCISE-II
Q.24 The members of a chess club took part in a round robin competition in which each plays every one else
once. All members scored the same number of points , except four juniors whose total score were 17.5.
How many members were there in the club ? Assume that for each win a player scores 1 point, for draw
1 point and zero for losing.
2
[Sol. Let the number of members are n
Total number of points = nC2 .
 n
C2  17.5 = (n  4) x ( where x is the number of point scored by each player )
n (n  1)  35 = 2 (n  4) x
n ( n  1)  35
2x = (where x takes the values 0.5 , 1 , 1.5 etc)
n4

n 2  n  35
(must be an integer) = (must be an integer)
n4

n ( n  4)  3 (n  4)  23 23
= = (n + 3) 
n4 n4
23
 must be an integer  n = 27 is the only possibility ]
n4
 EXERCISE-II
Q.28 Six faces of an ordinary cubical die marked with alphabets A, B, C, D, E and F is thrown n times and the
list of n alphabets showing up are noted. Find the total number of ways in which among the alphabets A,
B, C, D, E and F only three of them appear in the list. [Ans: 6C3[3n – 3C1(2n – 2) – 3C2] ]
[Sol. ‘List’ of n alphabets  arrangement.
Out of 6 faces, 3 can be selected in 6C3 ways.
Consider one such selection say ABC.
Each of the ‘n’ places can be filled in 3 ways so total = 3n ways
but this includes those ways also which contain exactly 1 alphabet or exactly 2 alphabets which are to be
subtracted.
Now, number of ways which contain only 1 letter = 3.
& number of ways containing exactly 2 alphabets is = 3C2 (2n – 2)
Hence the number of ways = 3n – 3C2(2n – 2) – 3
so required = 6C3 [3n – 3C2(2n – 2) – 3] ]

EXERCISE-II
Q.29193/1 Find the number of integer betwen 1 and 10000 with at least one 8 and at least one 9 as digits.
[Ans. 974 ]
[Sol. 9's 8's other Number of ways
1 1 2 4C · 2 · 8 · 8 = 768
2
4!
1 2 1 ·8 = 96 *
1!1! 2!
4!
1 3 0 = 4
1! 3!
4!
2 1 1 ·8 = 96
2!1!1!
4!
2 2 0 = 6
2! 2!
4!
3 1 0 = 4
3!1!
974 Ans.
4!
* (two 8's and 9 and one other digit can be taken in 8 ways and can be arranged in ways) ]
1!1! 2!