5/11/25, 2:35 PM TestLo

MLS DAV PUBLIC SCHOOL

Kultajpur Road Narnaul

Worksheet Name: Module Standard: 11th Science Subject: Mathematics

Q1. In how many ways can the letters of the word PERMUTATIONS be arranged if the:
1. words start with P and end with S
2. vowels are all together
3. There are always 4 letters between P and S?
Ans:Total numbers in the word PERMUTATIONS = 12 and here T = 2
1. First letter is P and last letter is S which are fixed.
Therefore,remaining 10 letters are to be arranged between P and S.
∴ Number of permutations =
10! 10×9×8×7×6×5×4×3×2!
= = 1814400
2! 2!

2. There are 5 vowels in the word PERMUTATION. All vowels can to put together.
∴ Number of permutations of all vowels together =
5 5! 5×4×3×2×1
P = = = 120 5
0! 1

Now consider the 5 vowels together as one letter.

So the number of letters in the word when all vowels are together = 8
∴ Number of permutations =
8! 8×7×6×5×4×3×2!
= = 20160
2! 2!
st
3. P and S are on 1 and 6th places P and S are on 2nd and 7th places.
P and S are on 3rd and 8th places P and S are on 4th and 9th places.
P and S are on 5th and 10th places P and S are on 6nd and 11th places.
P and S are on 7th and 12th places.
Now, P and S can be put in 7 ways and also P and S can interchange their positions.
∴ Number of permutations = 2 × 7 = 14

Now the remaining 10 places can be filled with remaining 10 letters.

∴ Number of permutations =
10! 10×9×8×7×6×5×4×3×2!
= = 1814400
2! 2!

Therefore, total number of permutations = 14 × 1814400 = 25401600.

ANUJ SIR
Q2. How many words, with or without meaning can be formed using all the letters of the word MONDAY, assuming that no letter
is repeated if:
1. 4 letters are used at a time
2. all letters are used at a time
3. all letters are used by first letter is a vowel?
Ans:Total number of letters in word MONDAY = 6 and number of vowels = 2
1. Number of letters used = 4
∴ Number of permutations =
6 6! 6×5×4×3×2!
P = = = 360 2
2! 2!

2. Number of letters used = 6

∴ Number of permutations =
6 6! 6×5×4×3×2×1
P = = = 720 6
0! 1

3. First letter is vowel.

∴ Number of permutations of vowels =
2 2! 2×1
P = = = 2 1
1! 1

Now, remaining five places can be filled with remaining five letters.
∴ Number of permutations =
5 5! 5×4×3×2×1
P = = = 120
5
0! 1

Therefore, total number of permutations = 2 × 120 = 240.

Q3. If the letters of the word 'MOTHER' are written in all possible orders and these words are written out as in a dictionary, find
the rank of the word 'MOTHER'.
Ans:In the dictionary the words at each stage are arranged in alphabetical order. In the given problem we must therefore
consider the words beginning with E, H, M, 0, R, T in order. E will occur in the first place as often as there are ways of
arranging the remaining 5 letters,
∴ Number of words starting with E = 5! = 5 × 4 × 3 × 2 × 1 = 120

Number of words starting with H = 5! = 120.

Number of words beginning with M is 5!, but one of these words is the word MOTHER.
So, we first find the number of words beginning with ME and MH.
Number of words starting with ME = 4! = 4 × 3 × 2 × 1 = 24.
Now, the words beginning with 'MO' must follow.
There are 4! words beginning with MO, one of these words is the word MOTHER itself.

https://portal.testlo.io/#/exam/pdf-preview/9a5635f5-b95d-42a5-b29e-08d21c2cc97d/1 1/11
5/11/25, 2:35 PM TestLo

So, we first find the number of words beginning with MOE, MOH and MOR.
Number of words starting with MOE = 3! = 6
Number of words starting with MOH = 3! = 6
Number of words starting with MOR = 3! = 6
Number of words beginning with MOT is 3! but one of these words is the word MOTHER itself
So, we first find the number of words beginning with MOTE.
Number of words starting with MOTE = 2! = 2
Now, the words beginning with MOTH must follow.
There are 2! words beginning with MOTH, one of these words is word MOTHER itself.
The first word beginning with MOTH is the word MOTHER.
∴ Rank of MOTHER = 2 × 120 + 2 × 24 + 3 × 6 + 2 + 1

= 240 + 48 + 18 + 3
= 309
Q4. A candidate is required to answer 7 questions out of 12 questions which are divided into two groups, each containing 6
questions. He is not permitted to attempt more than 5 questions from either group. In how many ways can he choose the 7
questions?
Ans:Total number of quation = 12
Total number of quatin to be answered = 7
Each group has 6 quation more than 5 quation from either grou is not permitted, the number of ways a student can
choose quation,
6 6 6 6 6 6 6 6
C2 × C5 + C4 × C4 + C4 × C3 + C5 × C2

6 6 6 6
= 2( C2 × C5 + C3 × C4 )

6! 6! 6! 6!
= 2( × + × )
2!4! 5!1! 3!3! 4!2!

2×6×5×6 20
= (1 + )
2 6

= 30 × 26 = 780

Q5. Given 5 flags of different colours, how many different signals can be generated if each signal requires the use of 2 flags, one
below the other?
Ans:Each signal requires the use of 2 flags.

ANUJ SIR
There will be as many flags as there are ways of filling in 2 vacant places in succession by the given 5 flags of different
colors.
The upper vacant place can be filled in 5 different ways by any one of the 5 flags following which, the lower vacant place
can be filled in 4 different ways by any one of the remaining 4 different flags.
Thus, by multiplication principle, the number of different signals that can be generated is,
5 × 4 = 20.
Q6. How many 5-digit telephone numbers can be constructed using the digits 0 to 9 if each number starts with 67 and no digit
appears more than once?
Ans:It is given that the 5-digit telephone numbers always start with 67.
Therefore, there will be as many phone numbers as there are ways of filling 3 vacant Places,
6, 7, _, _, _
The three vacant places above will be filled by the digits 0 – 9, keeping in mind that the digits cannot be repeated.
The units place can be filled by any of the digits from 0 – 9, except digits 6 and 7.
Therefore, the units place can be filled in 8 different ways following which, the tens place can be filled in by any of the
remaining 7 digits in 7 different ways, and the hundreds place can be filled in by any of the remaining 6 digits in 6
different ways.
Therefore, by multiplication principle, the required number of ways in which 5-digit telephone numbers can be
constructed is,
8 × 7 × 6 = 336
We will learn in later part of chapter on how to solve these problem with the help of permutation formula,
8
P3 = 8!/(8 − 3)! = 336

Q7. Find the number of arrangements of the letters of the word INDEPENDENCE. In how many of these arrangements,
1. do the words start with P
2. do all the vowels always occur together
3. do the vowels never occur together
4. do the words begin with I and end in P?
Ans:There are 12 letters, of which N appears 3 times, E appears 4 times and D appears 2 times and the rest are all different.
Therefore
https://portal.testlo.io/#/exam/pdf-preview/9a5635f5-b95d-42a5-b29e-08d21c2cc97d/1 2/11
5/11/25, 2:35 PM TestLo

The required number of arrangements = 1663200

12!

3!4!2!

1. Let us fix P at the extreme left position, we, then, count the arrangements of the remaining 11 letters. Therefore, the
required number of words starting with P
11!
= = 138600.
3!2!4!

2. There are 5 vowels in the given word, which are 4 Es and 1 I. Since, they have to always occur together, we treat them
as a single object

for the time being. This single object together with 7 remaining objects will account for 8 objects. These 8 objects, in
which there are 3Ns and 2 Ds, can be rearranged in
= ways. Corresponding to each of these arrangements, the 5 vowels E, E, E,
8!

3!2!

E and I can be rearranged in 5!

4!
ways. Therefore, by multiplication principle, the required number of arrangements
8! 5!
× = 16800
3!2! 4!

3. The required number of arrangements

= the total number of arrangements (without any restriction) – the number of arrangements where all the vowels occur
together.
= 1663200 – 16800 = 1646400
4. Let us fix I and P at the extreme ends (I at the left end and P at the right end). We are left with 10 letters.
Hence, the required number of arrangements
10!
= 12600
3!2!4!

Q8. A group consists of 4 girls and 7 boys. In how many ways can a team of 5 members be selected if the team has
1. no girl ?
2. at least one boy and one girl ?
3. at least 3 girls ?
Ans:1. Since, the team will not include any girl, therefore, only boys are to be selected. 5 boys out of 7 boys can be selected in
7
C5 ways. Therefore, the required
number of ways =7C5 = = 21
7!

5!2!
6×7

2. Since, at least one boy and one girl are to be there in every team. Therefore, the team can consist of
1 boy and 4 girls
2 boys and 3 girls
3 boys and 2 girls
ANUJ SIR
4 boys and 1 girl.
1 boy and 4 girls can be selected in 7C1 × 4C4 ways.
2 boys and 3 girls can be selected in 7C2 × 4C3 ways.
3 boys and 2 girls can be selected in 7C3 × 4C2 ways.
4 boys and 1 girl can be selected in 7C4 × 4C1 ways.
Therefore, the required number of ways
= 7C1 × 4C4 + 7C2 × 4C3 + 7C3 × 4C2 + 7C4 × 4C1
= 7 + 84 + 210 + 140 = 441
Since, the team has to consist of at least 3 girls, the team can consist of
3 girls and 2 boys, or
4 girls and 1 boy.
Note that the team cannot have all 5 girls, because, the group has only 4 girls.
3 girls and 2 boys can be selected in 4C3 × 7C2 ways.
4 girls and 1 boy can be selected in 4C4 × 7C1 ways.
Therefore, the required number of ways
= 4C3 × 7C2 + 4C4 × 7C1 = 84 + 7 = 91
Q9. Let r and n be positive integers such that 1 < r < n. Then prove the following:
n n n n+2
Cr + 2 Cr−1 + Cr−2 = Cr

Ans:We have,
n n n
L.H.S. = Cr + 2 Cr−1 + Cr−2
n n n n
= ( Cr + Cr−1 ) + ( Cr−2 + Cr−1 )
n+1 n+1
= Cr + Cr−1
1
= (n + 1) + Cr
n+2
= Cr

https://portal.testlo.io/#/exam/pdf-preview/9a5635f5-b95d-42a5-b29e-08d21c2cc97d/1 3/11
5/11/25, 2:35 PM TestLo

Q10.A committee of 7 has to be formed from 9 boys and 4 girls. In how many ways can this be done when the committee consists
of:
1. exactly 3 girls?
2. atleast 3 girls?
3. atmost 3 girls?
Ans:A committee of 7 has to be formed from 9 boys and 4 girls.
1. Since exactly 3 girls are to be there in every committee, each committee must consist of (7 – 3) = 4 boys only.
Thus, in this case, required number of ways = C × C = ×
4
3
9
4
4!

3!1! 4!5!
9!

9×8×7×6×5!
= 4 ×
4×3×2×1×5!

= 504

2. Since at least 3 girls are to be there in every committee, the committee can consist of
(a) 3 girls and 4 boys or (b) 4 girls and 3 boys
3 girls and 4 boys can be selected in 4C3 × 9C4 ways.
4 girls and 3 boys can be selected in 4C4 × 9C3 ways.
Therefore, in this case, required number of ways = 4C3 × 9C4 + 4C4 × 9C3
= 504 + 84 = 588
3. Since at most 3 girls are to be there in every committee, the committee can consist of
1. 3 girls and 4 boys
2. 2 girls and 5 boys
3. 1 girl and 6 boys
4. No girl and 7 boys
3 girls and 4 boys can be selected in 4C3 × 9C4 ways.
2 girls and 5 boys can be selected in 4C2 × 9C5 ways.
1 girl and 6 boys can be selected in 4C1 × 9C6 ways.
No girl and 7 boys can be selected in 4C0 × 9C7 ways.
Therefore, in this case, required number of ways
4 9 4 9 4 9 4 9
= C3 × C4 + C2 × C5 + C1 × C6 + C0 × C7
4! 9! 4! 9! 4! 9! 4! 9!
= × + × + × + ×
3!1! 4!5! 2!2! 5!4! 1!3! 6!3! 0!4! 7!2!

= 504 + 756 + 336 + 36

ANUJ SIR
= 1632

Q11.Out of 18 points in a plane, no three are in the same straight line except five points which are collinear. How many:
1. Straight lines.
2. Triangles can be formed by joining them?
Ans:There are 8 points in a plane out of which 5 points are collinear.
Then number of strianght lines joining these points are,
n p
⇒ C2 − ( C2 − 1)
n p
⇒ C2 − C2 + 1
18 5
⇒ C2 − C2 + 1
18×17 5×4
⇒ − + 1
2 2

⇒ 144

Number of triangle = 13
C3
13! 13×12×11
= =
3!10! 3×2

= 13 × 2 × 11

= 13 × 22

= 806

Q12.How many permutations of the letters of the word 'MADHUBANI' do not begin with M but end with I?
Ans:MADHUBANI
Total number of words that ends with letter I = 8!

2!

= 8 × 7 × 6 × 5 × 4 × 3

= 50 × 30 × 12

= 20160

If the words starts with Mand end with I, there are 7 space left for 7 letters.
Number of words that starts with M and end with I = 7!

2!

= 7 × 5 × 4 × 3

= 42 × 60

= 2520

https://portal.testlo.io/#/exam/pdf-preview/9a5635f5-b95d-42a5-b29e-08d21c2cc97d/1 4/11
5/11/25, 2:35 PM TestLo

Number of words which do not start with M but end with I

= 20160 − 2520

= 17640

Required number of words = 17640

Q13.If C = C , find C .
16
r
16
r+2
7
4

Ans:We have,
If C = Cn
r
n
p

then r + p = n
16 = r + r + 2
r=7
then C = C n
4
7
4

7!
⇒
4!(7−4)!

7×5×6
⇒
3×2

⇒ 35

Q14.If P(11, r) = P(12, r − 1) find r.

Ans:We have,
P(11, r) = P(12, r − 1).
11! 12! n n!
⇒ = [ ∵ pr = ]
(11−r)! [12−(r−1)]! (n−r)!

11! 12×11!
⇒ =
(11−r)! [12−r+1]!

1 12
⇒ =
(11−r)! [13−r]!

1 12
⇒ =
(11−r)! [13−r]!

1 12
⇒ =
(11−r)! (13−r)×(13−r−1)(13−r−2)!

1 12
⇒ =
(11−r)! (13−r)×(12−r)(11−r)!

(13−r)(12−r)(11−r)
⇒ = 12
(11−r)

⇒ (13 − r)(12 − r) = 12
2
⇒ 156 − 13r − 12r + r = 12

ANUJ SIR
2
⇒ r − 25r + 156 − 12 = 0
2
⇒ r − 25r + 144 = 0
2
⇒ r − 16r − 9r + 144 = 0

⇒ r( r − 16) − 9 (r − 16) = 0

⇒ (r − 9 )( r − 16) = 0

∵ r ≤ 11
⇒ r − 9 = 0[ ]
∴ ≠ 16

⇒ r = 9

Q15.How many words can be formed with the letters of the word 'UNIVERSITY', the vowels remaining together?
Ans:In the word 'UNIVERSITY' there are 10 letters of which 2 are I's. There are 4 vowels in the given word of which 2 are I's.
These vowels can be put together in ways. 4!

2!

Considering these 4 vowels as one letter there are 7 letters which can be arranged in 7! ways. Hence, by fundamental
principle of multiplication, the required number of arrangements is
4!
= × 7!
2!
4×3×2!
= × 7 × 6 × 5 × 4 × 3 × 2
2!

= 4 × 3 × 7 × 6 × 5 × 4 × 3 × 2 \
= 60480

Q16.In how many ways can a football team of 11 players be selected from 16 players? How many of these will.
1. Include 2 particular players?
2. Exclude 2 particular players?
Ans:We have,
No of players = 16
No of players to be selected = 11
No of combination = C 16
11
16!
=
11!5!
16×15×14×13×12
= = 4368
5×4×3×2

1. Include 2 particular players:

https://portal.testlo.io/#/exam/pdf-preview/9a5635f5-b95d-42a5-b29e-08d21c2cc97d/1 5/11
5/11/25, 2:35 PM TestLo

Now we have to select 9 more out of remaining 14

Required number of ways = C 14
9
14!
=
9!5!
14×13×12×11×10
= = 2002
5×4×3×2

2. Exclude 2 particular players:

Now we have to select 11 players more out of remaining 14 players = 14
C11
14!
=
11!3!
14×13×12
= = 364
3×2

Q17.Evaluate the following:

5
5
∑ Cr
r=1

Ans:We have,
5 5 5 5 5
= C1 + C2 + C3 + C4 + C5
5! 5! 5! 5! 5!
= + + + +
1!4! 2!3! 3!2! 4!1! 5!0!
5×4 5×4
= 5 + + + 5 + 1
2 2

= 5 + 10 + 10 + 5 + 1

= 31

Q18.In a village, there are 87 families of which 52 families have at most 2 children. In a rural development programme, 20 families
are to be helped chosen for assistance of which at least 18 families must have at most 2 children. In how many ways can the
choice be made?
Ans:We have,
52 families have at most 2 childern, while 35 families have 2 children.
The selection of 20 families of which at least 18 families must have 2 children can be made as under.
1. 18 families out of 52 and 2 families out of 35.
2. 19 families out of 52 and 1 families out of 35.
3. 20 families out of 52.
Therefore the number of ways are = C × C + C × C + C + C + C 52
35
35
2
52
19
35
19
35
1
52
20
35
0

Q19.If 24Cx = 24C2x+3, Find x.

ANUJ SIR
Ans:We have,
If nCp = nCq = n
Then p + q = n
Also,
x + 2x + 3 = 24
3x = 21
x=7
Q20.If P(n, 5) : P(n, 3) = 2 : 1, find n.
Ans:We have,
P(n, 5) : P(n, 3) = 2 : 1
p(n,5)
2
⇒ =
p(n,3) 1

(n)!

((n-5)!) 2
⇒ n!
=
1
(n-3)!

n!×(n-3)!
⇒ = 2
(n-5)!×n!

(n-3)!
⇒ = 2
(n-5)!

(n−3)(n−4)(n−5)!
⇒ = 2
(n−5)!

⇒ (n − 3)(n − 4) = 2
2
⇒ n − 4n − 3n + 12 = 2
2
⇒ n + 7n + 12 = 2
2
⇒ n + 7n + 12 − 2 = 0
2
⇒ n + 7n + 10 = 0
2
⇒ n − 5n − 2n + 10 = 0

⇒ n(n − 5) − 2(n − 5) = 0

⇒ (n − 5)(n − 2) = 0

∵ r ≥ 5
⇒ n = 5 [ ]
∴ ≠ 2

https://portal.testlo.io/#/exam/pdf-preview/9a5635f5-b95d-42a5-b29e-08d21c2cc97d/1 6/11
5/11/25, 2:35 PM TestLo

Hence, n = 5
Q21.If α = C , then find the value of
m
2
α
C2 .

Ans:We have,
m(m−1)
m
α = C2 =
2
α(α−1)
α
C2 =
2
m(m−1) m(m−1)
( )( −1)
2 2

=
2
2
m(m−1)(m −m−2)
=
2×2×2
m(m−1)(m+1)(m−2)
=
8
m(m−1)(m+1)(m−2)
=
4×2

Multiplying with 3, numerator and denominator to make 4.

m(m+1)m(m−1)(m−2)
=
4.3.2.1
3(m+1)m(m−1)(m−2)
=
4!
m+1
= 3. C4

Q22.Find the number of words formed by permuting all the letters of the following words:
RUSSIA.
Ans:There are 6 letters in the word 'RUSSIA' out of which 2 are S's, and the rest are all distinct.
So, the total number of words
6!
=
2!
6×5×4×3×2!
=
2!

= 6 × 5 × 4 × 3

= 360

Q23.From 4 officers and 8 jawans in how many ways can 6 be chosen:

1. To include exactly one officer.
2. To include at least one officer?
Ans:Total number of officer = 4
Total number of jawans = 8

ANUJ SIR
Total number of selection to be made = 6
1. To include exactly one officer.
This can be done is C × C 4
1
8
5

4! 8!
= ×
1!3! 5!3!
4×8×7×6
= = 224
3×2

2. To include at least one officer

This can be done is
4 8 4 8 4 8 4 8
C1 × C5 + C2 × C4 + C1 × C3 + C4 × C2
4×8! 4! 8! 4! 8! 1×8!
= + + + × +
5!3! 2!2! 4!4! 3!1! 3!5! 2!6!
4×8×7×6 4×3×8×7×6×5 4×8×7×6 8×7
= ( ) + ( ) + ( ) + ( )
3×2 2×4×3×2 3×2 2×1

= (4 × 8 × 7) + (4 × 3 × 7 × 5) + (4 × 8 × 7) + (4 × 7)

= 224 + 420 + 224 + 28

= 896

Q24.How many permutations can be formed by the letters of the word, 'VOWELS', when.
1. There is no restriction on letters?
2. Each word begins with E?
3. Each word begins with O and ends with L?
4. All vowels come together?
5. All consonants come together?
Ans:1. There are 6 letters in the word 'VOWELS'. The total number of words formed with these 6 letters is the number of
arrangements of 6 items, taken all at a time, which is equal to 6P6 = 6! = 6 × 5 × 4 × 3 × 2 × 1 = 720
2. If we fix up E in the begining then the remaining 5 letters can be arranged in 5P5 = 5! = 5 × 4 × 3 × 2 × 1 = 120 ways
3. If we fix up O in the begining and Lat the end, the remaining 4 letters can be arranged in 4P4 = 4! = 4 × 3 × 2 × 1 = 24.
4. There are 2 vowels and 4 consonants in the word 'VOWELS'.
Considering 2 vowels as one letter, we have letters which can be arranged in 5p5 = 5! ways. O, E can be put together in 2!
ways.
Hence, required number of words = 5! x 2!

https://portal.testlo.io/#/exam/pdf-preview/9a5635f5-b95d-42a5-b29e-08d21c2cc97d/1 7/11
5/11/25, 2:35 PM TestLo

=5×4×3×2×1×2×1
= 120 × 2
= 240
5. There are 2 vowels and 4 consonants in the word 'VOWELS'.
​Considering 4 consonants as one letter, we have 3 letters which can be arranged in 3P3 = 3! ways.
U, W, L, Scan be put together in 4! ways.
Hence, required number of words in which all consonants come together = 3! x 4!
=3×2×4×3×2
= 144.
Q25.In how many ways can one select a circket team of eleven from17 players in which only 5 persons
can bowl if each cricket team of 11 must include exactly 4 bowlers?
Ans:We have,
There are total 5 bowlwrs and 12 batsm are avilable to select from.
Number of ways to select a team and 11 that includes exactly 4 bowlers.
= (7 batsm out of 12 bastsman) and (4 bowlers out of 5 bowlers)
12 5
= C7 × C4
12×11×10×9×8
⇒ × 5
5×4×3×2×1

⇒ 3960

Q26.A group consists of 4 girls and 7 boys. In how many ways can a team of 5 members be selected if the team has:
1. No girl?
2. At least one boy and one girl?
3. At least 3 girls?
Ans:1. Since, the team does not indude any girl therefore, only boys are to be selected.
5 boys out of 7 boys can be selected in ways.
7 7!
⇒ C5 =
5!2!
6×7
= = 21
2

2. Since, the least ne boy and girls are to be there in every team. The team consist of:
1. 1 boy and 4 girls C × C 7
1
4
4

2. 2 boy and 3 girls C × C 7

2
4
3

ANUJ SIR
3. 3 boy and 2 girls C × C 7
3
4
2

4. 4 boy and 1 girls C × C 7

4
4
1

The required number of ways,

7 4 7 4 7 4 7 4
= C1 × C4 + C2 × C3 + C3 × C2 + C4 × C1

= 7 + 84 + 210 + 140

= 441

3. Since, the tearm has to consist of at least 3 girls, the tearm can consist of,
1. 3 girls and 2 boys C × C 7
2
4
3

2. 4 girls and 1 boys C × C 4

4
7
1

The required number of ways,

4 7 4 7
= C3 × C2 + C4 × C1

= 84 + 7

= 91

Q27.In an examination, a question paper consists of 12 questions divided into two parts i.e. Part I and Part II, containing 5 and 7
questions, respectively. A student is required to attempt 8 questions in all, selecting at least 3 from each part. In how many
ways can a student select the questions?
Ans:Here, part I has quations and part 11 has 7 quations.
Student has to attempt 8 quations selecting at least 3 from each section.
So, Number of ways to select at least 3 from each section and a total 8 quations.
= (3 from part I an 5 from part II) or (4 from part I from part II) or (5 from part I and 3 from part II)
5 7 5 7 5 7
= ( C3 × C5 ) + ( C4 × C5 ) + ( C3 × C3 )

5×4 7×6 7×6×5 5×6×5

= ( × ) + (5 × ) + (1 × 7 )
2×1 2×1 3×2 3×2

= 210 + 170 + 30

= 420

Q28.A convex polygon has 44 diagonals. Find the number of its sides.
[Hint: Polygon of n sides has (nC2 – n) number of diagonals.]
Ans:Let n be number of sides ploygon.
https://portal.testlo.io/#/exam/pdf-preview/9a5635f5-b95d-42a5-b29e-08d21c2cc97d/1 8/11
5/11/25, 2:35 PM TestLo

since, polygon of n sides has (nC2 - n) number of diagonals

n n!
∴ C2 − n = 44 = − n = 44
2!(n−2)!

n(n-1)(n-2)!
= − n = 44
2.(n−2)!

n(n−1)
⇒ − n = 44
2
2
n −n−2n
= = 44
2

2
⇒ n − 3n = 88
2
⇒ n − 3n − 88 = 0
2
= n − 11n + 8n − 88 = 0

⇒ n(n − 11) = 0

= (n − 11)(n + 8) = 0

∴ n = 11and n = −8[∵ n ≠ 8] so n = 11
Hence, the required number of sides = 11
Q29.How many four-digit numbers can be formed with the digits 3, 5, 7, 8, 9 which are greater than 7000, if repetition of digits is
not allowed?
Ans:The required numbers are greater than 7000.
∴ the thousand's place can be filled with any of the 3 digits 7,8,9.

so, there are 3 ways of filling the thousand's place.

Since repetition of digits is not allowed, so the hundred's, ten's and one's places can be filled in 4 ,3, and 2 ways
respectively.
Hence, the required number of numbers = 3 × 4 × 3 × 2 = 72
Q30.How many words can be formed with the letters of the word 'PARALLEL' so that all L's do not come together?
Ans:There are 8 letters in the word 'PARALLEL' out of which A's and 3 are L's and the rest are all distinct.
So, total number of words
8!
=
3! 2!
8×7×6×5×4×3!
=
2×1×3!

= 8 × 7 × 6 × 5 × 2

= 3360.

Considering all L's together and treating them as one letter we have 6 letters out of which A repeats 2 times and others are

ANUJ SIR
distinct. These 6 letters can be arranged in ways. 6!

2!

So, the number of words in which all L's come together = 6!

2!
6×5×4×3×2!
=
2!

= 6 × 5 × 4 × 3 × 2

= 360

Hence, the number of words in which all L's do not come together
= 3360 - 360
= 3000
Q31.Find r if:
5 6
Pr = Pr−1

Ans:Given: 5
Pr = 2 Pr−1
6

5! 6!
∴ =
(5−r)! (7−r)!

5! 6×5!
⇒ =
(5−r)! (7−r)(6−r)(5−r)!

6
⇒ 1 =
(7−r)(6−r)

2
⇒ r − 13r + 42 = 0

⇒ (r − 9)(r − 4) = 0

or r = 4
⇒ r = 9

r = 9 is not possible because r > n, therefore, r = 4

Q32.If C : C , = 11 : 5, Find r.
15
r
15
r-1

Ans:We have,
15
Cr 11
15
=
Cr−1 5

15−r+1 11
⇒ =
r 5

⇒ 75 − 5r + 5 = 11r

⇒ 16r = 80

⇒ r = 5

https://portal.testlo.io/#/exam/pdf-preview/9a5635f5-b95d-42a5-b29e-08d21c2cc97d/1 9/11
5/11/25, 2:35 PM TestLo

Q33.In a certain city, all telephone numbers have six digits, the first two digits always being 41 or 42 or 46 or 62 or 64. How many
telephone numbers have all six digits distinct?
Ans:If first two digits is 41, then the remaining 4 digits can be arranged in 8P4 ways
8! 8×7×6×5×4!
= = = 1680
(8−4) 4!

Similarly firth two digits can be 42 or 46 or 62 or 64

∴ Total number of telephone number have all digits distinct = 5 × 1680 = 8400

Hence, the required telephone numbers = 8400

Q34.If nCr – 1 = 36, nCr = 84 and nCr + 1 = 126, then find rC2 .
n n

[Hint: Form equation using and to find the value of r.]

Cr Cr

n n
Cr+1 Cr−1

Ans: We know that n

Cr

Cr
=
n−r+1

∴
n−r+1

r
=
84

36
(given)
n−r+1 7
⇒ =
r 3

⇒ 3n − 3r + 3 = 7r

⇒ 10r − 3n = 3 . . . . (i)
n
Cr+1 n−(r+1)+1 126
n
= =
Cr r+1 84
n−r 3
∴ =
r+1 2

⇒ 2n − 2r = 3r + 3

⇒ 2n − 5r = 3 . . . . (ii)

Solving (i) and (ii), we get n = 9 and r = 3.

r 3
∴ 22 = C2 = 3

Q35.From a committee of 8 persons, in how many ways can we choose a chairman and a vice chairman assuming one person
cannot hold more than one position?
Ans:Total number of persons = 8 and Number of persons used without repetition = 2
∴ Number of permutations =
8 8! 8×7×6!
p = = = 56 2
6! 6!

Q36.In how many ways can a student choose 5 courses out of 9 courses if 2 courses are compulsory for every student?
Ans:We have,
Out of 9 courses 2 are compulsory. So student can choose from 7 courses only. Also out of 5 courses that student need to

ANUJ SIR
choose, 2 are compulsory.
So they have to choose 3 courses out of 7 courses. This can be done 7C3.
= 35 ways.
Q37.How many words can be formed out of the letters of the word 'ARTICLE', so that vowels occupy even places?
Ans:We have to arrange 7 letters in a row such that vowels occupy even places. There are 3 even places (2, 4, 6). Three vowels
can be arranged in these 3 even places in 3! ways. Remaining 4 odd places (1, 3, 5, 7) are to be occupied by the 4
consonants. This can be done in 4! ways.
Hence, the total number of words in which vowels occupy even places = 3! × 4!
= 3 × 2 × 4 × 3 × 2 = 144
Q38.The English alphabet has 5 vowels and 21 consonants. How many words with two different vowels and 2 different consonants
can be formed from the alphabets?
Ans:2 vowels out of 5 vowels and 2 consonants out of 21 consonants have to be selected and these 4 letters in 4 ways.
∴ Required number of words =
5 21
C × C × 4! 2 2
5! 21!
= × × 4!
2!3! 2!19!
5×4×3! 21×20×19!
= × × 4 × 3 × 2 × 1
2×1×3! 2×1×19!

= 10 × 210 × 24 = 50400

Q39.Find the number of ways of selecting 9 balls from 6 red balls, 5 white balls and 5 blue balls if each selection consists of 3 balls
of each colour.
Ans:There are 6 red balls, 5 white balls and 5 blue balls. 3 balls of each colour have to be found.
∴ Number of ways of selection =
6 5 5
C × C × C 3 3 3
6! 5! 5!
= × ×
3!3! 3!2! 3!2!

= 20 × 10 × 10 = 2000

Q40.From Goa to Bombay there are two roots; air, and sea. From Bombay to Delhi there are three routes; air, rail and road. From
Goa to Delhi via Bombay, how many kinds of routes are there?
Ans:From Goa to Bombay there are two roots; air and sea.
From Bombay to Delhi there are three routs; air rail and raod.

https://portal.testlo.io/#/exam/pdf-preview/9a5635f5-b95d-42a5-b29e-08d21c2cc97d/1 10/11
5/11/25, 2:35 PM TestLo

Therefore by the fundamental pricipal of multiplication, the requied number fo ways are 2 × 3 = 6
Hence, total number of different kinds routes are 6.

ANUJ SIR

https://portal.testlo.io/#/exam/pdf-preview/9a5635f5-b95d-42a5-b29e-08d21c2cc97d/1 11/11