Problems on Permutations and Combinations - Solved Examples(Set 1)

1. Out of 7 consonants and 4 vowels, how many words of 3 consonants and 2 vowels can be formed?
A. 24400
B. 21300
C. 210
D. 25200

Answer: Option D
Explanation:
Number of ways of selecting 3 consonants from 7
= 7C3
Number of ways of selecting 2 vowels from 4
= 4C2
Number of ways of selecting 3 consonants from 7 and 2 vowels from 4
= 7C3 4C2
=(765321)(4321)=210

It means we can have 210 groups where each group contains total 5 letters (3 consonants and 2 vowels).
Number of ways of arranging 5 letters among themselves
=5!=54321=120
Hence, required number of ways
=210120=25200
2. In a group of 6 boys and 4 girls, four children are to be selected. In how many different ways can they
be selected such that at least one boy should be there?
A. 159
B. 209
C. 201
D. 212

3. From a group of 7 men and 6 women, five persons are to be selected to form a committee so that at least
3 men are there in the committee. In how many ways can it be done?
A. 624
B. 702
C. 756
D. 812

Answer: Option C
Explanation:

From a group of 7 men and 6 women, five persons are to be selected with at least 3 men.
Hence we have the following 3 options.
We can select 5 men ...(option 1)
Number of ways to do this = 7C5
We can select 4 men and 1 woman ...(option 2)
Number of ways to do this = 7C4 6C1
We can select 3 men and 2 women ...(option 3)
Number of ways to do this = 7C3 6C2
Total number of ways
= 7C5 + (7C4 6C1) + (7C3 6C2)
= 7C2 + (7C3 6C1) + (7C3 6C2)[ nCr = nC(n - r) ]
=7621+7653216
+7653216521
=21+210+525=756
4. In how many different ways can the letters of the word 'OPTICAL' be arranged so that the vowels always
come together?
A. 610
B. 720
C. 825
D. 920
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option B
Explanation:
The word 'OPTICAL' has 7 letters. It has the vowels 'O','I','A' in it and these 3 vowels should always come
together. Hence these three vowels can be grouped and considered as a single letter. That is, PTCL(OIA).
Hence we can assume total letters as 5 and all these letters are different.
Number of ways to arrange these letters
=5!=54321=120

All the 3 vowels (OIA) are different

Number of ways to arrange these vowels among themselves
=3!=321=6

Hence, required number of ways

=1206=720
5. In how many different ways can the letters of the word 'CORPORATION' be arranged so that the vowels
always come together?
A. 47200
B. 48000
C. 42000
D. 50400
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option D
Explanation:
The word 'CORPORATION' has 11 letters. It has the vowels 'O','O','A','I','O' in it and these 5 vowels should
always come together. Hence these 5 vowels can be grouped and considered as a single letter. that is,
CRPRTN(OOAIO).
Hence we can assume total letters as 7. But in these 7 letters, 'R' occurs 2 times and rest of the letters are
different.
Number of ways to arrange these letters
=7!2!=765432121=2520

In the 5 vowels (OOAIO), 'O' occurs 3 and rest of the vowels are different.
Number of ways to arrange these vowels among themselves =5!3!=54321321=20
Hence, required number of ways
=252020=50400

6. In how many ways can a group of 5 men and 2 women be made out of a total of 7 men and 3 women?
A. 1
B. 126
C. 63
D. 64
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option C

Explanation:
We need to select 5 men from 7 men and 2 women from 3 women.
Number of ways to do this
= 7C5 3C2
= 7C2 3C1 [ nCr = nC(n-r)]
=76213=213=63
7. In how many different ways can the letters of the word 'MATHEMATICS' be arranged such that the vowels
must always come together?
A. 9800
B. 100020
C. 120960
D. 140020
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option C
Explanation:
The word 'MATHEMATICS' has 11 letters. It has the vowels 'A','E','A','I' in it and these 4 vowels must always
come together. Hence these 4 vowels can be grouped and considered as a single letter. That is,
MTHMTCS(AEAI).
Hence we can assume total letters as 8. But in these 8 letters, 'M' occurs 2 times, 'T' occurs 2 times but rest of the
letters are different.
Hence,number of ways to arrange these letters
=8!(2!)(2!)
=87654321(21)(21)=10080
In the 4 vowels (AEAI), 'A' occurs 2 times and rest of the vowels are different.
Number of ways to arrange these vowels among themselves =4!2!=432121=12
Hence, required number of ways
=1008012=120960
8. There are 8 men and 10 women and you need to form a committee of 5 men and 6 women. In how many ways
can the committee be formed?
A. 10420
B. 11
C. 11760
D. None of these
Hide Answer
| Discuss
|

Notebook
answer with explanation
Answer: Option C
Explanation:
We need to select 5 men from 8 men and 6 women from 10 women
Number of ways to do this
= 8C5 10C6
= 8C3 10C4 [ nCr = nC(n-r)]
=(876321)(109874321)=56210=11760
9. How many 3-letter words with or without meaning, can be formed out of the letters of the word,
'LOGARITHMS', if repetition of letters is not allowed?
A. 720
B. 420
C. None of these
D. 5040
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option A
Explanation:
The word 'LOGARITHMS' has 10 different letters.
Hence, the number of 3-letter words(with or without meaning) formed by using these letters
= 10P3
=1098=720
10. In how many different ways can the letters of the word 'LEADING' be arranged such that the vowels should
always come together?
A. None of these
B. 720
C. 420
D. 122
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option B
Explanation:

The word 'LEADING' has 7 letters. It has the vowels 'E','A','I' in it and these 3 vowels should always come
together. Hence these 3 vowels can be grouped and considered as a single letter. that is, LDNG(EAI).
Hence we can assume total letters as 5 and all these letters are different. Number of ways to arrange these letters
=5!=54321=120

In the 3 vowels (EAI), all the vowels are different. Number of ways to arrange these vowels among themselves
=3!=321=6
Hence, required number of ways
=1206=720
11. A coin is tossed 3 times. Find out the number of possible outcomes.
A. None of these
C. 2
Hide Answer
|
| Discuss
Notebook
answer with explanation

B. 8
D. 1

Answer: Option B
Explanation:
When a coin is tossed once, there are two possible outcomes: Head(H) and Tale(T)
Hence, when a coin is tossed 3 times, the number of possible outcomes
=222=8

(The possible outcomes are HHH, HHT, HTH, HTT, THH, THT, TTH, TTT )
12. In how many different ways can the letters of the word 'DETAIL' be arranged such that the vowels must
occupy only the odd positions?
A. None of these
B. 64
C. 120
D. 36
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option D
Explanation:

The word 'DETAIL' has 6 letters which has 3 vowels (EAI) and 3 consonants(DTL)
The 3 vowels(EAI) must occupy only the odd positions. Let's mark the positions as (1) (2) (3) (4) (5) (6). Now,
the 3 vowels should only occupy the 3 positions marked as (1),(3) and (5) in any order.
Hence, number of ways to arrange these vowels
= 3P3 =3!=321=6

Now we have 3 consonants(DTL) which can be arranged in the remaining 3 positions in any order. Hence,
number of ways to arrange these consonants
= 3P3=3!=321=6
Total number of ways
= number of ways to arrange the vowels number of ways to arrange the consonants
=66=36
13. A bag contains 2 white balls, 3 black balls and 4 red balls. In how many ways can 3 balls be drawn from the
bag, if at least one black ball is to be included in the draw?
A. 64
B. 128
C. 32
D. None of these
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option A
Explanation:
From 2 white balls, 3 black balls and 4 red balls, 3 balls are to be selected such that at least one black ball should
be there.
Hence we have 3 choices as given below
We can select 3 black balls...(option 1)
We can select 2 black balls and 1 non-black ball ...(option 2)
We can select 1 black ball and 2 non-black balls ...(option 3)
Number of ways to select 3 black balls
= 3C3
Number of ways to select 2 black balls and 1 non-black ball
= 3C2 6C1
Number of ways to select 1 black ball and 2 non-black balls
= 3C1 6C2
Total number of ways

= 3C3 + 3C2 6C1 + 3C1 6C2

= 3C3 + 3C1 6C1 + 3C1 6C2[ nCr = nC(n-r)]
=1+36+36521=1+18+45=64
14. In how many different ways can the letters of the word 'JUDGE' be arranged such that the vowels always
come together?
A. None of these
B. 48
C. 32
D. 64
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option B
Explanation:
The word 'JUDGE' has 5 letters. It has 2 vowels (UE) and these 2 vowels should always come together. Hence
these 2 vowels can be grouped and considered as a single letter. That is, JDG(UE).
Hence we can assume total letters as 4 and all these letters are different. Number of ways to arrange these letters
=4!=4321=24

In the 2 vowels (UE), all the vowels are different. Number of ways to arrange these vowels among themselves
=2!=21=2
Total number of ways =242=48
15. In how many ways can the letters of the word 'LEADER' be arranged?
A. None of these
C. 360
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option C
Explanation:
The word 'LEADER' has 6 letters.
But in these 6 letters, 'E' occurs 2 times and rest of the letters are different.

B. 120
D. 720

Hence,number of ways to arrange these letters

=6!2!=65432121=360
16. How many words can be formed by using all letters of the word 'BIHAR'?
A. 720
B. 24
C. 120
D. 60
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option C
Explanation:
The word 'BIHAR' has 5 letters and all these 5 letters are different.
Total number of words that can be formed by using all these 5 letters
= 5P5 =5!
=54321=120
17. How many arrangements can be made out of the letters of the word 'ENGINEERING' ?
A. 924000
B. 277200
C. None of these
D. 182000
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option B
Explanation:
The word 'ENGINEERING' has 11 letters.
But in these 11 letters, 'E' occurs 3 times,'N' occurs 3 times, 'G' occurs 2 times, 'I' occurs 2 times and rest of the
letters are different.
Hence,number of ways to arrange these letters
=11!(3!)(3!)(2!)(2!)=111098765432(32)(32)(2)(2)=277200
18. How many 3 digit numbers can be formed from the digits 2, 3, 5, 6, 7 and 9 which are divisible by 5 and
none of the digits is repeated?

A. 20
C. 8
Hide Answer
|
Notebook
answer with explanation

B. 16
D. 24
| Discuss

Answer: Option A
Explanation:
A number is divisible by 5 if the its last digit is 0 or 5
We need to find out how many 3 digit numbers can be formed from the 6 digits (2,3,5,6,7,9)
which are divisible by 5.
Since the 3 digit number should be divisible by 5, we should take the digit 5 from the 6 digits(2,3,5,6,7,9) and fix
it at the unit place. There is only 1 way of doing this.
1
Since the number 5 is placed at unit place, we have now five digits(2,3,6,7,9) remaining. Any of these 5 digits
can be placed at tens place
5

Since the digit 5 is placed at unit place and another one digit is placed at tens place, we have now four digits
remaining. Any of these 4 digits can be placed at hundreds place.
4

Required Number of three digit numbers

=451=20
19. How many words with or without meaning, can be formed by using all the letters of the word, 'DELHI' using
each letter exactly once?
A. 720
B. 24
C. None of these
D. 120
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option D

Explanation:
The word 'DELHI' has 5 letters and all these letters are different.
Total number of words (with or without meaning) that can be formed using all these 5 letters using each letter
exactly once
= Number of arrangements of 5 letters taken all at a time
= 5P5 =5!=54321=120
20. What is the value of 100P2 ?
A. 9801
C. 5600
Hide Answer
|
Notebook
answer with explanation

B. 12000
D. 9900
| Discuss

Answer: Option D
Explanation:
100

P2 =10099=9900

21. In how many different ways can the letters of the word 'RUMOUR' be arranged?
A. None of these
B. 128
C. 360
D. 180
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option D
Explanation:
The word 'RUMOUR' has 6 letters.
In these 6 letters, 'R' occurs 2 times, 'U' occurs 2 times and rest of the letters are different.
Hence, number of ways to arrange these letters
=6!(2!)(2!)=6543222=180
22. There are 6 periods in each working day of a school. In how many ways can one organize 5 subjects such
that each subject is allowed at least one period?

A. 3200
C. 1800
Hide Answer
|
Notebook
answer with explanation

B. None of these
D. 3600
| Discuss

Answer: Option C
Explanation:
Solution 1
5 subjects can be arranged in 6 periods in 6P5 ways.
Any of the 5 subjects can be organized in the remaining period (5C1 ways).
Two subjects are alike in each of the arrangement. So we need to divide by 2! to avoid overcounting.
Total number of arrangements
= 6P5 5C12!=1800
Solution 2
5 subjects can be selected in 5C5 ways.
1 subject can be selected in 5C1 ways.
These 6 subjects can be arranged themselves in 6! ways.
Since two subjects are same, we need to divide by 2!
Therefore, total number of arrangements
= 5C5 5C16!2!=1800
Solution 3
Select any 5 periods (6C5 ways).
Allocate a different subject to each of these 5 periods (1 way).
These 5 subjects can be arranged themselves in 5! ways.
Select the 6th period (1 way).
Allocate a subject to this period (5C1 ways).
Two subjects are alike in each of the arrangement. So we need to divide by 2! to avoid overcounting.
Therefore, required number of ways
= 6C515!1 5C12!=1800

Solution 4
There are 5 subjects and 6 periods. Each subject must be allowed in at least one period. Therefore, two periods
will have same subject and remaining four periods will have different subjects.
Select the two periods where the same subject is taught. This can be done in 6C2 ways.
Allocate a subject two these two periods(5C1 ways).
Remaining 4 subjects can be arranged in the remaining 4 periods in 4! ways.
Required number of ways
= 6C2 5C1 4! = 1800
23. How many 6 digit telephone numbers can be formed if each number starts with 35 and no digit appears more
than once?
A. 720
B. 360
C. 1420
D. 1680
View Answer
|
| Discuss
Notebook
24. An event manager has ten patterns of chairs and eight patterns of tables. In how many ways can he make a
pair of table and chair?
A. 100
B. 80
C. 110
D. 64
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option B
Explanation:
He has 10 patterns of chairs and 8 patterns of tables
A chair can be selected in 10 ways.
A table can be selected in 8 ways.
Hence one chair and one table can be selected in 108
ways =80
ways

25. 25 buses are running between two places P and Q. In how many ways can a person go from P to Q and return
by a different bus?
A. None of these
B. 600
C. 576
D. 625
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option B
Explanation:
He can go in any of the 25 buses (25 ways).
Since he cannot come back in the same bus, he can return in 24 ways.
Total number of ways =2524=600
26. A box contains 4 red, 3 white and 2 blue balls. Three balls are drawn at random. Find out the number of ways
of selecting the balls of different colours?
A. 62
B. 48
C. 12
D. 24
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option D
Explanation:
1 red ball can be selected in 4C1 ways.
1 white ball can be selected in 3C1 ways.
1 blue ball can be selected in 2C1 ways.
Total number of ways
= 4C1 3C1 2C1
=432=24
27. A question paper has two parts P and Q, each containing 10 questions. If a student needs to choose 8 from
part P and 4 from part Q, in how many ways can he do that?
A. None of these
B. 6020
C. 1200
D. 9450

View Answer
|
Notebook

| Discuss

28. In how many different ways can 5 girls and 5 boys form a circle such that the boys and the girls alternate?
A. 2880
B. 1400
C. 1200
D. 3212
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option A
Explanation:
Around a circle, 5 boys can be arranged in 4! ways.
Given that the boys and the girls alternate. Hence there are 5 places for the girls. Therefore the girls can be
arranged in 5! ways.
Total number of ways
=4!5!=24120=2880
29. Find out the number of ways in which 6 rings of different types can be worn in 3 fingers?
A. 120
B. 720
C. 125
D. 729
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option D
Explanation:
The first ring can be worn in any of the 3 fingers (3 ways).
Similarly each of the remaining 5 rings also can be worn in 3 ways.
Hence total number of ways
=333333=36=729
30. In how many ways can 5 man draw water from 5 taps if no tap can be used more than once?
A. None of these
B. 720

C. 60
Hide Answer
|
Notebook
answer with explanation

D. 120
| Discuss

Answer: Option D
Explanation:
1st man can draw water from any of the 5 taps.
2nd man can draw water from any of the remaining 4 taps.
3rd man can draw water from any of the remaining 3 taps.
4th man can draw water from any of the remaining 2 taps.
5th man can draw water from remaining 1 tap.
5

Hence total number of ways

=54321=120
Problems on Permutations and Combinations - Solved Examples(Set 2)
31. How many two digit numbers can be generated using the digits 1,2,3,4 without repeating any digit?
A. 4
B. 10
C. 12
D. 16
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option C
Explanation:
We have four digits 1,2,3,4. The first digit can be any of these four digits.
4
Now we have already chosen the first digit. Since we cannot repeat the digits, we are left with 3 digits now. The
second digit can be any of these three digits.
4

Since the first digit can be chosen in 4 ways and second digit can be chosen in 3 ways, both the digits can be
chosen in 43=12

ways. [Reference: Multiplication Theorem]

i.e., 12 two digit numbers can be formed.
32. There are three places P, Q and R such that 3 roads connects P and Q and 4 roads connects Q and R. In how
many ways can one travel from P to R?
A. 8
B. 10
C. 12
D. 14
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option C
Explanation:
Number of ways in which one can travel from P to R
=34=12
[Reference: Multiplication Theorem]
33. There are 10 women and 15 men in an office. In how many ways can a person can be selected?
A. None of these
B. 50
C. 25
D. 150
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option C
Explanation:
Number of ways in which a person can be selected
=10+15=25
[Reference: Addition Theorem]
34. There are 10 women and 15 men in an office. In how many ways a team of a man and a woman can be
selected?
A. None of these
B. 50

C. 25
Hide Answer
|
Notebook
answer with explanation

D. 150
| Discuss

Answer: Option D
Explanation:
Number of ways in which a team of a man and a woman can be selected
=1510=150
[Reference: Multiplication Theorem]
35. In how many ways can three boys can be seated on five chairs?
A. 30
B. 80
C. 60
D. 120
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option C
Explanation:
There are three boys.
The first boy can sit in any of the five chairs (5 ways).
5
Now there are 4 chairs remaining. The second boy can sit in any of the four chairs (4 ways).
5

Now there are 3 chairs remaining. The third boy can sit in any of the three chairs (3 ways).
5

Hence, total number of ways in which 3 boys can be seated on 5 chairs

=543=60

36. There are 6 persons in an office. A group consisting of 3 persons has to be formed. In how many ways can
the group be formed?
A. 30
B. 10
C. 40
D. 20
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option D
Explanation:
Number of ways in which the group can be formed
= 6C3 =654321=20
37. There are 5 yellow, 4 green and 3 black balls in a bag. All the 12 balls are drawn one by one and arranged in
a row. Find out the number of different arrangements possible.
A. 25230
B. 23420
C. 21200
D. 27720
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option D
Explanation:
[Reference: Permutations of objects when all objects are not distinct]
Number of different arrangements possible
=12!5! 4! 3!=12111098765432(5432)(432)(32)=1211109876(432)
(32)=121110987432=11109872=1110947=2521110=27720
38. In how many ways can 7 boys be seated in a circular order?
A. 60
B. 120
C. 5040
D. 720
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option D

Explanation:
[Reference: Circular Permutations: Case 1]
Number of arrangements possible
=(71)!=6!=654321=720
39. In how many ways can 7 beads can be arranged to form a necklace?
A. 720
B. 360
C. 120
D. 60
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option B
Explanation:
[Reference: Circular Permutations: Case 2]
Number of arrangements possible
=12(71)!=126!=12654321=360
40. In how many ways can a team of 5 persons be formed out of a total of 10 persons such that two particular
persons should be included in each team?
A. 56
B. 28
C. 112
D. 120
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option A
Explanation:
Solution 1
Two particular persons should be included in each team. Therefore we have to select remaining 5-2=3 persons
from 10-2=8 persons.
Hence, required number of ways
= 8C3 =876321=87=56

Solution 2
Number of combinations of n distinct things taking r at a time, when s particular things are always to be included
in each selection, is
(n-s)
C(r-s)
[Reference: Case 1: When s particular things are always to be included]
Here n = 10, r = 5, s = 2
Hence, number of ways = (n-s)C(r-s) = 8C3
=876321=87=56
41. In how many ways can a team of 5 persons be formed out of a total of 10 persons such that two particular
persons should not be included in any team?
A. 56
B. 112
C. 28
D. 128
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option A
Explanation:
Solution 1
Two particular persons should not be included in each team.
i.e., we have to select 5 persons from 10-2 = 8 persons.
Hence, required number of ways
= 8C5
= 8C3[ nCr = nC(n-r)]
=876321=87=56

Solution 2
Number of combinations of n distinct things taking r at a time, when s particular things are never included in any
selection, is
(n-s)
Cr

[Reference: Case 3: When s particular things are never included]

Here n = 10, r = 5, s = 2
Hence, number of ways
= (n-s)Cr
= 8C5
= 8C3[ nCr = nC(n - r)]
=876321=87=56
42. How many triangles can be formed by joining the vertices of an octagon?
A. 56
B. 28
C. 112
D. 120
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option A
Explanation:
Number of triangles that can be formed by joining the vertices of a polygon of n sides
= nC3
[Reference]
Here n = 8
Hence, number of triangles that can be formed by joining the vertices of an octagon
= 8C3 =8766=56
43. If there are 9 horizontal lines and 9 vertical lines in a chess board, how many rectangles can be formed in the
chess board?
A. 920
B. 1024
C. 64
D. 1296
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option D
Explanation:

Number of rectangles that can be formed by using m horizontal lines and n vertical lines
= mC2 nC2
[Reference]
Here m = 9, n = 9
Hence, number of rectangles that can be formed
= mC2 nC2
= 9C2 9C2 = (9C2)2
=(9821)2=362=1296

(Note: To save time, we don't need to calculate the actual value of 362. We know that 362 is a number whose last
digit is 6.From the given choices, 1296 is only one number which has 6 as its last digit. Hence it is the answer.)
44. Find the number of diagonals of a decagon?
A. 16
C. 35
Hide Answer
|
Notebook
answer with explanation

B. 28
D. 12
| Discuss

Answer: Option C
Explanation:
Number of diagonals that can be formed by joining the vertices of a polygon of n sides
=n(n3)2
[Reference]
Here n = 10
Hence, number of diagonals
=n(n3)2=10(103)2=1072=57=35
45. Find the number of triangles that can be formed using 14 points in a plane such that 4 points are collinear?
A. 480
B. 360
C. 240
D. 120
Hide Answer
|
| Discuss
Notebook

answer with explanation

Answer: Option B
Explanation:
Suppose there are n points in a plane out of which m points are collinear. Number of triangles that can be formed
by joining these n points as vertices
= nC3 - mC3
[Reference]
Here n = 14, m = 4
Hence, number of triangles
= nC3 - mC3
= 14C3 - 4C3
= 14C3 - 4C1[ nCr = nC(n-r)]
=1413123214=141324=360
46. What is the sum of all 4 digit numbers formed using the digits 2, 3,4 and 5 without repetition?
A. 93324
B. 92314
C. 93024
D. 91242
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option A
Explanation:
If all possible n digit numbers using n distinct non-zero digits are formed, sum of all the numbers so formed
= (n-1)! (Sum of the n digits) (111 ... n times)
[Reference: Sum of all numbers formed from given digits]
Here n=4.
Hence, sum of all 4 digit numbers formed using the digits 2,3,4,5
without repetition
=(41)!(2+3+4+5)(1111)=3!141111=6141111=93324
47. In a birthday party, every person shakes hand with every other person. If there was a total of 28 handshakes
in the party, how many persons were present in the party?
A. 9
B. 8

C. 7
Hide Answer
|
Notebook
answer with explanation

D. 6
| Discuss

Answer: Option B
Explanation:
Suppose there are n
persons present in a party and every person shakes hand with every other person. Then, total number of
handshakes
= nC2=n(n1)2
[Reference: Number of handshakes]
n(n1)2=28n(n1)=282n(n1)=56n=8

Note: To find out the value of n

from the equation n(n1)=56, use any of the following methods
Method 1: Trial and error method
Just substitute the values given in the choices and find the value which satisfies the equation.
n(n1)=56
If n=6, n(n1)=6556
If n=7, n(n1)=7656
If n=9, n(n1)=9856
If n=8, n(n1)=87=56
Hence n=8 is the answer.
Method 2: By Factoring [Reference: How to Solve Quadratic Equations]
n(n1)=56n2n56=0(n8)(n+7)=0n=8 or 7
Since n cannot be negative, n=8
Method 3: By Quadratic Formula [Reference: How to Solve Quadratic Equations]
n(n1)=56n2n56=0n=bb24ac2a=1(1)241(56)21=11+2242=12252=1152=162 or 142=8
or 7
Since n cannot be negative, n=8

48. There are 8 points in a plane out of which 3 are collinear. How many straight lines can be formed by joining
them?
A. 16
B. 26
C. 22
D. 18
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option B
Explanation:
Suppose there are n points in a plane out of which m points are collinear. Number of straight lines that can be
formed by joining these n points
n
C2 - mC2 + 1
[Reference]
Here n=8, m=3
Required number of straight lines
= nC2 - mC2 + 1
= 8C2 - 3C2 + 1
= 8C2 - 3C1 + 1 [ nCr = nC(n-r)]
=87213+1=283+1=26
49. How many quadrilaterals can be formed by joining the vertices of an octagon?
A. 60
B. 70
C. 65
D. 74
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option B
Explanation:
Number of quadrilaterals that can be formed by joining the vertices of a polygon of n sides
= nC4
[Reference]
Here n=8

Required number of quadrilaterals

n
C4 = 8C4=87654321=8754=275=710=70
50. How many straight lines can be formed by joining 12 points on a plane out of which no points are collinear?
A. 72
B. 66
C. 58
D. 62
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option B
Explanation:
Suppose there are n points in a plane out of which no points are collinear. Number of straight lines that can be
formed by joining these n points
= nC2
[Reference]
Here n=12
Required number of straight lines
= nC2 = 12C2
=121121=611=66
51. If nC8 = nC27 , what is the value of n?
A. 35
C. 28
Hide Answer
|
Notebook
answer with explanation
Answer: Option A
Explanation:
If nCx = nCy then either x = y or (n-x) = y
[Reference]
n

C8 = nC27
=> n 8 = 27
=> n = 27 + 8 = 35

B. 22
D. 41
| Discuss

52. In how many ways can 10 students can be arranged in a row?

A. 9!
B. 6!
C. 8!
D. 10!
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option D
Explanation:
10 students can be arranged in a row in 10P10 = 10! ways.
53. Find the number of triangles which can be drawn out of n given points on a circle?
A. (n+1)C1
B. nC1
C. (n+1)C3
D. nC3
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option D
Explanation:
Suppose there are n points in a plane out of which no three points are collinear. Number of triangles that can be
formed by joining these n points
= nC3
[Reference]
Since all these n
points are on a circle, no three points are collinear.
Hence required number of triangles = nC3
54. In how many ways can 10 books be arranged on a shelf such that a particular pair of books should always be
together?
A. 9! 2!
B. 9!
C. 10! 2!
D. 10!
Hide Answer
| Discuss
|

Notebook
answer with explanation
Answer: Option A
Explanation:
We have a total of 10 books.
Given that a particular pair of books should always be together. Hence, just tie these two books together and
consider as a single book.
Hence we can take total number of books as 9. These 9 books can be arranged in 9P9 =9!
ways.
We had tied two books together. These books can be arranged among themselves in 2P2 =2! ways.
Hence, required number of ways
=9!2!
55. In how many ways can 10 books be arranged on a shelf such that a particular pair of books will never be
together?
A. 9! 8
B. 9!
C. 9! 2!
D. 10! 2!
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option A
Explanation:
Total number of ways in which we can arrange 10 books on a shelf
= 10P10 =10!
(A)
Now we will find out total number of ways in which 10 books can be arranged on a shelf such that a particular
pair of books will always be together.
We have a total of 10 books. If a particular pair of books must always be together, just tie these two books
together and consider as a single book. Hence we can take total number of books as 9. These 9 books can be
arranged in 9P9 =9! ways.
We had tied two books together. These books can be arranged among themselves in 2P2 =2! ways.

Hence, total number of ways in which 10 books can be arranged on a shelf such that a particular pair of books
will always be together
=9!2! (B)
From (A) and (B),
Total number of ways in which 10 books can be arranged on a shelf such that a particular pair of books will never
be together
=10!(9!2!)=10!(9!2)=(9!10)(9!2)=9!(102)=9!8
56. Arun wants to send invitation letter to his 7 friends. In how many ways can he send the invitation letter if he
has 4 servants to carry the invitation letters?
A. 16384
B. 10801
C. 14152
D. 12308
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option A
Explanation:
The 1st friend can be invited by any of the 4 servants.
Similarly each of the remaining 6 friends can be invited by any of the 4 servants.
Hence total number of ways =47=16384

(Note: In this question, we do not want to waste time by expanding 47. We know that any power of 4 can only
end with 4 or 6 . (Because 44=16, 64=24,
). In the given choices, only 16384 ends with 4 and no value ends with 6. Hence, 16384 is the answer.)
57. How many three digit numbers divisible by 5 can be formed using any of the digits from 0 to 9 such that
none of the digits can be repeated?
A. 108
B. 112
C. 124
D. 136
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option D
Explanation:

A number is divisible by 5 if the its last digit is 0 or 5

[Reference]
We need to find out how many 3 digit numbers divisible by 5 can be formed from the 10
digits (0,1,2,3,4,5,6,7,8,9)
without repetition.
Since the 3 digit number must be divisible by 5, we can have 0 or 5 at the units place. We will take these as two
cases.
Case 1: Three digit numbers ending with 0
Place 0 at the units place. There is only 1 way of doing this.
1
Since the number 0 is placed at units place, we have now 9 digits (1,2,3,4,5,6,7,8,9) remaining. Any of these 9
digits can be placed at tens place.
9

Since the digit 0 is placed at units place and another one digit is placed at tens place, we have now 8 digits
remaining. Any of these 8 digits can be placed at hundreds place.
8

Total number of 3 digit numbers ending with 0

=891=72
(A)
Case 2: Three digit numbers ending with 5
Place 5 at the units place. There is only 1 way of doing this.
1
Since the number 5 is placed at units place, we have now 9 digits (0,1,2,3,4,6,7,8,9) remaining. But, from these
remaining digits, 0 cannot be used at hundreds place. Hence any of 8 digits (1,2,3,4,6,7,8,9) can be placed at
hundreds place.
8

Since the digit 5 is placed at units place and another one digit is placed at hundreds place, we have now 8 digits
remaining. Any of these 8 digits can be placed at tens place.

Therefore, total number of 3 digit numbers ending with 5

=881=64
(B)
Hence, required number of 3 digit numbers
=72+64=136
( from A and B)
58. How many numbers, between 100 and 1000, can be formed with the digits 3,4,5,0,6,7
? (repetition of digits is not allowed)
A. 142
B. 120
C. 100
D. 80
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option C
Explanation:
Here we can take only 3 digit numbers, between 100 and 1000.
We have 6 digits (3,4,5,0,6,7)
. But in these 6 digits, 0 cannot be used at the hundreds place. Hence any of the 5 digits (3,4,5,6,7)
can be placed at hundreds place.
5
Since one digit is placed at hundreds place, we have 5 digits remaining. Any of these 5 digits can be placed at
units place.
5

Since one digit is placed hundreds place and another digit is placed at units place, we have 4 digits remaining.
Any of these 4 digits can be placed at tens place.
5

Hence, required number of 3 digit numbers

=545=100
59. A telegraph has 10 arms and each arm can take 5 distinct positions (including position of the rest). How
many signals can be made by the telegraph?
A. 10P5
B. 510 - 1
C. 510
D. 10P5 - 1
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option B
Explanation:
The 1st arm can take any of the 5 distinct positions. Similarly, each of the remaining 9 arms can take any of the 5
distinct positions.
Hence, total number of signals =510

But there is one arrangement when all the arms are in rest. In this case there will not be any signal.
Hence required number of signals
=5101
60. There are two books each of 5 volumes and two books each of two volumes. In how many ways can these
books be arranged in a shelf so that the volumes of the same book should remain together?
A. 4! 5! 2!
B. 4! 14!
C. 14!
D. 4! 5! 5! 2! 2!
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option D
Explanation:
1 book: 5 volume
1 book: 5 volume
1 book: 2 volume
1 book: 2 volume
Given that volumes of the same book should remain together. Hence, just tie the same volume books together

and consider as a single book. Hence we can take total number of books as 4. These 4 books can be arranged in
4
P4 =4!
ways.
5 volumes of the 1st book can be arranged among themselves in 5P5 =5! ways.
5 volumes of the 2st book can be arranged among themselves in 5P5 =5! ways.
2 volumes of the 3rd book can be arranged among themselves in 2P2 =2! ways.
2 volumes of the 4th book can be arranged among themselves in 2P2 =2! ways.
Hence total number of ways
=4!5!5!2!2!
Problems on Permutations and Combinations - Solved Examples(Set 3)
61. In how many ways can 11 persons be arranged in a row such that 3 particular persons should always be
together?
A. 9!3!
B. 9!
C. 11!
D. 11!3!
Hide Answer
|
Notebook
answer with explanation

| Discuss

Answer: Option A
Explanation:
Given that three particular persons should always be together. Hence, just group these three persons together and
consider as a single person.
Therefore we can take total number of persons as 9. These 9 persons can be arranged in 9!
ways.
We had grouped three persons together. These three persons can be arranged among themselves in 3! ways.
Hence, required number of ways
=9!3!

62. In how many ways can 9 different colour balls be arranged in a row so that black, white, red and green balls
are never together?
A. 146200
B. 219600
C. 314562
D. 345600
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option D
Explanation:
Total number of ways in which 9 different colour balls can be arranged in a row
=9!
(A)
Now we will find out total number of ways in which 9 different colour balls can be arranged in a row so that
black, white, red and green balls are always together.
We have total 9 balls. Since black, white, red and green balls are always together, group these 4 balls together
and consider as a single ball. Hence we can take total number of balls as 6. These 6 balls can be arranged in 6!
ways.
We had grouped 4 balls together. These 4 balls can be arranged among themselves in 4! ways.
Hence, total number of ways in which 9 different colour balls be arranged in a row so that black, white, red and
green balls are always together
=6!4! (B)
From (A) and (B),
Total number of ways in which 9 different colour balls can be arranged in a row so that black, white, red and
green balls are never together
=9!6!4!=6!7896!4!=6!(7894!)=6!(50424)=6!480=720480=345600
63. A company has 11 software engineers and 7 civil engineers. In how many ways can they be seated in a row
so that no two of the civil engineers will sit together?
A. 12!
B. 11!12!5!
C. 11!
D. 1212!5!
Hide Answer
|
Notebook

| Discuss

answer with explanation

Answer: Option B
Explanation:
11 software engineers can be arranged in 11!
ways. ...(A)
Now we need to arrange civil engineers such that no two civil engineers can be seated together. i.e., we can
arrange 7 civil engineers in any of the 12 (=11+1) positions marked as * below.
* 1 * 2 * 3 * 4 * 5 * 6 * 7 * 8 * 9 * 10 * 11 *
(where 1, 2 11 represent software engineers)
This can be done in 12P7 ways. ...(B)
From (A) and (B),
required number of ways
= 11! 12P7
=11!12!5!
64. A company has 11 software engineers and 7 civil engineers. In how many ways can they be seated in a row
so that all the civil engineers do not sit together?
A. 18! (12! 7!)
B. 18P4 - 2!
C. 18P4 11
D. 18! (11! 7!)
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option A
Explanation:
Total number of engineers =11+7=18
.
These 18 engineers can be arranged in a row in 18! ways. ...(A)
Now we will find out the total number of ways in which these 18 engineers can be arranged so that all the 7 civil
engineers will always sit together.
For this, group all the 7 civil engineers and consider as a single civil engineer. Hence, we can take total number
of engineers as 12. These 12 engineers can be arranged in 12! ways.
We had grouped 7 civil engineers. These 7 civil engineers can be arranged among themselves in 7! ways.

Hence, total number of ways in which the 18 engineers can be arranged so that the 7 civil engineers will always
sit together
=12!7! (B)
From (A) and (B),
Total number of ways in which 11 software engineers and 7 civil engineers can be seated in a row so that all the
civil engineers do not sit together
=18!(12!7!)
65. In how many ways can 11 software engineers and 10 civil engineers be seated in a row so that they are
positioned alternatively?
A. 7! 7!
B. 6! 7!
C. 10! 11!
D. 11! 11!
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option C
Explanation:
10 civil engineers can be arranged in a row in 10!
ways ---(A)
Now we need to arrange software engineers such that software engineers and civil engineers are seated
alternatively. Therefore we can arrange 11 software engineers in the 11 positions marked as * below.
* 1 * 2 * 3 * 4 * 5 * 6 * 7 * 8 * 9 *10 *
(where 1, 2 10 represent civil engineers)
This can be done in 11! ways ...(B)
From (A) and (B),
required number of ways =10!11!
66. In how many ways can 10 software engineers and 10 civil engineers be seated in a row so that they are
positioned alternatively?
A. 2(10!)2
B. 210!11!
C. 10!11!
D. (10!)2
Hide Answer
|
Notebook

| Discuss

answer with explanation

Answer: Option A
Explanation:
10 civil engineers can be arranged in a row in 10!
ways ...(A)
Now we need to arrange software engineers such that software engineers and civil engineers are seated
alternatively. i.e., we can arrange 10 software engineers either in the 10 positions marked as A,B,C,D,E,F,G,H,I,J
or in the 10 positions marked as B,C,D,E,F,G,H,I,J,K, as shown below.

10 software engineers can be arranged in the 10 positions marked as A,B,C,D,E,F,G,H,I,J in 10! ways.
10 software engineers can be arranged in the 10 positions marked as B,C,D,E,F,G,H,I,J,K in 10! ways.
10 software engineers can be arranged in the 10 positions marked as A,B,C,D,E,F,G,H,I,J or in the 10 positions
marked as B,C,D,E,F,G,H,I,J,K in 10!+10!=210! ways ...(B)
From (A) and (B),
required number of ways =10!(210!)=2(10!)2
67. Kiran has 8 black balls and 8 white balls. In how many ways can he arrange these balls in a row so that balls
of different colours alternate?
A. 8!7!
B. 28!7!
C. 2(8!)2
D. (8!)2
Hide Answer
|
Notebook
answer with explanation
Answer: Option C
Explanation:

| Discuss

8 black balls can be arranged in 8! ways ...(A)

Now we need to arrange white balls such that white balls and black balls are positioned alternatively. i.e., we can
arrange 8 white balls either in the 8 positions marked as A,B,C,D,E,F,G,H or in the 8 positions marked as
B,C,D,E,F,G,H,I as shown below.

8 white balls can be arranged in the 8 positions marked as A,B,C,D,E,F,G,H in 8! ways.

8 white balls can be arranged in the 8 positions marked as B,C,D,E,F,G,H,I in 8! ways.
8 white balls can be arranged in the 8 positions marked as A,B,C,D,E,F,G,H or in the 8 positions marked as
B,C,D,E,F,G,H,I in 8!+8!=28!
ways ...(B)
From (A) and (B),
required number of ways =8!28!=2(8!)2
68. A company has 11 software engineers and 7 civil engineers. In how many ways can they be seated in a row
so that all the civil engineers are always together?
A. 18! 2
B. 12! 7!
C. 11! 7!
D. 18!
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option B
Explanation:
All the 7 civil engineers are always together. Hence, group all the 7 civil engineers and consider as a single civil
engineer. Hence, we can take total number of engineers as 12. These 12 engineers can be arranged in 12!
ways ...(A)
We had grouped 7 civil engineers. These 7 civil engineers can be arranged among themselves in 7! ways ...(B)
From (A) and (B),
required number of ways =12!7!
69. A company has 10 software engineers and 6 civil engineers. In how many ways can they be seated around a

round table so that no two of the civil engineers will sit together?
A. 15!
B. 9!10!4!
C. 10!11!5!
D. 16!
Hide Answer
|
Notebook
answer with explanation

| Discuss

Answer: Option B
Explanation:
[Reference : Circular permutations - Case 1]
10 software engineers can be arranged around a round table in (101)!=9!
ways ...(A)
Now we need to arrange civil engineers such that no two civil engineers can be seated together. i.e., we can
arrange 6 civil engineers in any of the 10 positions marked as * below.

This can be done in 10P6 ways ...(B)

From (A) and (B),
required number of ways = 9! 10P6
=9!10!4!
70. A company has 10 software engineers and 6 civil engineers. In how many ways can they be seated around a
round table so that all the civil engineers do not sit together?
A. 16! (11! 6!)
B. 15! (10! 6!)
C. 16!
D. 15!
Hide Answer
|
| Discuss
Notebook

answer with explanation

Answer: Option B
Explanation:
[Reference : Circular Permutations - Case 1]
Total number of engineers =10+6=16

Number of ways in which these 16 engineers can be arranged around a round table
=(161)!=15! ...(A)
Now we will find out number of ways in which these 16 engineers can be arranged around a round table so that
all the 6 civil engineers will always sit together. For this, group all the 6 civil engineers and consider as a single
civil engineer. Hence, we can take total number of engineers as 11. These 11 engineers can be arranged around a
round table in (111)!=10! ways.
We had grouped 6 civil engineers. These 6 civil engineers can be arranged among themselves in 6! ways.
Hence, number of ways in which the 16 engineers can be arranged around a round table so that all the 6 civil
engineers will always sit together
=10!6! ...(B)
From (A) and (B),
number of ways in which 10 software engineers and 6 civil engineers can be seated around a round table so that
all the civil engineers do not sit together
=15!(10!6!)
71. In how many ways can 10 software engineers and 10 civil engineers be seated around a round table so that
they are positioned alternatively?
A. 9! 10!
B. 10! 10!
C. 2 (10!)2
D. 2 9! 10!
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option A
Explanation:
[Reference : Circular Permutations: Case 1]
10 civil engineers can be arranged around a round table in
(101)!=9!

ways ...(A)
Now we need to arrange software engineers such that software engineers and civil engineers are seated
alternatively. i.e., we can arrange 10 software engineers in the 10 positions marked as * as shown below.

This can be done in 10! ways ...(B)

From (A) and (B),
required number of ways =9!10!
72. A company has 10 software engineers and 6 civil engineers. In how many ways can they be seated around a
round table so that all the civil engineers are together?
A. 10! 6!
B. 11! 6!
2
C. (10!)
D. 9! 6!
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option A
Explanation:
[Reference : Circular permutations - Case 1]
We need to find out number of ways in which 10 software engineers and 6 civil engineers can be arranged around
a round table so that all the 6 civil engineers will always sit together.
For this, group all the 6 civil engineers and consider as a single civil engineer. Hence, we can take total number
of engineers as 11. These 11 engineers can be arranged around a round table in (111)!=10!
ways ...(A)
We had grouped 6 civil engineers. These 6 civil engineers can be arranged among themselves in 6! ways ...(B)
From (A) and (B),
required number of ways =10!6!
73. How many 8 digit mobile numbers can be formed if any digit can be repeated and 0 can also start the mobile

number?
A. 10P8
C. 10P7
Hide Answer
|
Notebook
answer with explanation

B. 108
D. 10P6
| Discuss

Answer: Option B
Explanation:
Here the digits(0,1,2,3,4,5,6,7,8,9) can be repeated and 0 can also be used to start the mobile number. Hence, any
of the 10 digits can be placed at each place of the 8 digit number.
10

10

10

10

10

10

10

10

Hence, required number of 8 digit mobile numbers

=108
74. How many 8 digits mobile numbers can be formed if at least one of their digits is repeated and 0 can also
start the mobile number?
A. 108 - 10P7
B. 107
C. 108
D. 108 - 10P8
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option D
Explanation:
Initially we will find out number of 8 digits mobile numbers that can be formed if any digit can be repeated (with
0 can also start the mobile number).
The digits can be repeated and 0 can also be used to start the mobile number. Hence, any of the 10
digits(0,1,2,3,4,5,6,7,8,9) can be placed at each place of the 8 digit number.
10

10

10

10

10

10

10

10

Hence, number of 8 digit mobile numbers that can be formed if any digit can be repeated (with 0 can also start
the mobile number)
=108

(A)
Now we will find out number of 8 digits mobile numbers that can be formed if no digit can be repeated (with 0
can also start the mobile number). In this case, any of the 10 digits can be placed at the 1st position.
Since one digit is placed at the 1st position, any of the remaining 9 digits can be placed at the 2nd position.
Since one digit is placed at the 1st position and another digit is placed at the 2nd position, any of the remaining 8
digits can be placed at the 3rd position.
So on
10

i.e., number of 8 digits mobile numbers that can be formed if no digit can be repeated (with 0 can also start the
mobile number)
= 10P8 ...(B)
(In fact you should directly get (A) and (B) without any calculations from the definition of permutations itself.)
From(A) and (B),
number of 8 digits mobile numbers that can be formed if at least one of their digits is repeated and 0 can also
start the mobile number
= 108 - 10P8
75. How many 8 digits mobile numbers can be formed if at least one of their digits is repeated and 0 cannot be
used to start the mobile number?
A. 108 - 10P7
B. 107
C. 9 107 - 9 9P7
D. 108 - 10P8
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option C
Explanation:
Initially we will find out number of 8 digits mobile numbers that can be formed if any digit can be repeated (0
cannot be used to start the mobile number).
The digits can be repeated. 0 cannot be used to start the mobile number. Hence, any of the 9 digits ( any digit
except 0) can be placed at the 1st position.
Then, any of the 10 digits can be placed at each of the the remaining 7 positions of the 8 digit number.
9

10

10

10

10

10

10

10

Hence, number of 8 digit mobile numbers that can be formed if any digit can be repeated and 0 cannot be used to
start the mobile number
=9107
(A)
Now we will find out number of 8 digits mobile numbers that can be formed if no digit can be repeated (0 cannot
be used to start the mobile number).
Here, any of the 9 digits ( any digit except 0) can be placed at the 1st position.
Since one digit is placed at the 1st position, any of the remaining 9 digits can be placed at 2nd position.
Since one digit is placed at the 1st position and another digit is placed at the 2nd position, any of the remaining 8
digits can be placed at the 3rd position.
So on
9

i.e., number of 8 digits mobile numbers that can be formed if no digit can be repeated and 0 cannot be used to
start the mobile number
=99876543
= 9 9P7 ...(B)
From(A) and (B),
number of 8 digits mobile numbers that can be formed if at least one of their digits is repeated and 0 cannot be
used to start the mobile number
= 9 107 - 9 9P7
76. How many signals can be made using 6 different coloured flags when any number of them can be hoisted at
a time?
A. 1956
B. 1720
C. 2020
D. 1822
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option A
Explanation:
Given that any number of flags can be hoisted at a time. Hence we need to find out number of signals that can be
made using 1 flag, 2 flags, 3 flags, 4 flags, 5 flags and 6 flags and then add all these.

Number of signals that can be made using 1 flag

= 6P1 =6

Number of signals that can be made using 2 flags

= 6P2 =65=30
Number of signals that can be made using 3 flags
= 6P3 =654=120
Number of signals that can be made using 4 flags
= 6P4 =6543=360
Number of signals that can be made using 5 flags
= 6P5 =65432=720
Number of signals that can be made using 6 flags
= 6P6 =654321=720
Therefore, required number of signals
=6+30+120+360+720+720=1956
77. How many possible outcomes are there when five dice are rolled in which at least one dice shows 6?
A. 6555
B. 6656
C. 65
D. 56
Hide Answer
|
Notebook
answer with explanation

| Discuss

Answer: Option A
Explanation:
Initially we will find out number of possible outcomes when 5 dice are rolled.
Outcome of first dice can be any number from (1,2,3,4,5,6). i.e, its outcome can come in 6 ways. Similarly
outcome of each of the other 4 dice can also happen in 6 ways.
6

Hence, number of possible outcomes when 5 dice are rolled

=65
...(A)
Now we will find out number of possible outcomes when 5 dice are rolled in which 6 does not appear in any
dice.
In this case, outcome of first dice can be any number from (1,2,3,4,5). i.e, its outcome can come in 5 ways.
Similarly outcome of each of the other 4 dice can also happen in 5 ways.
5

Hence, number of possible outcomes when 5 dice are rolled in which 6 does not appear in any dice
=55
...(B)
From (A) and (B),
number of possible outcomes when five dice are rolled in which at least one dice shows 6
=6555
78. A board meeting of a company is organized in a room for 24 persons along the two sides of a table with 12
chairs in each side. 6 persons wants to sit on a particular side and 3 persons wants to sit on the other side. In how
many ways can they be seated?
A. 12P5 12P2 14!
B. 12P5 12P2 15!
C. 12P6 12P3 15!
D. 12P6 12P3 14!
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option C
Explanation:
First, arrange the 6 persons in the 12 chairs on the particular side. This can be done in 12P6 ways. ...(A)
Now, arrange the 3 persons in the 12 chairs on the other side. This can be done in 12P3 ways. ...(B)
Remaining persons = 2463 = 15
Remaining chairs = 2463 = 15
i.e., now we need to arrange the remaining 15 persons in the remaining 15 chairs.
This can be done in 15! ways. ...(C)
From (A), (B) and (C),
required number of ways = 12P6 12P3 15!

79. How many numbers not exceeding 10000 can be made using the digits 2,4,5,6,8 if repetition of digits is
allowed?
A. 9999
B. 820
C. 780
D. 740
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option C
Explanation:
Given that the numbers should not exceed 10000. Hence numbers can be 1 digit numbers or 2 digit numbers or 3
digit numbers or 4 digit numbers. Note that repetition of the digits is allowed.
A. Count of 1 digit numbers
The unit digit can be filled by any of the 5 digits (2,4,5,6,8)
5
Hence total count of 1 digit numbers =5
...(A)
B. Count of 2 digit numbers
Since repetition is allowed, any of the 5 digits(2,4,5,6,8) can be placed in unit place and tens place.
5

Hence total count of 2 digit numbers =52

...(B)
C. Count of 3 digit numbers
Since repetition is allowed, any of the 5 digits (2,4,5,6,8) can be placed in unit place, tens place and hundreds
place.
5

Hence total count of 3 digit numbers =53

...(C)

D. Count of 4 digit numbers

Since repetition is allowed, any of the 5 digits (2,4,5,6,8) can be placed in unit place, tens place, hundreds place
and thousands place.
5

Hence total count of 4 digit numbers =54

...(D)
From (A), (B), (C), and (D),
total count of numbers not exceeding 10000 that can be made using the digits 2,4,5,6,8 (with repetition of digits)
=5+52+53+54
=5(541)51 [ Reference: Sum of first n terms in a geometric progression (GP)]
=5(6251)4=56244=5156=780
80. How many 5 digit numbers can be formed using the digits 1,2,3,4,9
such that no two consecutive digits are the same?
A. None of these
B. 984
C. 95
D. 85
View Answer
|
Notebook

| Discuss

81. In how many ways can 5 blue balls, 4 white balls and the rest 6 different colour balls be arranged in a row?
A. 15!
B. 15!5!4!
C. 15P6
Hide Answer
|
Notebook
answer with explanation

D. 15P7
| Discuss

Answer: Option B
Explanation:
Number of ways in which n
things can be arranged taking them all at a time, when p1 of the things are exactly alike of 1st type, p2 of them are
exactly alike of a 2nd type ... pr of them are exactly alike of rth type and the rest all are distinct is
n!p1! p2! pr!

[Reference : Permutations of objects when all objects are not distinct]

Here, all the balls are not different.
Total number of balls =5+4+6=15

Number of blue balls =5

Number of white balls =4
Rest 6 balls are of different colours.
From the above given formula, required number of arrangements
=15!5!4!
82. A company has 10 software engineers and 6 civil engineers. In how many ways can a committee of 4
engineers be formed from them such that the committee must contain exactly 1 civil engineer?
A. 800
B. 720
C. 780
D. 740
View Answer
|
| Discuss
Notebook
83. A company has 10 software engineers and 6 civil engineers. In how many ways can a committee of 4
engineers be formed from them such that the committee must contain at least 1 civil engineer?
A. 1640
B. 1630
C. 1620
D. 1610
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option D
Explanation:
The committee should have 4 engineers. But the committee must contain at least 1 civil engineer.
Initially we will find out the number of ways in which a committee of 4 engineers can be formed from 10
software engineers and 6 civil engineers.
Total engineers =10+6=16

Total engineers in the committee =4

Hence, number of ways in which the committee of 4 engineers can be formed
= 16C4 ...(A)
Now we will find out the number of ways in which a committee of 4 engineers can be formed from 10 software
engineers and 6 civil engineers such that the committee must not contain any civil engineer.
For this, select 4 software engineers from 10 software engineers.
Hence, number of ways in which the committee of 4 engineers can be formed such that the committee must not
contain any civil engineer
= 10C4 ...(B)
From (A) and (B),
Number of ways in which the committee of 4 engineers can be formed from 10 software engineers and 6 civil
engineers such that the committee must contain at least 1 civil engineer
= 16C4 - 10C4
=161514134321109874321=4151413321092732=4514132103272=25
14131037=1820210=1610
84. From a group of 8 women and 6 men, a committee consisting of 3 men and 3 women is to be formed. In how
many ways can the committee be formed if two of the men refuses to serve together?
A. 1020
B. 640
C. 712
D. 896
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option D
Explanation:
Let the men be X and Y who refuses to serve together.
Initially, let's find out the number of ways in which the committee can be formed by excluding both X and Y.
We excluded both X and Y. Hence we need to select 3 men from 4 men (=6-2) and 3 women from 8 women.
Number of ways in which this can be done
= 4C3 8C3 ...(A)
Now let's find out the number of ways in which the committee can be formed where exactly one man from X and
Y will be present.
i.e., we need to select one man from two men(X and Y), remaining 2 men from 4 men(=6-2) and 3 women from
8 women. Number of ways in which this can be done
= 2C1 4C2 8C3 ...(B)

From (A) and (B),

Number of ways in which a committee can be formed if two of the men refuses to serve together
= 4C3 8C3 + 2C1 4C2 8C3
= 8C3(4C3 + 2C1 4C2)
= 8C3(4C1 + 2C1 4C2) [ nCr = nC(n - r)]
=(876321)[4+2(4321)]=(87)(4+43)=56(4+12)=5616=896
85. From a group of 8 women and 6 men, a committee consisting of 3 men and 3 women is to be formed. In how
many ways can the committee be formed if two of the women refuses to serve together?
A. 1020
B. 1000
C. 712
D. 896
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option B
Explanation:
Let the women be X and Y who refuses to serve together.
Initially, let's find out the number of ways in which the committee can be formed by excluding both X and Y.
We excluded both X and Y. Hence we need to select 3 women from 6 women (=8-2) and 3 men from 6 men.
Number of ways in which this can be done
= 6C3 6C3 ...(A)
Now let's find out the number of ways in which the committee can be formed where exactly one woman from X
and Y will be present.
i.e., we need to select one woman from two women(X and Y), remaining 2 women from 6 women(=8-2) and 3
men from 6 men. Number of ways in which this can be done
= 2C1 6C2 6C3 ...(B)
From (A) and (B),
Number of ways in which a committee can be formed if two of the women refuses to serve together
= 6C3 6C3 + 2C1 6C2 6C3
= 6C3(6C3 + 2C1 6C2 )
=(654321)[(654321)+2(6521)]=20(20+30)=2050=1000
86. From a group of 8 women and 6 men, a committee consisting of 3 men and 3 women is to be formed. In how
many ways can the committee be formed if one man and one woman refuses to serve together?
A. 722
B. 910
C. 612
D. 896
View Answer
| Discuss

|
Notebook
87. A box contains 20 balls. In how many ways can 8 balls be selected if each ball can be repeated any number of
times?
A. 20C7
B. None of these
20
C. C8
D. 27C8
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option D
Explanation:
Number of combinations of n distinct objects taking r at a time when each object may be repeated any number of
times
= (n+r-1)Cr
[Reference]
It is a question of combination with repetition.
Here, n=20, r=8
Hence, require number of ways
= (n+r-1)Cr = (20+8-1)C8 = 27C8
88. A box contains 12 black balls, 7 red balls and 6 blue balls. In how many ways can one or more balls be
selected?
A. 696
B. 728
C. 727
D. 896
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option C
Explanation:
Number of ways in which one or more objects can be selected out of S1 alike objects of one kind, S2 alike objects
of second kind and S3 alike objects of third kind
= (S1 + 1)(S2 + 1)(S3 + 1) - 1
[Reference]

Hence, require number of ways

=(12+1)(7+1)(6+1)1=(1387)1=7281=727
89. A box contains 12 different black balls, 7 different red balls and 6 different blue balls. In how many ways can
the balls be selected?
A. 728
B. 225 - 1
C. 225
D. 727
Hide Answer
|
| Discuss
Notebook
answer with explanation
Answer: Option B
Explanation:
Number of ways in which one or more objects can be selected from n distinct objects (i.e., we can select 1 or 2
or 3 or or n objects at a time)
= nC1 + nC2 + ... + nCn = 2n - 1
[Reference]
It is explicitly stated that 12 black balls are different, 7 red balls are different and 6 blue balls are different. Hence
there are 25 (=12+ 7+ 6) different balls.
We can select one ball from 25 balls, two balls from 25 balls, 25 balls from 25 balls.
Hence, required number of ways.
= Number of ways in which 1 ball can be selected from 25 distinct balls
+ Number of ways in which 2 balls can be selected from 25 distinct balls
+ Number of ways in which 3 balls can be selected from 25 distinct balls
...
+ Number of ways in which 25 balls can be selected from 25 distinct balls
= 25C1 + 25C2 + ... + 25C25
=2251

90. There are 12 copies of Mathematics, 7 copies of Engineering, 3 different books on Medicine and 2 different
books on Economics. Find the number of ways in which one or more than one book can be selected?
A. 3421
B. 3111
C. 3327
D. 3201
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option C

Explanation:

Number of ways in which one or more objects can be selected out of S1 alike objects of one kind, S2 alike objects
of second kind and so on ... Sn alike objects of nth kind and rest p different objects
= (S1 + 1) (S2 + 1) ... (Sn + 1) 2p - 1
Reference]

12 copies of Mathematics books can be considered as identical.

7 copies of Engineering books can be considered as identical.

3 different books on Medicine and 2 different books on Economics are there. i.e., there are 5 (=3+2) different
books.

Hence, required number of ways

=(12+1)(7+1)251=138321=33281=3327

Problems on Permutations and Combinations - Solved Examples(Set 4)

91. A box contains 4 different black balls, 3 different red balls and 5 different blue balls. In how many ways can
he balls be selected if every selection must have at least 1 black ball and one red ball?
A. (241)(231)(251)
B. (241)(231)25

C. 2121
D. 212

Hide Answer
| Discuss

Notebook
answer with explanation

Answer: Option B

Explanation:

Number of ways in which one or more objects can be selected from n distinct objects (i.e., we can select 1 or 2
or 3 or or n objects at a time)
= nC1 + nC2 + ... + nCn = 2n - 1
reference]

t is explicitly given that all the 4 black balls are different, all the 3 red balls are different and all the 5 blue balls
are different. Hence this is a case where all are distinct objects.

nitially let's find out the number of ways in which we can select the black balls. Note that at least 1 black ball
must be included in each selection.

Hence, we can select 1 black ball from 4 black balls

or 2 black balls from 4 black balls.
or 3 black balls from 4 black balls.
or 4 black balls from 4 black balls.

Hence, number of ways in which we can select the black balls

= 4C1 + 4C2 + 4C3 + 4C4
=241

A)

Now let's find out the number of ways in which we can select the red balls. Note that at least 1 red ball must be
ncluded in each selection.

Hence, we can select 1 red ball from 3 red balls

or 2 red balls from 3 red balls
or 3 red balls from 3 red balls

Hence, number of ways in which we can select the red balls

= 3C1 + 3C2 + 3C3
=231 (B)

Now let's find out the number of ways in which we can select the blue balls. There is no specific condition given
here.

Hence, we can select 0 blue ball from 5 blue balls (i.e, do not select any blue ball. In this case, only black and
ed balls will be there)
or 1 blue ball from 5 blue balls
or 2 blue balls from 5 blue balls
or 3 blue balls from 5 blue balls
or 4 blue balls from 5 blue balls
or 5 blue balls from 5 blue balls.

Hence, number of ways in which we can select the blue balls

= 5C0 + 5C1 + 5C2 + + 5C5
=25 (C)

From (A), (B) and (C), required number of ways

=(241)(231)25

92. There are 10 different books and 20 copies of each book in a library. In how many ways can one or more
han one book be selected?
A. 21101

B. 2200

C. 22001
D. 2110

Hide Answer
| Discuss

Notebook
answer with explanation

Answer: Option A

Explanation:

Number of ways in which one or more objects can be selected out of S1 alike objects of one kind, S2 alike objects
of second kind , S3 alike objects of third kind and so on ... Sn alike objects of nth kind
= (S1 + 1) (S2 + 1)(S3 + 1)...(Sn + 1) - 1
reference]

There are 10 different books.

Each book has 20 copies and all the copies of each particular book can be considered as identical.

Hence, required number of ways

=[(20+1)(20+1)(10 times)]1=[2121(10 times)]1=21101

93. In how many ways can 4 different balls be distributed among 5 different boxes when any box can have any
number of balls?
A. 541
B. 54

C. 451
D. 45

Hide Answer

Notebook
answer with explanation

Answer: Option B

Explanation:

Solution 1: Using Formula

| Discuss

Reference: Distribution of k balls into n boxes: formula 1]

Here n = 5, k = 4.
Hence, as per the above formula, required number of ways
= nk =54

Solution 2

Here both balls and boxes are different.

1st ball can be placed into any of the 5 boxes.

2nd ball can be placed into any of the 5 boxes.
3rd ball can be placed into any of the 5 boxes.
4th ball can be placed into any of the 5 boxes.

Hence, required number of ways

= 5555=54

Note: If you got the answer as 45

it is wrong. Let's see why.

One might have taken the following reasoning to get the answer as 45
1st box can contain any number of balls from 4 balls.
2nd box can contain any number of balls from 4 balls.

5th box can contain any number of balls from 4 balls.

Hence, required number of ways

=44444=45

But this reasoning is wrong. For instance, if the 1st box contains all the 4 balls, other boxes cannot contain any
balls. Due to such dependencies, we cannot apply multiplication theorem in this way. Hence 54 is the correct
answer, not 45

94. In how many ways can three different balls be distributed among two different boxes when any box can have
any number of balls?
A. 231
B. 23

C. 321
D. 32

Hide Answer
| Discuss

Notebook
answer with explanation

Answer: Option B

Explanation:

Solution 1: Using Formula

Reference: Distribution of k balls into n boxes: formula 1]

Here n = 2, k = 3.
Hence, as per the above formula, required number of ways
= nk =23

Solution 2

Here both balls and boxes are different.

1st ball can be placed into any of the 2 boxes.

2nd ball can be placed into any of the 2 boxes.
3rd ball can be placed into any of the 2 boxes.

Hence, required number of ways

=222=23

Note: If you got the answer as 32

it is wrong. Let's see why.

One might have taken the following reasoning to get the answer as 32
1st box can contain any number of balls from 3 balls.
2nd box can contain any number of balls from 3 balls.

Hence, required number of ways =33=32

But this reasoning is wrong. For instance, if the 1st box contains all the 3 balls, other boxes cannot contain any
balls. Due to such dependencies, we cannot apply multiplication theorem in this way. Hence 23 is the correct
answer, not 32

95. In how many ways can 5 distinguishable balls be put into 8 distinguishable boxes if no box can contain more
han one ball?

B. 8P5

A. None of these
C. 85
D. 58

Hide Answer
| Discuss

Notebook
answer with explanation

Answer: Option B

Explanation:

Solution 1: Using Formula

Reference: Distribution of k balls into n boxes: formula 2]

Here n = 8, k = 5.
Hence, as per the above formula, required number of ways
= nPk = 8P5

Solution 2

1st ball can be placed into any of the 8 boxes.

Since no box can contain more than one ball, we have 7 boxes remaining. 2nd ball can be placed into any of these
7 boxes.
Similarly 3rd ball can be placed into any of the remaining 6 boxes.
4th ball can be placed into any of the remaining 5 boxes.
5th ball can be placed into any of the remaining 4 boxes.

Hence, required number of ways

=87654

= 8P5

96. In how many ways can 8 distinguishable balls be put into 5 distinguishable boxes if no box can contain more
han one ball?
A. 0
B. 85

C. 8P5

D. 58

Hide Answer

Notebook

| Discuss

answer with explanation

Answer: Option A

Explanation:

Solution 1: Using Formula

Reference: Distribution of k balls into n boxes: formula 2]

Here n = 5, k = 8.
Hence, as per the above formula, required number of ways
= nPk = 5P8 =0

Solution 2

Clearly the answer is 0

Given that no box can contain more than one ball.

1st ball can be put into any of the 5 boxes.

2nd ball can be put into any of the remaining 4 boxes.
3rd ball can be put into any of the remaining 3 boxes.
4th ball can be put into any of the remaining 2 boxes.
5th ball can be put into the remaining 1 box.

But there are no boxes left to put the remaining 3 balls. Hence the answer is 0

97. In how many ways can 8 distinguishable balls be put in to 5 distinguishable boxes if any box can contain
more than one ball?
A. 85
B. 8P5
C. None of these
D. 58

Hide Answer

Notebook
answer with explanation

Answer: Option D

Explanation:

Solution 1: Using Formula

Reference: Distribution of k balls into n boxes: formula 1]

| Discuss

Here n = 5, k = 8.
Hence, as per the above formula, required number of ways
= nk =58

Solution 2

Here both balls and boxes are different.

Given that any box can contain more than one ball.

1st ball can be placed into any of the 5 boxes.

2nd ball can be placed into any of the 5 boxes.
3rd ball can be placed into any of the 5 boxes.
..
8th ball can be placed into any of the 5 boxes.

Hence, required number of ways

=55

8 times) =58

Note: If you got the answer as 85

it is wrong. Let's see why.

One might have taken the following reasoning to get the answer as 85
1st box can contain any number of balls from 8 balls.
2nd box can contain any number of balls from 8 balls.

5th box can contain any number of balls from 8 balls.

Hence, required number of ways

=88 (5 times) =85

But this reasoning is wrong. For instance, if the 1st box contains all the 8 balls, other boxes cannot contain any
balls. Due to such dependencies, we cannot apply multiplication theorem in this way. Hence 58 is the correct
answer, not 85

98. In how many ways can 7 different balls be distributed in 5 different boxes if any box can contain any number
of balls and no box is left empty?
A. 16800
B. 12400
C. 22000
D. 19700
Hide Answer
| Discuss

Notebook
answer with explanation

Answer: Option A

Explanation:

Solution 1: Using Formula

Reference: Distribution of k balls into n boxes: formula 3]

Here n = 5, k = 7.
Hence, as per the above formula, required number of ways
= S(k,n) n!
=n1i=0 (1)inCi(ni)k=4i=0(1)i 5Ci(5i)7=5C0(5)75C1(4)7+5C2(3)75C3(2)7+5C4(1)7=(5)75(4)7+10(3)710(2)7+5(1)7=
7812581920+218701280+5=16800

Solution 2

Since no box can be left empty, there can be only two cases.

Case A: 1,1,1,1,3

i.e., 3 balls are put in 1 box and 1 ball is put in each of the remaining 4 boxes.)

A box (in which 3 balls are put) can be selected in 5C1 ways.
Now, the three balls can be selected in 7C3 ways.
Remaining 4 balls can be arranged in 4! ways.

Hence, total number of ways

= 5C1 7C3 4! ...(A)

Case B: 1,1,1,2,2
i.e., two balls are put in each of the two boxes and 1 ball is put in each of the remaining 3 boxes.)

The two boxes (in each of them, two balls are put) can be selected in 5C2 ways.
Now, two balls for the first selected box can be selected in 7C2 ways.
Two balls for the second selected box can be selected in 5C2 ways.
Remaining 3 balls can be arranged in 3! ways

Hence, total number of ways

= 5C2 7C2 5C2 3! ...(B)

From (A) and (B),

Required number of ways

= (5C1 7C3 4!) + (5C2 7C2 5C2 3!)

=(53524)+(1021106)=4200+12600=16800

99. In how many ways can 7 identical balls be distributed in 5 different boxes if any box can contain any number
of balls?
A. 200
B. 330
C. 410
D. 390
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option B

Explanation:

Reference: Distribution of k balls into n boxes: formula 5]

Here n = 5, k = 7.
Hence, as per the above formula, required number of ways
= (k+n-1)C(n-1) = 11C4 = 330

100. In how many ways can 7 different balls be distributed in 5 different boxes if box 3 and box 5 can contain
only one and two number of balls respectively and rest of the boxes can contain any number of balls?
A. 10100
B. 6200
C. 8505
D. 12800
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option C

Explanation:

One ball for box 3 can be selected in 7C1 ways.

Two balls for box 5 can be selected in 6C2 ways.

Remaining balls = 4
Remaining boxes = 3

n these 4 balls, 1st ball can be put in any of these 3 boxes.

Similarly 2nd ball can be put in any of these 3 boxes.
3rd ball can be put in any of these 3 boxes.
4th ball can be put in any of these 3 boxes.

.e., these 4 balls can be arranged in

3333=34

ways

Required number of ways

= 7C1 6C2 34
=71581=8505

101. In how many ways can 7 different balls be distributed in 5 different boxes if any box can contain any
number of balls except that ball 3 can only be put into box 3 or box 4?
A. 256
B. 56

C. 65
D. 265

Hide Answer
| Discuss

Notebook
answer with explanation

Answer: Option A

Explanation:

1st ball can be put in any of the 5 boxes.

2nd ball can be put in any of the 5 boxes.

Ball 3 can only be put into box 3 or box 4. Hence, 3rd ball can be put in any of these 2 boxes.

4th ball can be put in any of the 5 boxes.

5th ball can be put in any of the 5 boxes.
6th ball can be put in any of the 5 boxes.
7th ball can be put in any of the 5 boxes.

Hence, required number of ways

=5525555=256

102. In how many ways can 7 different balls be distributed in 5 different boxes if any box can contain any
number of balls, no box can be empty and ball 3 and ball 5 cannot be put in the same box?
A. 16800
B. 15000
C. 17200
D. 16400
Hide Answer
| Discuss
Notebook

answer with explanation

Answer: Option B

Explanation:

Solution 1: Using Formula

Reference: Distribution of k balls into n boxes: formula 3]

nitially let's find out the total number of ways in which 7 different balls can be distributed in 5 different boxes if
any box can contain any number of balls and no box can be empty.

Here n = 5, k = 7.
Hence, as per the above formula, total number of ways
= S(k,n) n!
=n1i=0(1)i nCi(ni)k=4i=0(1)i 5Ci(5i)7=5C0(5)75C1(4)7+5C2(3)75C3(2)7+5C4(1)7=(5)75(4)7+10(3)710(2)7+5(1)7=
7812581920+218701280+5=16800 (1)

Now let's find out the total number of ways in which 7 different balls can be distributed in 5 different boxes if
any box can contain any number of balls, no box can be empty and ball 3 and ball 5 are in the same box.

For this, tie ball 3 and ball 5 and consider it as a single ball. Hence, we can consider the total number of balls as
6.

Using the same formula mentioned above, with n = 5 and k = 6,

otal number of ways
= S(k,n) n!
=n1i=0(1)i nCi(ni)k=4i=0(1)i 5Ci(5i)6=5C0(5)65C1(4)6+5C2(3)65C3(2)6+5C4(1)6=(5)65(4)6+10(3)610(2)6+5(1)6=
1562520480+7290640+5=1800 (2)

Required number of ways =

Total Number of ways in which 7 different balls can be distributed in 5 different boxes if any box can contain
any number of balls, no box can be empty)

Total Number of ways in which 7 different balls can be distributed in 5 different boxes if any box can contain
any number of balls, no box can be empty and ball 3 and ball 5 are in the same box)

=168001800=15000

Solution 2

nitially let's find out the total number of ways in which 7 different balls can be distributed in 5 different boxes if
any box can contain any number of balls and no box can be empty.

Since no box can be left empty, there can be only two cases.

Case 1: 1,1,1,1,3

i.e., 3 balls are put in 1 box and 1 ball is put in each of the remaining 4 boxes.)

A box (in which 3 balls are put) can be selected in 5C1 ways.
Now, the three balls can be selected in 7C3 ways.
Remaining 4 balls can be arranged in 4! ways.

Hence, total number of ways

= 5C1 7C3 4! ...(A)

Case 2: 1,1,1,2,2
i.e., two balls are put in each of the two boxes and 1 ball is put in each of the remaining 3 boxes.)

The two boxes (in each of them, two balls are put) can be selected in 5C2 ways.
Now, two balls for the first selected box, can be selected in 7C2 ways.
Two balls for the second selected box, can be selected in 5C2 ways.
Remaining 3 balls can be arranged in 3! ways.

Hence, total number of ways

= 5C2 7C2 5C2 3! ...(B)

From (A) and (B), total number of ways

= (5C1 7C3 4!) + (5C2 7C2 5C2 3!)
=(53524)+(1021106)=4200+12600=16800

Now let's find out the total number of ways in which 7 different balls can be distributed in 5 different boxes if
any box can contain any number of balls, no box can be empty and ball 3 and ball 5 are in the same box.

For this, tie ball 3 and ball 5 and consider it as a single ball. Hence, we can consider total number of balls as 6.
Now, with no box can be left empty, there can be only one case as given below.

1,1,1,1,2
i.e., 2 balls are put in 1 box and 1 ball is put in each of the remaining 4 boxes.)

A box (in which 2 balls are put) can be selected in 5C1 ways.
Now, the two balls can be selected in 6C2 ways.
Remaining 4 balls can be arranged in 4! ways.

Hence, total number of ways

= 5C1 6C2 4!
=51524=515122=101512=1800

Required number of ways =

Total Number of ways in which 7 different balls be distributed in 5 different boxes if any box can contain any
number of balls, no box can be empty.)

Total Number of ways in which 7 different balls be distributed in 5 different boxes if any box can contain any
number of balls, no box can be empty and ball 3 and ball 5 are in the same box.)

=168001800=15000

103. Five balls needs to be placed in three boxes. Each box can hold all the five balls. In how many ways can the
balls be placed in the boxes if no box can be empty and all balls and boxes are different?
A. 220
B. 150
C. 120
D. 190
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option B

Explanation:

Solution 1: Using Formula

Reference: Distribution of k balls into n boxes: formula 3]

Here n = 3, k =5.
Hence, as per the above formula,required number of ways
= S(k,n) n!
=n1i=0(1)i nCi(ni)k=2i=0(1)i 3Ci(3i)5=3C0(3)53C1(2)5+3C2(1)5=(3)53(2)5+3(1)5=24396+3=150

Solution 2

Since no box can be left empty, there can be only two cases.

Case A: 1,1,3

i.e., 3 balls are put in 1 box and 1 ball is put in each of the remaining 2 boxes.)

A box (in which 3 balls are put) can be selected in 3C1 ways.
Now, the three balls can be selected in 5C3 ways.
Remaining 2 balls can be arranged in 2! ways.

Hence, total number of ways

= 3C1 5C3 2!
=3102=60 ...(A)

Case B: 1,2,2
i.e., two balls are put in each of the two boxes and 1 ball is put in the remaining 1 box.)

The two boxes (in each of them, two balls are put) can be selected in 3C2 ways.
Now, two balls for the first selected box can be selected in 5C2 ways.
Two balls for the second selected box can be selected in 3C2 ways.
Remaining 1 ball can be placed only in 1 way.

Hence, total number of ways

= 3C2 5C2 3C2 1
=3103=90 ...(B)

From (A) and (B),

Required number of ways
=60+90=150

104. Five balls needs to be placed in three boxes. Each box can hold all the five balls. In how many ways can the
balls be placed in the boxes if no box can be empty, all balls are identical but all boxes are different?
A. 8
B. 6
C. 4
D. 2
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option B

Explanation:

Solution 1: Using Formula

Reference: Distribution of k balls into n boxes: formula 7]

Here n = 3, k = 5.
Hence, as per the above formula, required number of ways
= (k-1)C(n-1) = 4C2 = 6

Solution 2

Since no box can be left empty, there can be only two cases.

Case A: 1,1,3

i.e., 3 balls are put in 1 box and 1 ball is put in each of the remaining 2 boxes.)

A box (in which 3 balls are put) can be selected in 3C1 ways.
Now, the three balls can be selected only in 1 way (as all the balls are identical).
Remaining 2 balls can be arranged in only 1 way (as all the balls are identical).

Hence, total number of ways = 3C1 = 3 ...(A)

Case B: 1,2,2
i.e., two balls are put in each of the two boxes and 1 ball is put in the remaining 1 box).

The two boxes (in each of them, two balls are put) can be selected in 3C2 ways.
Now, two balls for the first selected box can be selected only in 1 way(as all the balls are identical).
Two balls for the second selected box can be selected in only in 1 way(as all the balls are identical).
Remaining 1 ball can be placed only in 1 way.

Hence, total number of ways = 3C2 = 3 ...(B)

From (A) and (B),

Required number of ways =3+3=6

105. Five balls needs to be placed in three boxes. Each box can hold all the five balls. In how many ways can the
balls be placed in the boxes if all balls are identical and all boxes are different?
A. 32
B. 21
C. 18
D. 11
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option B

Explanation:

Reference: Distribution of k balls into n boxes: formula 5]

Here n = 3, k = 5.
Hence, as per the above formula, required number of ways
= (k+n-1)C(n-1) = 7C2 = 21

106. Five balls needs to be placed in three boxes. Each box can hold all the five balls. In how many ways can the
balls be placed in the boxes so that no box can be empty if all balls are different but all boxes are identical?
A. 25
B. 23
C. 15
D. 6
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option A

Explanation:

Solution 1: Using Formula

Reference: Distribution of k balls into n boxes: formula 11]

Here n = 3, k =5.
Hence, as per the above formula, required number of ways
= S(k,n)
=1n!n1i=0(1)i nCi(ni)k=13!2i=0(1)i
3Ci(3i)5=16[3C0(3)53C1(2)5+3C2(1)5]=16[(3)53(2)5+3(1)5]=16(24396+3)=16150=25

Solution 2

Since no box can be left empty, there can be only two cases.

Case A: 1,1,3

i.e., 3 balls are put in 1 box and 1 ball is put in each of the remaining 2 boxes.)

A box (in which 3 balls are put) can be selected only in 1 way (as all boxes are identical).
Now, the three balls can be selected in 5C3 ways.
Remaining 2 balls can be arranged in the remaining 2 boxes (1 ball in each box) only in 1 way (as all boxes are
dentical).

Hence, total number of ways = 5C3 =10 ...(A)

Case B: 1,2,2
i.e., two balls are put in each of the two boxes and 1 ball is put in the remaining 1 box.)

The two boxes (in each of them, two balls are put) can be selected only in 1 way (as all boxes are identical).
Now, two balls for the first selected box can be selected in 5C2 ways.
Two balls for the second selected box can be selected in 3C2 ways.
Remaining 1 ball can be placed in the remaining 1 box only in 1 way.

Hence, total number of ways

=5C2 3C22=1032=53=15(B)
Note that we divided by 2 to avoid overcounting.]

From (A) and (B),

equired number of ways
=10+15=25

Solution 3

Let the balls be A,B,C,D,E

Case A:1,1,3

i.e., 3 balls are put in 1 box and 1 ball is put in each of the remaining 2 boxes).

box
ABC
ABD
ABE
ACD
ACE
ADE
BCD
BCE
BDE
CDE

box
D
C
C
B
B
B
A
A
A
A

box
E
E
D
E
D
C
E
D
C
B

Total: 10

Case B:1,2,2

i.e., two balls are put in each of the two boxes and 1 ball is put in the remaining 1 box).

box
A
A
A
B
B
B
C
C
C
D
D
D
E
E

box
BC
BD
BE
AC
AD
AE
AB
AD
AE
AB
AC
AE
AB
AC

box
DE
CE
CD
DE
CE
CD
DE
BE
BD
CE
BE
BC
CD
BD

AD

BC

Total: 15

Required number of ways

=10+15=25

107. Five balls needs to be placed in three boxes. Each box can hold all the five balls. In how many ways can the
balls be placed in the boxes so that no box remains empty, if all balls and boxes are identical?
A. 1
B. 4
C. 2
D. 6
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option C

Explanation:

Solution 1: Using Formula

Reference: Distribution of k balls into n boxes: formula 15]

Here n = 3, k =5.
Hence, as per the above formula, required number of ways
= P(k,n) = P(5,3)

The partitions of 5 into 3 parts are

1+1+31+2+2

Therefore, number of partitions of 5 into 3 parts =2

=> P(5,3) =2
=> Required number of ways =2

Solution 2

Since no box can be left empty, there can be only two cases.

Case A: 1,1,3

i.e., 3 balls are put in 1 box and 1 ball is put in each of the remaining 2 boxes).

Total number of ways in which this can be done = 1 (as both boxes and balls are identical)

Case B: 1,2,2
i.e., two balls are put in each of the two boxes and 1 ball is put in the remaining 1 box).

Total number of ways in which this can be done =1 (as both boxes and balls are identical).

From (A) and (B),

Required number of ways
=1+1=2

108. Five balls needs to be placed in three boxes. Each box can hold all the five balls. In how many ways can the
balls be placed in the boxes so that no box remains empty If all balls and boxes are identical but the boxes are
placed in a row?
A. 2
B. 4
C. 6
D. 1
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option C

Explanation:

Here, the balls and boxes are identical. But the boxes are placed in a row. Hence, we need to consider the boxes
as distinct.

Therefore, this should be treated as a problem where balls are identical and boxes are distinct. Now it can be
olved in any of the following ways.

Solution 1: Using Formula

Reference: Distribution of k balls into n boxes: formula 7]

Here n = 3, k = 5.
Hence, as per the above formula, required number of ways
= (k-1)C(n-1) = 4C2 = 6

Solution 2

Since no box can be left empty, there can be only two cases

Case A: 1,1,3

i.e., 3 balls are put in 1 box and 1 ball is put in each of the remaining 2 boxes).

A box (in which 3 balls are put) can be selected in 3C1 ways.
Now, the three balls can be selected only in 1 way (as all the balls are identical).
Remaining 2 balls can be arranged in only 1 way (as all the balls are identical).

Hence, total number of ways = 3C1 =3 ...(A)

Case B: 1,2,2
i.e., two balls are put in each of the two boxes and 1 ball is put in the remaining 1 box).

The two boxes (in each of them, two balls are put) can be selected in 3C2 ways.
Now, two balls for the first selected box can be selected only in 1 way(as all the balls are identical).
Two balls for the second selected box can be selected in only in 1 way(as all the balls are identical).
Remaining 1 ball can be placed only in 1 way.

Hence, total number of ways = 3C2 =3 ...(B)

From (A) and (B),

Required number of ways
=3+3=6

109. Eight balls of different colours need to be placed in three boxes of different sizes. Each box can hold all the
eight balls. In how many ways can the balls be placed in the boxes so that no box remains empty?
A. 5796
B. 8212
C. 6016
D. 16800
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option A

Explanation:

Reference: Distribution of k balls into n boxes: formula 3]

Here n = 3, k = 8.
Hence, as per the above formula, required number of ways
= S(k,n) n!
=n1i=0(1)i nCi(ni)k=2i=0(1)i 3Ci(3i)8=3C0(3)83C1(2)8+3C2(1)8=(3)83(2)8+3=6561768+3=5796

110. The number of ways in which 13 gold coins can be distributed among three persons such that each one gets
at least two gold coins is
A. 24
B. 36
C. 48
D. 0
Hide Answer
| Discuss

Notebook
answer with explanation

Answer: Option B

Explanation:

Solution 1: Using Formula - Distributing Balls into Boxes

Reference: Distribution of k balls into n boxes: formula 5]

Here coins are identical and persons are distinct.

Number of ways in which 13 gold coins can be distributed among three persons such that each one gets at least
wo gold coins

= Number of ways in which 13 identical balls can be distributed into three distinct boxes
uch that each box gets at least two balls

Each box gets at least two balls. Hence, initially distribute 2 balls to each of the 3 boxes. Since balls are
dentical, there is only 1 way of doing this.

Number of balls left =136=7

Now distribute these 7 identical balls into 3 distinct boxes.

As per the formula mentioned at the beginning, we can solve the problem now.
Here n = 3, k = 7.
Hence, number of ways in which this can be done
= (k+n-1)C(n-1) = 9C2 =36

.e, required number of ways =36

Solution 2: Using Formula - Counting Integral Solutions

Number of non-negative integral solutions of equation x1+x2++xn=k

= Number of ways in which k identical balls can be distributed into n distinct boxes

=(k+n1n1)
= (k+n-1)C(n-1)

reference]

Here coins are identical and persons are distinct.

Hence,the number of ways in which 13 gold coins can be distributed among three persons such that each one
gets at least two gold coins

= Number of integral solutions of equation

x1+x2+x3=13

where x1,x2,x32

Give 2 to x1, 2 to x2 and 2 to x3 so that required number of solutions is equal to the number of integral solutions
of
x1+x2+x3=136=7 where x1,x2,x30

Now this is in general form with n = 3 and k = 7

Total number of solutions

= (k+n-1)C(n-1) = 9C2 =36

111. In how many ways can 30 identical apples be divided among 10 boys?
A. 39C9
B. 30!10!

C. 30C10
Hide Answer

D. 40C10
| Discuss

Notebook
answer with explanation

Answer: Option A

Explanation:

Reference: Distribution of k balls into n boxes: formula 5]

Here apples are identical and boys are distinct.

Number of ways in which 30 identical apples can be divided among 10 boys

= Number of ways in which 30 identical balls can be distributed into 10 distinct boxes

This problem can be solved using the formula given at the beginning.
Here n = 10, k = 30.
Hence, required number of ways
= (k+n-1)C(n-1) = 39C9

112. In how many ways can 30 distinct toys be equally divided among 10 boys?

A. 1030
B. 30!(3!)10

C. 30C10

D. 3010

Hide Answer
| Discuss

Notebook
answer with explanation

Answer: Option B

Explanation:

Solution 1: Using Formula

Number of ways in which mn

distinct things can be distributed equally among n persons (each person gets m number of things)

= Number of ways in which mn distinct things can be divided equally into n groups (each group will have m
hings and the groups are numbered, i.e., distinct)

=(mn)!(m!)n

reference]

30 distinct toys need to be equally divided among 10 distinct boys.

Number of toys that each boy should get =3010=3

From the problem,

mn=30n=10m=3

Hence, as per the above formula, required number of ways

=30!(3!)10

Solution 2

30 distinct toys need to be equally divided among 10 distinct boys.

Therefore, number of toys that each boy should get =3010=3

Number of ways of selecting 3 toys from 30 toys = 30C3

Number of ways of selecting 3 toys from remaining 27 toys = 27C3
Number of ways of selecting 3 toys from remaining 24 toys = 24C3
Number of ways of selecting 3 toys from remaining 21 toys = 21C3
Number of ways of selecting 3 toys from remaining 18 toys = 18C3
Number of ways of selecting 3 toys from remaining 15 toys = 15C3
Number of ways of selecting 3 toys from remaining 12 toys = 12C3
Number of ways of selecting 3 toys from remaining 9 toys = 9C3
Number of ways of selecting 3 toys from remaining 6 toys = 6C3
Number of ways of selecting 3 toys from remaining 3 toys = 3C3

Required number of ways

= 30C3 27C3 24C3 21C3 18C3 15C3 12C3 9C3 6C3 3C3

30!27!3!27!24!3!24!21!3!21!18!3!18!15!3!15!12!3!12!9!3!9!6!3!6!3!3!3!0!3! =30!(3!)10

113. In how many ways can 30 distinct toys be equally divided into 10 packets?
A. 1030
B. 30!(3!)10

C. 30!10!(3!)10
D. 3010

Hide Answer
| Discuss

Notebook
answer with explanation

Answer: Option C

Explanation:

Number of ways in which mn

distinct things can be divided equally into n groups (each group will have m things and the groups are
unmarked, i.e., not distinct)

=(mn)!(m!)n n!

reference]

30 distinct toys need to be equally divided into 10 packets.

Number of toys in each packet =3010=3

Since packets do not have distinct identity, we can consider that all groups are identical (not distinct).

.e., we need to divide 30 distinct toys into 10 identical groups containing 3 toys each.

Hence, as per the above formula, required number of ways

=30!10!(3!)10

114. In how many ways can 30 identical toys be divided among 10 boys if each boy must get at least one toy?
A. 30C10
B. 3010
C. 1030
D. 29C9
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option D

Explanation:

Reference: Distribution of k balls into n boxes: formula 7]

Here toys are identical and boys are distinct.

Number of ways in which 30 identical toys can be divided among 10 boys if each boy must get at least one toy

= Number of ways in which 30 identical balls can be distributed into 10 boxes if each box must contain at least
one ball

Hence, this problem can be solved using the formula given at the top.
n = 10, k = 30.

Hence, required number of ways

= (k-1)C(n-1) = 29C9

115. In how many ways can seven '#' symbol and five '*' symbol be arranged in a line so that no two '*' symbols
occur together?
A. 44
B. 56
C. 62
D. 28
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option B

Explanation:

There are 7 identical '#' symbols and 5 identical '*' symbols.

We need to arrange these 12 symbols in a line so that no two '*' symbols occur together.

The seven '#' symbols can be arranged in 1 way ...(A)

because all these symbols are identical and order is not important).

Now there are 8 positions to arrange the five '*' symbols so that no two '*' symbols occur together as indicated in
he diagram below.

The five '*' symbols can be placed in these 8 positions in 8C5 ways ...(B)
because all these symbols are identical and order is not important)

From(A) and (B),

equired number of ways
= 1 8C5 = 8C5
= 8C3 [ nCr = nC(n - r)]
=876321=87=56

116. Naresh has 10 friends and he wants to invite 6 of them to a party. How many times will 3 particular friends
always attend the party?
A. 720
B. 120
C. 126
D. 35
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option D

Explanation:

nitially invite the 3 particular friends. This can only be done in 1 way ...(A)

Now he needs to invite 3 (=6-3) more friends from the remaining 7 (=10-3) friends. This can be done in 7C3 ways
..(B)

From (A) and (B),

equired number of ways

= 1 7C3 = 7C3
=765321=75=35

117. Naresh has 10 friends and he wants to invite 6 of them to a party. How many times will 3 particular friends
never attend the party?
A. 8
B. 720
C. 35
D. 7
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option D

Explanation:

Remove the 3 particular friends and invite 6 friends from the remaining 7 (=10-3) friends. This can be done in
C6 ways

Therefore, required number of ways

= 7C6
= 7C1[ nCr = nC(n - r)]
=7

118. In how many ways can 10 engineers and 4 doctors be seated at a round table without any restriction?
A. 14C10
B. 14!
C. 13!
D. None of these
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option C

Explanation:

Number of circular permutations (arrangements) of n

distinct things
=(n1)!

Reference: Circular permutations - Case 1]

Here, n=10+4=14

Hence, number of arrangements possible

=(141)!=13!

119. In how many ways can 10 engineers and 4 doctors be seated at a round table if all the 4 doctors sit together?
A. 13!4!
B. 14!

C. 10!
D. 10!4!

Hide Answer
| Discuss

Notebook
answer with explanation

Answer: Option D

Explanation:

Number of circular permutations (arrangements) of n

distinct things
=(n1)!

Reference: Circular permutations - Case 1]

Since all the 4 doctors sit together, group them together and consider as a single doctor.

Hence, n

= total number of persons =10+1=11

These 11 persons can be seated at a round table in (111)!=10! ways ...(A)

However these 4 doctors can be arranged among themselves in 4! ways. ...(B)

From (A) and (B),

equired number of ways =10!4!
120. In how many ways can 10 engineers and 4 doctors be seated at a round table if no two doctors sit together?
A. 10!4!
B. 9!
0
P4

C. 10!
0
P4

D. 13!

Hide Answer
| Discuss

Notebook
answer with explanation

Answer: Option B

Explanation:

Number of circular permutations (arrangements) of n

distinct things
=(n1)!

Reference: Circular permutations - Case 1]

No two doctors sit together. Hence, let's initially arrange the 10 engineers at a round table. Number of ways in
which this can be done =(101)!=9!

..(A)

Now there are 10 positions left (marked as *) to place the 4 doctors as shown below so that no two doctors can
it together.

Number of ways in which this can be done

= 10P4 ...(B)

From (A) and (B),

Required number of ways =9! 10P4
Problems on Permutations and Combinations - Solved Examples(Set 5)
121. In how many ways can 10 engineers and 4 doctors be seated at a round table if all the 4 doctors do not sit
ogether?
A. 13!(10!4!)

B. 13!4!

C. 14!
D. 10!4!

Hide Answer
| Discuss

Notebook
answer with explanation

Answer: Option A

Explanation:

Number of circular permutations (arrangements) of n

distinct things
=(n1)!

Reference: Circular permutations - Case 1]

nitially let's find out the number of ways in which 10 engineers and 4 doctors can be seated at a round table.
n this case, n

= total number of persons =10+4=14

Hence, number of ways in which 10 engineers and 4 doctors can be seated at a round table
=(141)!=13! ...(A)

Now let's find out the number of ways in which 10 engineers and 4 doctors can be seated at a round table where
all the 4 doctors sit together.

Since all the 4 doctors sit together, group them together and consider as a single doctor.
Hence, n = total number of persons =10+1=11
These 11 persons can be seated at a round table in (111)!=10! ways ...(B)
The 4 doctors can be arranged among themselves in 4! ways ...(C)

From (B) and (C), number of ways in which 10 engineers and 4 doctors can be seated at a round table where all
he 4 doctors sit together
=10!4! ...(D)

From (A) and (D),

number of ways in which 10 engineers and 4 doctors can be seated at a round table if all the 4 doctors do not sit
ogether
=13!(10!4!)

122. In a chess competition involving some men and women, every player needs to play exactly one game with

every other player. It was found that in 45 games, both the players were women and in 190 games, both players
were men. What is the number of games in which one person was a man and other person was a woman?
A. 40
B. 200
C. 180
D. 120
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option B

Explanation:

Let total number of women =w

otal number of men =m

Number of games in which both players were women =45

wC2=45w(w1)2=45w(w1)=90w=10

Number of games in which both players were men =190

mC2=190m(m1)2=190m(m1)=380m=20

We have got that

Total number of women = 10
Total number of men = 20

Required number of games in which one person was a man and other person was a woman
= 20C1 10C1 =2010=200

123. If each permutation of the digits 1,2,3,4,5,6

are listed in the increasing order of magnitude, then 289
h
term will be
A. 361452
B. 321546
C. 321456
D. 341256
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option D

Explanation:

Let's see how many numbers can be formed with leftmost digit as 1

The digit '1' is placed at the 1st position (only 1 way of doing this).
Since one digit is placed at the 1st position, any of the remaining 5 digits can be placed at 2nd position.
Since one digit is placed at the 1st position and another digit is placed at the 2nd position, any of the remaining 4
digits can be placed at the 3rd position.
So on ...

otal number of ways

=154321=120

.e., total count of numbers which can be formed with leftmost digit as 1 =120

Similarly, total count of numbers which can be formed with leftmost digit as 2 =120

Similarly, total count of numbers which can be formed with leftmost digit as 3 =120

.e., 240 numbers (=120+120) can be formed (with leftmost digit as 1) or (with leftmost digit as 2).

360 numbers (=120+120+120) can be formed (with leftmost digit as 1) or (with leftmost digit as 2) or (with
eftmost digit as 3).

Hence, leftmost digit of the 249th number =3

Now, let's find out how many numbers can be formed with leftmost digit as 3 and next digit as 1.

The digit '3' is placed at the 1st position (only 1 way of doing this).
The digit '1' is placed at the 2nd position (only 1 way of doing this).
Any of the remaining 4 digits can be placed at 3rd position.
Since 3 digits are placed in the first three positions, any of the remaining 3 digits can be placed at the 4th position.
Since 4 digits are placed in the first four positions, any of the remaining 2 digits can be placed at the 5th position.
Since 5 digits are placed in the first five positions, the remaining 1 digit can be placed at the 6th position.

.e., total number of ways

=114321=24

.e., Total count of numbers which can be formed (with the leftmost digit as 3) and (next digit as 1) =24

Similarly, total count of numbers which can be formed (with the leftmost digit as 3) and (next digit as 2) =24

Hence, 120+120+24+24=288 numbers can be formed (with leftmost digit as 1) or (with leftmost digit as 2) or
with leftmost digit as 3 and next digit as 1) or (with leftmost digit as 3 and next digit as 2)

Hence, the 289th number is the minimum value number which is formed with the leftmost digit as 3 and next
digit as 4.

Therefore, the number is 341256

124. There are 12 intermediate stations between two places A and B. Find the number of ways in which a train
can be made to stop at 4 of these intermediate stations so that no two stopping stations are consecutive?
A. 108
B. 112
C. 126
D. 140
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option C

Explanation:

Note: Understand all the three solutions provided as these concepts will help you to solve many advanced
problems in permutations and combinations.

Solution 1

nitially, let's remove the 4 stopping stations. Then we are left with 8 non-stopping stations (=12-4) as shown
below.

non-stopping stations are marked as 1,2 ... 8)

Now there are 9 positions (as marked by * in the above figure) to place the 4 stopping stations such that no two
topping stations are consecutive. This can be done in 9C4 ways.

Hence, required number of ways

= 9C4=98764321=126

Solution 2

We can solve this problem by considering the four stops as fixed points and then finding out the number of ways
he other stations can be inserted between them.

Consider the diagram given below.

As shown in the above diagram, assume that there are four stopping stations (P,Q, R, S) between the places A
and B.

Now we need to place the 8 non-stopping stations (=12-4) in the five positions (D,E,F,G,H).

Let d,e,f,g,h be the number of stations at the positions D,E,F,G,H respectively.

Since the train may or may not halt at first station, d0

Since the train may or may not halt at last station, h0
e,f,g must be 1 to make the stopping stations non-consecutive.

hence, we can write this problem as an equation

d+e+f+g+h=8 where e,f,g1 and d,h0

To find the integral solutions of the above equation, first we need to make each restriction 0.

For that, give 1 to e, 1 to f and 1 to g and change their limits. Thus, the equation can be modified as
d+e+f+g+h=83=5 where d,e,f,g,h0

Now the equation is in a general form and can be solved using the formula given below
Number of non-negative integral solutions of equation x1+x2++xn=k

=(k+n1n1)
= (k+n-1)C(n-1)
reference]

here n=5 and k=5

Therefore, number of non-negative integral solutions to our equation

= (k+n-1)C(n-1) = (5+5-1)C(5-1) =9C4

=98764321=126

.e., required number of ways =126

Solution 3 (Note that initial part is similar to solution 2).

We can solve this problem by considering the four stops as fixed points and then finding out the number of ways
he other stations can be inserted between them.

Consider the diagram given below

As shown in the above diagram, assume that there are four stopping stations (P, Q, R, S) between the places A
and B.

Now we need to place the 8 non-stopping identical stations (=12-4) in the five distinct positions (D,E,F,G,H).
see the explanation provided at the bottom to understand why the stations are considered as identical and
positions as distinct).

Here,
1. Each of the positions (D,E,F,G,H) can contain multiple stations.
2. Position E,F and G must contain at least 1 station each to make the stopping stations non-consecutive.
3. Position D and H can contain 0 stations also (since the train can halt at first station and/or last station).

Hence, this situation is similar to the distribution of 8 identical balls into five distinct boxes where 3 particular
boxes must contain minimum 1 ball each.

Hence we can use "Distribution of k balls into n boxes: formula 5" to solve this.

First of all, remove the additional restriction by distributing 1 ball into each of the 3 particular boxes. (i.e., by
placing one station in each of the 3 particular positions E,F and G). Since the balls (stations) are identical, there
s only 1 way of doing this.

Now there are 5 (=8-3) balls(stations) left and these need to be distributed into 5 boxes(positions).

As per the formula mentioned above, now we can solve the problem
Here k=5, n=5
Total number of ways
= (k+n-1)C(n-1) = (5+5-1)C(5-1) = 9C4
=98764321=126

Hence, required number of ways =126

Explanation for why the stations are identical and positions are distinct in this question.

Positions are considered as distinct because they are in a row and it can be clearly identified. For example, the
arrangement in which the positions D,E,F,G,H contains 1,2,2,2,1
tations respectively (i,e.,one station in position D, two stations in position E, two stations in position F,two
tations in position G,one station in position H) is different from another arrangement in which the positions
D,E,F,G,H contains 1,2,2,1,2 stations respectively. Hence positions are distinct.

Stations are considered as identical because the order of stations is not important. For example, consider an
arrangement in which the positions D,E,F,G,H contains 1,2,2,2,1 stations respectively. Suppose you change the
order now by swapping the stations situated at D and H each other and form a new arrangement in which the
positions D,E,F,G,H contains 1,2,2,2,1 stations respectively. But both of these arrangements will be same.
Hence, the stations are considered as identical.

n other words, here configurations are only distinguished by the number of stations present in each location. For
example, an arrangement in which the positions D,E,F,G,H contains 1,2,2,2,1 stations respectively and another
arrangement in which the positions D,E,F,G,H contains 1,3,1,2,1
tations respectively are different.

125. In a locality, there are ten houses in a row. On a particular night a thief planned to steal from three houses of
he locality. In how many ways can he plan such that no two of them are next to each other?
A. 23
B. 24
C. 64
D. 56
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option D

Explanation:

Note: Understand all the three solutions provided as these concepts will help you to solve many advanced
problems in permutations and combinations.

Solution 1

nitially, let's remove the 3 houses where the thief planned to steal from. Then we are left with 103=7

houses as numbered below.

*1*2*3*4*5*6*7*

Now there are 8 positions as marked as * above to place the 3 houses (from where the thief steals) such that no
wo such houses are next to each other. This can be done in 8C3 ways.

Hence, required number of ways

= 8C3 =876321=56

Solution 2

We can solve this problem by considering the 3 houses (from which the thief steals) as fixed points and then
inding out the number of ways the other houses can be inserted between them,

A1B2C3D

Consider the above structure where 1,2,3 represents the houses from which the thief steals.

Now we need to place the other 7 (=103) houses in the positions (A,B,C,D)

Let a,b,c,d be the number of houses at the positions A,B,C,D respectively.

b,c must be 1 so that no two of the houses (from which the thief steals) can be next to each other.
Since the thief may or may not steal from the first house a0
Since the thief may or may not steal from the last house d0

Hence, we can write this problem as an equation

a+b+c+d=7 where b,c1 and a,d0

To find the integral solutions of the above equation, first we need to make each restriction 0

For that, we have to give 1 to b, 1 to c and change their limits. Thus, the equation can be modified as
a+b+c+d=72=5 where a,b,c,d0

Now the equation is in a general form and can be solved using the formula given below
Number of non-negative integral solutions of equation x1+x2++xn=k

=(k+n1n1)
= (k+n-1)C(n-1)
reference]

here n=4 and k=5

Hence, number of non-negative integral solutions to our equation

= (k+n-1)C(n-1) = (5+4-1)C(4-1)
=8C3 =876321=56

.e., required number of ways =56

Solution 3 (Note that initial part is similar to solution 2)

We can solve this problem by considering the 3 houses(from which the thief steals) as fixed points and then
inding out the number of ways the other houses can be inserted between them.

A1B2C3D

Consider the above structure where 1,2,3 represents the houses from which the thief steals.

Now we need to place the other 7 (=103) houses in the positions (A,B,C,D).

n other words, now we need to place the 7 identical houses(where the thief does not steal) in the four distinct
positions (A,B,C,D) (see the explanation provided at the bottom to understand why houses are considered as
dentical and positions as distinct).

Here,
1. Each of the positions (A,B,C,D) may contain multiple houses.
2. Positions B,C must contain at least 1 house each so that no two of the houses (from which the thief steals) can
be next to each other.
3. Position A and D can contain 0 houses also (since the thief may or may not steal from the first and/or last
house).

Hence, this situation is similar to the distribution of 7 identical balls into 4 distinct boxes where two particular
boxes must contain minimum one ball each.

Hence we can use "Distribution of k balls into n boxes: formula 5" to solve this.

First of all, remove the additional restriction by distributing 1 ball into each of the 2 particular boxes. (i.e., by
placing one house in each of the 2 particular positions B and C). Since the balls (houses) are identical, there is
only 1 way of doing this.

Now there are 5 (=72) balls(houses) left and these need to be distributed into 4 boxes(positions).

As per the formula mentioned above, we can now solve the problem
Here k = 5, n = 4
Total number of ways
= (k+n-1)C(n-1) = (5+4-1)C(4-1) = 8C3
=876321=56

Hence, required number of ways =56

Explanation for why the houses are identical and positions are distinct in this question.

Positions are considered as distinct because they are in a row and it can be clearly
dentified. For example, the arrangement in which the positions A,B,C,D contains 1,3,2,1 houses respectively
i,e.,one house in position A, three houses in position B, two houses in position C, one house in position D) is
different from another arrangement in which the positions A,B,C,D contains 1,3,1,2 houses respectively. Hence
positions are distinct.

Houses are considered as identical because the order of houses is not important. For example, consider an
arrangement in which the positions A,B,C,D contains 1,2,3,1 houses respectively. Suppose you change the order
now by swapping the houses situated at A and D with each other and form a new arrangement in which the
positions A,B,C,D contains 1,2,3,1 houses respectively. But both of these arrangements will be same. Hence, the
houses are considered as identical.

n other words, here configurations are only distinguished by the number of houses present in each location. For
example, an arrangement in which the positions A,B,C,D contains 1,3,2,1 houses respectively and another
arrangement in which the positions A,B,C,D contains 1,2,3,1
houses respectively are different.

126. In how many different ways three persons A, B, C having 6, 7 and 8 one rupee coins respectively can
donate Rs.10 collectively?
A. 12C2 - 5C2 - 4C2 - 3C1
B. 12C2 5C2 4C2 3C1
C. None of these
D. 12C2 + 5C2 + 4C2 + 3C1
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option A

Explanation:

Solution 1
Number of non-negative integral solutions of equation x1+x2++xn=k

=(k+n1n1)
= (k+n-1)C(n-1)
reference]

Here one rupee coins can be considered as identical and persons as distinct.

Required answer

= Number of ways in which three persons A, B, C having 6, 7, 8 one rupee coins respectively can donate Rs.10
collectively

= Number of ways 10 one rupee coins can be distributed to 3 persons A,B,C

where A can have maximum 6 coins, B can have maximum 7 coins and C can have maximum 8 coins

= (Number of ways 10 one rupee coins can be distributed to 3 persons A,B,C)

(Number of ways 10 one rupee coins can be distributed to 3 persons A,B,C where A has more than 6 coins)
(Number of ways 10 one rupee coins can be distributed to 3 persons A,B,C where B has more than 7 coins)
(Number of ways 10 one rupee coins can be distributed to 3 persons A,B,C where C has more than 8 coins)

= (Number of integral solutions of the equation

x1+x2+x3=10 where x1,x2,x30)

(Number of integral solutions of the equation
x1+x2+x3=10 where x17 and x2,x30)
(Number of integral solutions of the equation
x1+x2+x3=10 where x28 and x1,x30)
(Number of integral solutions of the equation
x1+x2+x3=10 where x39 and and x1,x20)
..(A)

Number of integral solutions of the equation

x1+x2+x3=10 where x1,x2,x30
= (k+n-1)C(n-1) = (10+3-1)C(3-1) (Reference: formula mentioned at top)
= 12C2 ...(B)

Number of integral solutions of the equation

x1+x2+x3=10 where x17 and x2,x30
= Number of integral solutions of the equation
x1+x2+x3=107=3 where x1,x2,x30 ( giving 7 to x1)
=(k+n-1)C(n-1) = (3+3-1)C(3-1) (Reference: formula mentioned at top)
=5C2 ...(C)

Number of integral solutions of the equation

x1+x2+x3=10 where x28 and x1,x30
= Number of integral solutions of the equation
x1+x2+x3=108=2 where x1,x2,x30 ( giving 8 to x2)
= (k+n-1)C(n-1) = (2+3-1)C(3-1) (Reference: formula mentioned at top)
=4C2 ...(D)

Number of integral solutions of the equation

x1+x2+x3=10 where x39 and and x1,x20
= Number of integral solutions of the equation
x1+x2+x3=109=1 where x1,x2,x30 ( giving 9 to x3)
= (k+n-1)C(n-1) = (1+3-1)C(3-1) (Reference: formula mentioned at top)
=3C2 =3C1 ...(E)

From (A),(B),(C),(D),(E),
Required number of ways
= 12C2 - 5C2 - 4C2 - 3C1

Solution 2
Let x1,x2,,xm
be integers.

Then the number of solutions to the equation

x1+x2++xm=n
ubject to the conditions a1x1b1,a2x2b2, ,amxmbm

s equal to the coefficient of xn in

xa1+xa1+1++xb1)(xa2+xa2+1++xb2)(xam+xam+1++xbm)

reference]

Here one rupee coins can be considered as identical and persons as distinct.

Required number of ways

= Number of ways in which three persons A, B, C having 6, 7 and 8 one rupee coins respectively can donate
Rs.10 collectively

= Number of ways 10 one rupee coins can be distributed to 3 persons A,B,C where A can have maximum 6
coins, B can have maximum 7 coins and C can have maximum 8 coins

= Number of integral solutions of the equation

x1+x2+x3=10
where 0x16, 0x27, 0x38

= coefficient of x10 in
x0+x1+x2++x6) (x0+x1+x2++x7) (x0+x1+x2++x8)

= coefficient of x10 in
1x7)(1x8)(1x9)(1x)3
(1+x+x2++xn) =(1xn+1)(1x)1]

= coefficient of x10 in (1x7x8x9)(1x)3

Removed all terms higher than x10 in the product (1x7)(1x8)(1x9)]
..(A)

To find out coefficient of x10 in (A), we can now expand (1x)3 as a (negative) binomial series. [Reference:
Binomial Theorem and Binomial Series]

1x)3=r=0(3r)(x)r=r=0(3r)(1)r(x)r=r=0(3)(31)(32)(3r+1)r!(1)r(x)r=r=0(1)r(3)(3+1)(3+2)(3+r1)r!
1)r(x)r=r=0(3)(3+1)(3+2)(3+r1)r!(x)r=r=0(3)(3+1)(3+2)(2+r)r!(x)r=r=0(r+2r)(x)r
..(B)

From (A) and (B),

coefficient of x10
n
1x7x8x9)(1x)3

= coefficient of x10 in
1x7x8x9)[r=0(r+2r)(x)r]

= coefficient of x10 in
1x7x8x9)[(20)x0+(31)x1+(42)x2+(53)x3++(1210)x10+(1311)x11+]

= coefficient of x10 in

1x7x8x9)[(20)x0+(31)x1+(42)x2+(53)x3++(1210)x10]
Removed all terms higher than x10

=(1210)(53)(42)(31)

= 12C10 - 5C3 - 4C2 - 3C1

= 12C2 - 5C2 - 4C2 - 3C1[ nCr = nC(n - r)]

.e, required number of ways

= 12C2 - 5C2 - 4C2 - 3C1

127. In how many ways can 12 people be divided into 3 groups where 4 persons must be there in each group?
A. None of these
B. 12!(4!)3

C. Insufficient Data

D. 12!(4!)33!

Hide Answer
| Discuss

Notebook
answer with explanation

Answer: Option D

Explanation:

Solution 1 : Using Formula

Number of ways in which mn

distinct things can be divided equally into n groups (each group will have m things and the groups are
unmarked, i.e., not distinct)
=(mn)!(m!)n n!

reference]

12 people needs to be divided into 3 groups where 4 persons must be there in each group.

Since it is not specified that groups are numbered(distinct), we can consider that groups are identical(not
distinct).

Hence, as per the above formula, required number of ways

=12!(4!)33!

Solution 2:

Since it is not specified that groups are numbered(distinct), we can consider that groups are identical(not
distinct).

Number of ways of selecting 4 persons from 12 persons = 12C4

Number of ways of selecting 4 persons from remaining 8 persons = 8C4
Number of ways of selecting 4 persons from remaining 4 persons = 4C4

Total number of ways

=12C48C44C43!=(12!8!4!)(8!4!4!)13!=12!(4!)33!

Note: We have divided by 3! to avoid overcounting because the groups are identical(not distinct) and all the three
groups have same number of persons. If the groups were numbered(distinct), there was no need to divide by 3!.

128. In how many ways can you divide 28 persons into three groups having 3, 5, and 20 persons?
A. 28!3!3!5!20!
B. 28!3!5!20!

C. None of these

D. 28!3!5!20!3!

Hide Answer
| Discuss

Notebook
answer with explanation

Answer: Option B

Explanation:

Solution 1: Using Formula

Number of ways in which n distinct things can be divided into r unequal groups containing a1, a2, a3, ......, ar
hings (different number of things in each group and the groups are unmarked, i.e., not distinct)

= nCa1 (n-a1)Ca2 ... (n-a1-a2 - ... -ar-1)Car

=n!a1! a2! a3! ar!

Note that a1+a2+a3++ar=n

reference]

28 persons need to be divided into three groups having 3, 5 and 20 persons.

Since it is not specified that groups are numbered(distinct), we can take groups as identical(not distinct).

Hence, as per the above formula, required number of ways

=28!3!5!20!

Solution 2

Since it is not specified that groups are numbered(distinct), we can take groups as identical(not distinct).

Number of ways of selecting 3 persons from 28 persons = 28C3

Number of ways of selecting 5 persons from remaining 25 persons = 25C5
Number of ways of selecting 20 persons from remaining 20 persons = 20C20

Total number of ways

= 28C3 25C5 20C20
=(28!25!3!)(25!20!5!)=28!3!5!20!

129. In how many ways can you divide 28 persons into three groups having 4, 12 and 12 persons?
A. 28!3!4!12!12!
B. 28!4!12!12!2!

C. 28!4!12!12!
D. 28!4!12!12!3!

Hide Answer
| Discuss

Notebook
answer with explanation

Answer: Option B

Explanation:

Solution 1: Using Formula

Number of ways in which n distinct things can be divided into r unequal groups containing a1, a2, a3, ......, ar
hings (different number of things in each group and the groups are unmarked, i.e., not distinct)

= nCa1 (n-a1)Ca2 ... (n-a1-a2 - ... -ar-1)Car

=n!a1! a2! a3! ar!

Note that a1+a2+a3++ar=n

reference]

28 persons need to be divided into three groups having 4, 12 and 12 persons.

Since it is not specified that groups are numbered(distinct), we can take groups as identical(not distinct).

Hence, as per the above formula, total number of ways

=28!4!12!12!

But,in this case, all groups are not unequal. Two groups are equal. Hence, we need to divide the answer we got
by 2! to avoid overcounting.

Hence, required number of ways

=28!4!12!12!2!

Solution 2

Since it is not specified that groups are numbered(distinct), we can take groups as identical(not distinct).

Number of ways of selecting 4 persons from 28 persons = 28C4

Number of ways of selecting 12 persons from remaining 24 persons = 24C12
Number of ways of selecting 12 persons from remaining 12 persons = 12C12

Total number of ways

=28C424C1212C122!=(28!24!4!)(24!12!12!)12!=28!4!12!12!2!

We have divided by 2! to avoid overcounting because the groups are identical(not distinct) and two groups have
he same number of objects in them. Therefore whether we select an object for one of these two groups or the
other, the selection is essentially the same. Therefore we must divide by the factorial of the number of groups of
he same size in order to account for the extra counting.

130. In how how many ways can you divide a group of 12 people into 2 groups of 3 people and 3 groups of 2
people?
A. 12!(2!)3 (3!)2
B. 12!(2!)4 (3!)3

C. 12!(2!)6 (3!)4

D. None of these
Hide Answer
| Discuss

Notebook
answer with explanation

Answer: Option B

Explanation:

Solution 1 : Using Formula

Number of ways in which n distinct things can be divided into r unequal groups containing a1, a2, a3, ......, ar
hings (different number of things in each group and the groups are unmarked, i.e., not distinct)

= nCa1 (n-a1)Ca2 ... (n-a1-a2 - ... -ar-1)Car

=n!a1! a2! a3! ar!

Note that a1+a2+a3++ar=n

reference]

12 people need to be divided into one group of 3 people, one group of 3 people, one group of 2 people, one
group of 2 people, one group of 2 people.

Since it is not specified that groups are numbered(distinct), we can take groups as identical(not distinct).

Hence, as per the above formula, total number of ways=12!3!3!2!2!2!=12!(3!)2 (2!)3

But in this case, all groups are not unequal.

Two groups containing 3 people each are equal.
Three groups containing 2 people each are equal.
Hence, we need to divide the answer we got by 2! and 3! to avoid overcounting.

Hence, required number of ways

=12!(3!)2 (2!)33!2!=12!(3!)3 (2!)4

Solution 2

Since it is not specified that groups are numbered(distinct), we can take groups as identical(not distinct).

Number of ways of selecting 3 persons from 12 persons = 12C3

Number of ways of selecting 3 persons from remaining 9 persons = 9C3

Number of ways of selecting 2 persons from remaining 6 persons = 6C2

Number of ways of selecting 2 persons from remaining 4 persons = 4C2
Number of ways of selecting 2 persons from remaining 2 persons = 2C2

Total number of ways

=12C39C36C24C22C22!3!=12!9!3!9!6!3!6!4!2!4!2!2!12!13!=12!(2!)4 (3!)3

We have divided by 2! and 3! to avoid overcounting because the groups are identical, two groups contain 3
people each and three groups contain 2 people each.

131. There are 4 oranges, 5 apples and 6 mangoes in a basket. In how many ways can a person make a selection
of fruits among the fruits in the basket?
A. 210
B. 209
C. 256
D. 220
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option B

Explanation:

Solution 1 :Using Formula

Number of ways in which one or more objects can be selected out of S1 alike objects of one kind, S2 alike objects
of second kind , S3 alike objects of third kind and so on ... Sn alike objects of nth kind
= (S1 + 1) (S2 + 1)(S3 + 1)...(Sn + 1) - 1

reference]

Whenever it is not explicitly mentioned that fruits are distinct, we take them as identical. (Persons/men/women
are normally considered as distinct.)

Hence, here we consider that

all 4 oranges are identical,
all 5 apples are identical
all 6 mangoes are identical.

As per the formula, required number of ways=(4+1)(5+1)(6+1)1=5671=209

Solution 2

Whenever it is not explicitly mentioned that fruits are distinct, we take them as identical.(Persons/men/women
are normally considered as distinct.)

or more oranges can be selected from 4 identical oranges in (4+1)=5 ways.

0 or more apples can be selected from 5 identical apples in (5+1)=6 ways.
0 or more mangoes can be selected from 6 identical mangoes in (6+1)=7 ways.

Total number of ways

=567=210

But in these 210 selections, there is one selection where count of each fruit is 0 (i.e., no fruit is selected). Hence
we need to reduce this selection.

Therefore, required number of ways

=2101=209

132. Ten different letters of alphabet are given. Words with six letters are formed from these given letters. Find
he number of words which have at least one letter repeated?
A. 10P6
B. 106

C. 10C6
View Answer

D. 106 - 10P6
| Discuss

Notebook

133. How many factors of 253652

are perfect squares?
A. 24
C. 16
Hide Answer

B. 12
D. 22
| Discuss

Notebook
answer with explanation

Answer: Option A

Explanation:

Any factor of 253652

which is a perfect square will be of the form 2a3b5c where a can be 0 or 2 or 4 (3 ways)
b can be 0 or 2 or 4 or 6 (4 ways)
c can be 0 or 2 (2 ways)

Required number of factors

=342=24

134. There are 6 boxes numbered 1,2,...,6. Each box needs to be filled up either with a red or a blue ball in such
a way that at least 1 box contains a blue ball and the boxes containing blue balls are consecutively numbered.
The total number of ways in which this can be done is
A. 24
B. 23
C. 21
D. 18
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option C

Explanation:

Case 1: Exactly one box contains a blue ball

One blue ball can be placed into any of the 6 boxes. i.e, 6 ways of doing this.

Red balls can be filled in the remaining boxes. Since red balls are identical, there is only 1 way of doing this.

Total number of ways =61=6

Case 2: Exactly two boxes contain blue balls

Two blue balls can be placed into (box 1 and box 2) or (box 2 and box 3) or (box 3 and box 4) or (box 4 and box
5) or (box 5 and box 6). i.e, 5 ways of doing this.

Red balls can be filled in the remaining boxes. Since red balls are identical, there is only 1 way of doing this.

Total number of ways =51=5

Case 3: Exactly three boxes contain blue balls

Three blue balls can be placed into (box 1 , box 2 and box 3) or (box 2, box 3 and box 4) or (box 3 , box 4 and
box 5) or (box 4, box 5 and box 6). i.e, 4 ways of doing this.

Red balls can be filled in the remaining boxes. Since red balls are identical, there is only 1 way of doing this.

Total number of ways =41=4

Case 4: Exactly four boxes contain blue balls

Four blue balls can be placed into (box 1 , box 2, box 3 and box 4) or (box 2, box 3, box 4 and box 5) or (box 3 ,
box 4, box 5 and box 6). i.e, 3 ways of doing this.

Red balls can be filled in the remaining boxes. Since red balls are identical, there is only 1 way of doing this.

Total number of ways =31=3

Case 5: Exactly five boxes contain blue balls

Five blue balls can be placed into (box 1, box 2, box 3, box 4 and box 5) or (box 2, box 3, box 4, box 5 and box
6). i.e, 2 ways of doing this.

Red balls can be filled in the remaining boxes. Since red balls are identical, there is only 1 way of doing this.

Total number of ways =21=2

Case 6: All the six boxes contain blue balls

Six blue balls can be placed into (box 1 , box 2, box 3, box 4, box 5 and box 6). i.e, only 1 way of doing this.

Total number of ways = 1

Hence, required number of ways

=6+5+4+3+2+1=21
Problems on Permutations and Combinations - Solved Examples(Set 5)
121. In how many ways can 10 engineers and 4 doctors be seated at a round table if all the 4 doctors do not sit
ogether?
A. 13!(10!4!)
B. 13!4!

C. 14!
D. 10!4!

Hide Answer
| Discuss

Notebook
answer with explanation

Answer: Option A

Explanation:

Number of circular permutations (arrangements) of n

distinct things
=(n1)!

Reference: Circular permutations - Case 1]

nitially let's find out the number of ways in which 10 engineers and 4 doctors can be seated at a round table.

n this case, n

= total number of persons =10+4=14

Hence, number of ways in which 10 engineers and 4 doctors can be seated at a round table
=(141)!=13! ...(A)

Now let's find out the number of ways in which 10 engineers and 4 doctors can be seated at a round table where
all the 4 doctors sit together.

Since all the 4 doctors sit together, group them together and consider as a single doctor.
Hence, n = total number of persons =10+1=11
These 11 persons can be seated at a round table in (111)!=10! ways ...(B)
The 4 doctors can be arranged among themselves in 4! ways ...(C)

From (B) and (C), number of ways in which 10 engineers and 4 doctors can be seated at a round table where all
he 4 doctors sit together
=10!4! ...(D)

From (A) and (D),

number of ways in which 10 engineers and 4 doctors can be seated at a round table if all the 4 doctors do not sit
ogether
=13!(10!4!)

122. In a chess competition involving some men and women, every player needs to play exactly one game with
every other player. It was found that in 45 games, both the players were women and in 190 games, both players
were men. What is the number of games in which one person was a man and other person was a woman?
A. 40
B. 200
C. 180
D. 120
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option B

Explanation:

Let total number of women =w

otal number of men =m

Number of games in which both players were women =45

wC2=45w(w1)2=45w(w1)=90w=10

Number of games in which both players were men =190

mC2=190m(m1)2=190m(m1)=380m=20

We have got that

Total number of women = 10
Total number of men = 20

Required number of games in which one person was a man and other person was a woman
= 20C1 10C1 =2010=200

123. If each permutation of the digits 1,2,3,4,5,6

are listed in the increasing order of magnitude, then 289
h
term will be
A. 361452
B. 321546
C. 321456
D. 341256
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option D

Explanation:

Let's see how many numbers can be formed with leftmost digit as 1

The digit '1' is placed at the 1st position (only 1 way of doing this).
Since one digit is placed at the 1st position, any of the remaining 5 digits can be placed at 2nd position.
Since one digit is placed at the 1st position and another digit is placed at the 2nd position, any of the remaining 4
digits can be placed at the 3rd position.
So on ...

otal number of ways

=154321=120

.e., total count of numbers which can be formed with leftmost digit as 1 =120

Similarly, total count of numbers which can be formed with leftmost digit as 2 =120

Similarly, total count of numbers which can be formed with leftmost digit as 3 =120

.e., 240 numbers (=120+120) can be formed (with leftmost digit as 1) or (with leftmost digit as 2).

360 numbers (=120+120+120) can be formed (with leftmost digit as 1) or (with leftmost digit as 2) or (with

eftmost digit as 3).

Hence, leftmost digit of the 249th number =3

Now, let's find out how many numbers can be formed with leftmost digit as 3 and next digit as 1.

The digit '3' is placed at the 1st position (only 1 way of doing this).
The digit '1' is placed at the 2nd position (only 1 way of doing this).
Any of the remaining 4 digits can be placed at 3rd position.
Since 3 digits are placed in the first three positions, any of the remaining 3 digits can be placed at the 4th position.
Since 4 digits are placed in the first four positions, any of the remaining 2 digits can be placed at the 5th position.
Since 5 digits are placed in the first five positions, the remaining 1 digit can be placed at the 6th position.

.e., total number of ways

=114321=24

.e., Total count of numbers which can be formed (with the leftmost digit as 3) and (next digit as 1) =24

Similarly, total count of numbers which can be formed (with the leftmost digit as 3) and (next digit as 2) =24

Hence, 120+120+24+24=288 numbers can be formed (with leftmost digit as 1) or (with leftmost digit as 2) or
with leftmost digit as 3 and next digit as 1) or (with leftmost digit as 3 and next digit as 2)

Hence, the 289th number is the minimum value number which is formed with the leftmost digit as 3 and next
digit as 4.

Therefore, the number is 341256

124. There are 12 intermediate stations between two places A and B. Find the number of ways in which a train
can be made to stop at 4 of these intermediate stations so that no two stopping stations are consecutive?
A. 108
B. 112
C. 126
D. 140
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option C

Explanation:

Note: Understand all the three solutions provided as these concepts will help you to solve many advanced

problems in permutations and combinations.

Solution 1

nitially, let's remove the 4 stopping stations. Then we are left with 8 non-stopping stations (=12-4) as shown
below.

non-stopping stations are marked as 1,2 ... 8)

Now there are 9 positions (as marked by * in the above figure) to place the 4 stopping stations such that no two
topping stations are consecutive. This can be done in 9C4 ways.

Hence, required number of ways

= 9C4=98764321=126

Solution 2

We can solve this problem by considering the four stops as fixed points and then finding out the number of ways
he other stations can be inserted between them.

Consider the diagram given below.

As shown in the above diagram, assume that there are four stopping stations (P,Q, R, S) between the places A
and B.

Now we need to place the 8 non-stopping stations (=12-4) in the five positions (D,E,F,G,H).

Let d,e,f,g,h be the number of stations at the positions D,E,F,G,H respectively.

Since the train may or may not halt at first station, d0

Since the train may or may not halt at last station, h0
e,f,g must be 1 to make the stopping stations non-consecutive.

hence, we can write this problem as an equation

d+e+f+g+h=8 where e,f,g1 and d,h0

To find the integral solutions of the above equation, first we need to make each restriction 0.

For that, give 1 to e, 1 to f and 1 to g and change their limits. Thus, the equation can be modified as
d+e+f+g+h=83=5 where d,e,f,g,h0

Now the equation is in a general form and can be solved using the formula given below
Number of non-negative integral solutions of equation x1+x2++xn=k

=(k+n1n1)
= (k+n-1)C(n-1)
reference]

here n=5 and k=5

Therefore, number of non-negative integral solutions to our equation

= (k+n-1)C(n-1) = (5+5-1)C(5-1) =9C4
=98764321=126

.e., required number of ways =126

Solution 3 (Note that initial part is similar to solution 2).

We can solve this problem by considering the four stops as fixed points and then finding out the number of ways
he other stations can be inserted between them.

Consider the diagram given below

As shown in the above diagram, assume that there are four stopping stations (P, Q, R, S) between the places A
and B.

Now we need to place the 8 non-stopping identical stations (=12-4) in the five distinct positions (D,E,F,G,H).
see the explanation provided at the bottom to understand why the stations are considered as identical and
positions as distinct).

Here,
1. Each of the positions (D,E,F,G,H) can contain multiple stations.
2. Position E,F and G must contain at least 1 station each to make the stopping stations non-consecutive.
3. Position D and H can contain 0 stations also (since the train can halt at first station and/or last station).

Hence, this situation is similar to the distribution of 8 identical balls into five distinct boxes where 3 particular
boxes must contain minimum 1 ball each.

Hence we can use "Distribution of k balls into n boxes: formula 5" to solve this.

First of all, remove the additional restriction by distributing 1 ball into each of the 3 particular boxes. (i.e., by
placing one station in each of the 3 particular positions E,F and G). Since the balls (stations) are identical, there
s only 1 way of doing this.

Now there are 5 (=8-3) balls(stations) left and these need to be distributed into 5 boxes(positions).

As per the formula mentioned above, now we can solve the problem
Here k=5, n=5
Total number of ways
= (k+n-1)C(n-1) = (5+5-1)C(5-1) = 9C4
=98764321=126

Hence, required number of ways =126

Explanation for why the stations are identical and positions are distinct in this question.

Positions are considered as distinct because they are in a row and it can be clearly identified. For example, the
arrangement in which the positions D,E,F,G,H contains 1,2,2,2,1
tations respectively (i,e.,one station in position D, two stations in position E, two stations in position F,two
tations in position G,one station in position H) is different from another arrangement in which the positions
D,E,F,G,H contains 1,2,2,1,2 stations respectively. Hence positions are distinct.

Stations are considered as identical because the order of stations is not important. For example, consider an
arrangement in which the positions D,E,F,G,H contains 1,2,2,2,1 stations respectively. Suppose you change the
order now by swapping the stations situated at D and H each other and form a new arrangement in which the
positions D,E,F,G,H contains 1,2,2,2,1 stations respectively. But both of these arrangements will be same.
Hence, the stations are considered as identical.

n other words, here configurations are only distinguished by the number of stations present in each location. For
example, an arrangement in which the positions D,E,F,G,H contains 1,2,2,2,1 stations respectively and another
arrangement in which the positions D,E,F,G,H contains 1,3,1,2,1
tations respectively are different.

125. In a locality, there are ten houses in a row. On a particular night a thief planned to steal from three houses of
he locality. In how many ways can he plan such that no two of them are next to each other?
A. 23
B. 24
C. 64
D. 56
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option D

Explanation:

Note: Understand all the three solutions provided as these concepts will help you to solve many advanced
problems in permutations and combinations.

Solution 1

nitially, let's remove the 3 houses where the thief planned to steal from. Then we are left with 103=7
houses as numbered below.

*1*2*3*4*5*6*7*

Now there are 8 positions as marked as * above to place the 3 houses (from where the thief steals) such that no
wo such houses are next to each other. This can be done in 8C3 ways.

Hence, required number of ways

= 8C3 =876321=56

Solution 2

We can solve this problem by considering the 3 houses (from which the thief steals) as fixed points and then
inding out the number of ways the other houses can be inserted between them,

A1B2C3D

Consider the above structure where 1,2,3 represents the houses from which the thief steals.

Now we need to place the other 7 (=103) houses in the positions (A,B,C,D)

Let a,b,c,d be the number of houses at the positions A,B,C,D respectively.

b,c must be 1 so that no two of the houses (from which the thief steals) can be next to each other.
Since the thief may or may not steal from the first house a0
Since the thief may or may not steal from the last house d0

Hence, we can write this problem as an equation

a+b+c+d=7 where b,c1 and a,d0

To find the integral solutions of the above equation, first we need to make each restriction 0

For that, we have to give 1 to b, 1 to c and change their limits. Thus, the equation can be modified as
a+b+c+d=72=5 where a,b,c,d0

Now the equation is in a general form and can be solved using the formula given below
Number of non-negative integral solutions of equation x1+x2++xn=k

=(k+n1n1)
= (k+n-1)C(n-1)
reference]

here n=4 and k=5

Hence, number of non-negative integral solutions to our equation

= (k+n-1)C(n-1) = (5+4-1)C(4-1)
=8C3 =876321=56

.e., required number of ways =56

Solution 3 (Note that initial part is similar to solution 2)

We can solve this problem by considering the 3 houses(from which the thief steals) as fixed points and then
inding out the number of ways the other houses can be inserted between them.

A1B2C3D

Consider the above structure where 1,2,3 represents the houses from which the thief steals.

Now we need to place the other 7 (=103) houses in the positions (A,B,C,D).

n other words, now we need to place the 7 identical houses(where the thief does not steal) in the four distinct
positions (A,B,C,D) (see the explanation provided at the bottom to understand why houses are considered as
dentical and positions as distinct).

Here,
1. Each of the positions (A,B,C,D) may contain multiple houses.
2. Positions B,C must contain at least 1 house each so that no two of the houses (from which the thief steals) can
be next to each other.
3. Position A and D can contain 0 houses also (since the thief may or may not steal from the first and/or last
house).

Hence, this situation is similar to the distribution of 7 identical balls into 4 distinct boxes where two particular
boxes must contain minimum one ball each.

Hence we can use "Distribution of k balls into n boxes: formula 5" to solve this.

First of all, remove the additional restriction by distributing 1 ball into each of the 2 particular boxes. (i.e., by
placing one house in each of the 2 particular positions B and C). Since the balls (houses) are identical, there is
only 1 way of doing this.

Now there are 5 (=72) balls(houses) left and these need to be distributed into 4 boxes(positions).

As per the formula mentioned above, we can now solve the problem
Here k = 5, n = 4
Total number of ways
= (k+n-1)C(n-1) = (5+4-1)C(4-1) = 8C3
=876321=56

Hence, required number of ways =56

Explanation for why the houses are identical and positions are distinct in this question.

Positions are considered as distinct because they are in a row and it can be clearly
dentified. For example, the arrangement in which the positions A,B,C,D contains 1,3,2,1 houses respectively
i,e.,one house in position A, three houses in position B, two houses in position C, one house in position D) is
different from another arrangement in which the positions A,B,C,D contains 1,3,1,2 houses respectively. Hence
positions are distinct.

Houses are considered as identical because the order of houses is not important. For example, consider an
arrangement in which the positions A,B,C,D contains 1,2,3,1 houses respectively. Suppose you change the order
now by swapping the houses situated at A and D with each other and form a new arrangement in which the
positions A,B,C,D contains 1,2,3,1 houses respectively. But both of these arrangements will be same. Hence, the
houses are considered as identical.

n other words, here configurations are only distinguished by the number of houses present in each location. For
example, an arrangement in which the positions A,B,C,D contains 1,3,2,1 houses respectively and another
arrangement in which the positions A,B,C,D contains 1,2,3,1

houses respectively are different.

126. In how many different ways three persons A, B, C having 6, 7 and 8 one rupee coins respectively can
donate Rs.10 collectively?
A. 12C2 - 5C2 - 4C2 - 3C1
B. 12C2 5C2 4C2 3C1
C. None of these
D. 12C2 + 5C2 + 4C2 + 3C1
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option A

Explanation:

Solution 1
Number of non-negative integral solutions of equation x1+x2++xn=k

=(k+n1n1)
= (k+n-1)C(n-1)
reference]

Here one rupee coins can be considered as identical and persons as distinct.

Required answer

= Number of ways in which three persons A, B, C having 6, 7, 8 one rupee coins respectively can donate Rs.10
collectively

= Number of ways 10 one rupee coins can be distributed to 3 persons A,B,C

where A can have maximum 6 coins, B can have maximum 7 coins and C can have maximum 8 coins

= (Number of ways 10 one rupee coins can be distributed to 3 persons A,B,C)

(Number of ways 10 one rupee coins can be distributed to 3 persons A,B,C where A has more than 6 coins)
(Number of ways 10 one rupee coins can be distributed to 3 persons A,B,C where B has more than 7 coins)
(Number of ways 10 one rupee coins can be distributed to 3 persons A,B,C where C has more than 8 coins)

= (Number of integral solutions of the equation

x1+x2+x3=10 where x1,x2,x30)
(Number of integral solutions of the equation
x1+x2+x3=10 where x17 and x2,x30)
(Number of integral solutions of the equation
x1+x2+x3=10 where x28 and x1,x30)
(Number of integral solutions of the equation
x1+x2+x3=10 where x39 and and x1,x20)
..(A)

Number of integral solutions of the equation

x1+x2+x3=10 where x1,x2,x30

= (k+n-1)C(n-1) = (10+3-1)C(3-1) (Reference: formula mentioned at top)
= 12C2 ...(B)

Number of integral solutions of the equation

x1+x2+x3=10 where x17 and x2,x30
= Number of integral solutions of the equation
x1+x2+x3=107=3 where x1,x2,x30 ( giving 7 to x1)
=(k+n-1)C(n-1) = (3+3-1)C(3-1) (Reference: formula mentioned at top)
=5C2 ...(C)

Number of integral solutions of the equation

x1+x2+x3=10 where x28 and x1,x30
= Number of integral solutions of the equation
x1+x2+x3=108=2 where x1,x2,x30 ( giving 8 to x2)
= (k+n-1)C(n-1) = (2+3-1)C(3-1) (Reference: formula mentioned at top)
=4C2 ...(D)

Number of integral solutions of the equation

x1+x2+x3=10 where x39 and and x1,x20
= Number of integral solutions of the equation
x1+x2+x3=109=1 where x1,x2,x30 ( giving 9 to x3)
= (k+n-1)C(n-1) = (1+3-1)C(3-1) (Reference: formula mentioned at top)
=3C2 =3C1 ...(E)

From (A),(B),(C),(D),(E),
Required number of ways
= 12C2 - 5C2 - 4C2 - 3C1

Solution 2
Let x1,x2,,xm
be integers.

Then the number of solutions to the equation

x1+x2++xm=n
ubject to the conditions a1x1b1,a2x2b2, ,amxmbm

s equal to the coefficient of xn in

xa1+xa1+1++xb1)(xa2+xa2+1++xb2)(xam+xam+1++xbm)

reference]

Here one rupee coins can be considered as identical and persons as distinct.

Required number of ways

= Number of ways in which three persons A, B, C having 6, 7 and 8 one rupee coins respectively can donate
Rs.10 collectively

= Number of ways 10 one rupee coins can be distributed to 3 persons A,B,C where A can have maximum 6
coins, B can have maximum 7 coins and C can have maximum 8 coins

= Number of integral solutions of the equation

x1+x2+x3=10
where 0x16, 0x27, 0x38

= coefficient of x10 in
x0+x1+x2++x6) (x0+x1+x2++x7) (x0+x1+x2++x8)

= coefficient of x10 in
1x7)(1x8)(1x9)(1x)3
(1+x+x2++xn) =(1xn+1)(1x)1]

= coefficient of x10 in (1x7x8x9)(1x)3

Removed all terms higher than x10 in the product (1x7)(1x8)(1x9)]
..(A)

To find out coefficient of x10 in (A), we can now expand (1x)3 as a (negative) binomial series. [Reference:
Binomial Theorem and Binomial Series]

1x)3=r=0(3r)(x)r=r=0(3r)(1)r(x)r=r=0(3)(31)(32)(3r+1)r!(1)r(x)r=r=0(1)r(3)(3+1)(3+2)(3+r1)r!

1)r(x)r=r=0(3)(3+1)(3+2)(3+r1)r!(x)r=r=0(3)(3+1)(3+2)(2+r)r!(x)r=r=0(r+2r)(x)r

..(B)

From (A) and (B),

coefficient of x10
n
1x7x8x9)(1x)3

= coefficient of x10 in
1x7x8x9)[r=0(r+2r)(x)r]

= coefficient of x10 in
1x7x8x9)[(20)x0+(31)x1+(42)x2+(53)x3++(1210)x10+(1311)x11+]

= coefficient of x10 in
1x7x8x9)[(20)x0+(31)x1+(42)x2+(53)x3++(1210)x10]
Removed all terms higher than x10

=(1210)(53)(42)(31)

= 12C10 - 5C3 - 4C2 - 3C1

= 12C2 - 5C2 - 4C2 - 3C1[ nCr = nC(n - r)]

.e, required number of ways

= 12C2 - 5C2 - 4C2 - 3C1

127. In how many ways can 12 people be divided into 3 groups where 4 persons must be there in each group?
A. None of these
B. 12!(4!)3

C. Insufficient Data

Hide Answer

D. 12!(4!)33!
| Discuss

Notebook
answer with explanation

Answer: Option D

Explanation:

Solution 1 : Using Formula

Number of ways in which mn

distinct things can be divided equally into n groups (each group will have m things and the groups are
unmarked, i.e., not distinct)
=(mn)!(m!)n n!

reference]

12 people needs to be divided into 3 groups where 4 persons must be there in each group.

Since it is not specified that groups are numbered(distinct), we can consider that groups are identical(not
distinct).

Hence, as per the above formula, required number of ways

=12!(4!)33!

Solution 2:

Since it is not specified that groups are numbered(distinct), we can consider that groups are identical(not
distinct).

Number of ways of selecting 4 persons from 12 persons = 12C4

Number of ways of selecting 4 persons from remaining 8 persons = 8C4
Number of ways of selecting 4 persons from remaining 4 persons = 4C4

Total number of ways

=12C48C44C43!=(12!8!4!)(8!4!4!)13!=12!(4!)33!

Note: We have divided by 3! to avoid overcounting because the groups are identical(not distinct) and all the three
groups have same number of persons. If the groups were numbered(distinct), there was no need to divide by 3!.

128. In how many ways can you divide 28 persons into three groups having 3, 5, and 20 persons?
A. 28!3!3!5!20!
B. 28!3!5!20!

C. None of these

D. 28!3!5!20!3!

Hide Answer
| Discuss

Notebook
answer with explanation

Answer: Option B

Explanation:

Solution 1: Using Formula

Number of ways in which n distinct things can be divided into r unequal groups containing a1, a2, a3, ......, ar
hings (different number of things in each group and the groups are unmarked, i.e., not distinct)

= nCa1 (n-a1)Ca2 ... (n-a1-a2 - ... -ar-1)Car

=n!a1! a2! a3! ar!

Note that a1+a2+a3++ar=n

reference]

28 persons need to be divided into three groups having 3, 5 and 20 persons.

Since it is not specified that groups are numbered(distinct), we can take groups as identical(not distinct).

Hence, as per the above formula, required number of ways

=28!3!5!20!

Solution 2

Since it is not specified that groups are numbered(distinct), we can take groups as identical(not distinct).

Number of ways of selecting 3 persons from 28 persons = 28C3

Number of ways of selecting 5 persons from remaining 25 persons = 25C5
Number of ways of selecting 20 persons from remaining 20 persons = 20C20

Total number of ways

= 28C3 25C5 20C20
=(28!25!3!)(25!20!5!)=28!3!5!20!

129. In how many ways can you divide 28 persons into three groups having 4, 12 and 12 persons?
A. 28!3!4!12!12!
B. 28!4!12!12!2!

C. 28!4!12!12!
D. 28!4!12!12!3!

Hide Answer

| Discuss

Notebook
answer with explanation

Answer: Option B

Explanation:

Solution 1: Using Formula

Number of ways in which n distinct things can be divided into r unequal groups containing a1, a2, a3, ......, ar
hings (different number of things in each group and the groups are unmarked, i.e., not distinct)

= nCa1 (n-a1)Ca2 ... (n-a1-a2 - ... -ar-1)Car

=n!a1! a2! a3! ar!

Note that a1+a2+a3++ar=n

reference]

28 persons need to be divided into three groups having 4, 12 and 12 persons.

Since it is not specified that groups are numbered(distinct), we can take groups as identical(not distinct).

Hence, as per the above formula, total number of ways

=28!4!12!12!

But,in this case, all groups are not unequal. Two groups are equal. Hence, we need to divide the answer we got
by 2! to avoid overcounting.

Hence, required number of ways

=28!4!12!12!2!

Solution 2

Since it is not specified that groups are numbered(distinct), we can take groups as identical(not distinct).

Number of ways of selecting 4 persons from 28 persons = 28C4

Number of ways of selecting 12 persons from remaining 24 persons = 24C12
Number of ways of selecting 12 persons from remaining 12 persons = 12C12

Total number of ways

=28C424C1212C122!=(28!24!4!)(24!12!12!)12!=28!4!12!12!2!

We have divided by 2! to avoid overcounting because the groups are identical(not distinct) and two groups have
he same number of objects in them. Therefore whether we select an object for one of these two groups or the
other, the selection is essentially the same. Therefore we must divide by the factorial of the number of groups of
he same size in order to account for the extra counting.

130. In how how many ways can you divide a group of 12 people into 2 groups of 3 people and 3 groups of 2
people?
A. 12!(2!)3 (3!)2
B. 12!(2!)4 (3!)3

C. 12!(2!)6 (3!)4
D. None of these
Hide Answer

Notebook
answer with explanation

| Discuss

Answer: Option B

Explanation:

Solution 1 : Using Formula

Number of ways in which n distinct things can be divided into r unequal groups containing a1, a2, a3, ......, ar
hings (different number of things in each group and the groups are unmarked, i.e., not distinct)

= nCa1 (n-a1)Ca2 ... (n-a1-a2 - ... -ar-1)Car

=n!a1! a2! a3! ar!

Note that a1+a2+a3++ar=n

reference]

12 people need to be divided into one group of 3 people, one group of 3 people, one group of 2 people, one
group of 2 people, one group of 2 people.

Since it is not specified that groups are numbered(distinct), we can take groups as identical(not distinct).

Hence, as per the above formula, total number of ways=12!3!3!2!2!2!=12!(3!)2 (2!)3

But in this case, all groups are not unequal.

Two groups containing 3 people each are equal.
Three groups containing 2 people each are equal.
Hence, we need to divide the answer we got by 2! and 3! to avoid overcounting.

Hence, required number of ways

=12!(3!)2 (2!)33!2!=12!(3!)3 (2!)4

Solution 2

Since it is not specified that groups are numbered(distinct), we can take groups as identical(not distinct).

Number of ways of selecting 3 persons from 12 persons = 12C3

Number of ways of selecting 3 persons from remaining 9 persons = 9C3
Number of ways of selecting 2 persons from remaining 6 persons = 6C2
Number of ways of selecting 2 persons from remaining 4 persons = 4C2
Number of ways of selecting 2 persons from remaining 2 persons = 2C2

Total number of ways

=12C39C36C24C22C22!3!=12!9!3!9!6!3!6!4!2!4!2!2!12!13!=12!(2!)4 (3!)3

We have divided by 2! and 3! to avoid overcounting because the groups are identical, two groups contain 3
people each and three groups contain 2 people each.

131. There are 4 oranges, 5 apples and 6 mangoes in a basket. In how many ways can a person make a selection
of fruits among the fruits in the basket?
A. 210
B. 209
C. 256
D. 220
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option B

Explanation:

Solution 1 :Using Formula

Number of ways in which one or more objects can be selected out of S1 alike objects of one kind, S2 alike objects
of second kind , S3 alike objects of third kind and so on ... Sn alike objects of nth kind
= (S1 + 1) (S2 + 1)(S3 + 1)...(Sn + 1) - 1

reference]

Whenever it is not explicitly mentioned that fruits are distinct, we take them as identical. (Persons/men/women
are normally considered as distinct.)

Hence, here we consider that

all 4 oranges are identical,
all 5 apples are identical
all 6 mangoes are identical.

As per the formula, required number of ways=(4+1)(5+1)(6+1)1=5671=209

Solution 2

Whenever it is not explicitly mentioned that fruits are distinct, we take them as identical.(Persons/men/women
are normally considered as distinct.)

or more oranges can be selected from 4 identical oranges in (4+1)=5 ways.

0 or more apples can be selected from 5 identical apples in (5+1)=6 ways.

0 or more mangoes can be selected from 6 identical mangoes in (6+1)=7 ways.

Total number of ways

=567=210

But in these 210 selections, there is one selection where count of each fruit is 0 (i.e., no fruit is selected). Hence
we need to reduce this selection.

Therefore, required number of ways

=2101=209

132. Ten different letters of alphabet are given. Words with six letters are formed from these given letters. Find
he number of words which have at least one letter repeated?
A. 10P6
B. 106

C. 10C6
Hide Answer

D. 106 - 10P6
| Discuss

Notebook
answer with explanation

Answer: Option D

Explanation:

nitially let's find out the number of six letter words which can be formed from ten different letters when any
etter may be repeated any number of times.

Any of the 10

etters can be placed at each place of the 6-letter word.

10
10
10
10
10
10
Hence, number of 6-letter words which can be formed from ten different letters when any letter may be repeated
any number of times (this will also include the number of words formed when no letter is repeated) =106 ...(A)

Number of 6-letter words which can be formed from ten different letters when no letter is repeated = 10P6 ...(B)

rom (A) and (B)

equired number of ways
=106
10
P6

133. How many factors of 253652

are perfect squares?
A. 24
C. 16

B. 12
D. 22

Hide Answer
| Discuss

Notebook
answer with explanation

Answer: Option A

Explanation:

Any factor of 253652

which is a perfect square will be of the form 2a3b5c where a can be 0 or 2 or 4 (3 ways)
b can be 0 or 2 or 4 or 6 (4 ways)
c can be 0 or 2 (2 ways)

Required number of factors

=342=24

134. There are 6 boxes numbered 1,2,...,6. Each box needs to be filled up either with a red or a blue ball in such
a way that at least 1 box contains a blue ball and the boxes containing blue balls are consecutively numbered.
The total number of ways in which this can be done is
A. 24
B. 23
C. 21
D. 18
Hide Answer
| Discuss
Notebook
answer with explanation

Answer: Option C

Explanation:

Case 1: Exactly one box contains a blue ball

One blue ball can be placed into any of the 6 boxes. i.e, 6 ways of doing this.

Red balls can be filled in the remaining boxes. Since red balls are identical, there is only 1 way of doing this.

Total number of ways =61=6

Case 2: Exactly two boxes contain blue balls

Two blue balls can be placed into (box 1 and box 2) or (box 2 and box 3) or (box 3 and box 4) or (box 4 and box
5) or (box 5 and box 6). i.e, 5 ways of doing this.

Red balls can be filled in the remaining boxes. Since red balls are identical, there is only 1 way of doing this.

Total number of ways =51=5

Case 3: Exactly three boxes contain blue balls

Three blue balls can be placed into (box 1 , box 2 and box 3) or (box 2, box 3 and box 4) or (box 3 , box 4 and
box 5) or (box 4, box 5 and box 6). i.e, 4 ways of doing this.

Red balls can be filled in the remaining boxes. Since red balls are identical, there is only 1 way of doing this.

Total number of ways =41=4

Case 4: Exactly four boxes contain blue balls

Four blue balls can be placed into (box 1 , box 2, box 3 and box 4) or (box 2, box 3, box 4 and box 5) or (box 3 ,
box 4, box 5 and box 6). i.e, 3 ways of doing this.

Red balls can be filled in the remaining boxes. Since red balls are identical, there is only 1 way of doing this.

Total number of ways =31=3

Case 5: Exactly five boxes contain blue balls

Five blue balls can be placed into (box 1, box 2, box 3, box 4 and box 5) or (box 2, box 3, box 4, box 5 and box
6). i.e, 2 ways of doing this.

Red balls can be filled in the remaining boxes. Since red balls are identical, there is only 1 way of doing this.

Total number of ways =21=2

Case 6: All the six boxes contain blue balls

Six blue balls can be placed into (box 1 , box 2, box 3, box 4, box 5 and box 6). i.e, only 1 way of doing this.

Total number of ways = 1

Hence, required number of ways

=6+5+4+3+2+1=21