Solution

P&C

Class 11 - Mathematics

1.
(b) 720
Explanation:
Thousands place can be filled by any of the 6 nonzero digits.
So, there are 6 ways to fill this place.
Hundreds place can be filled by any of the remaining 6 digits.
So, there are 6 ways to fill this place.
Tens place can be filled by any of the remaining 5 digits.
So, there are 5 ways to fill this place.
Units place can be filled by any of the remaining 4 digits.
So, there are 4 ways to fill this place.
Required number of numbers = (6 × 6 × 5 × 4) = 720

2.
(b) 36000
Explanation:
Total number of words formed by using all the 8 letters at a time = 8P8 = 8! = 40320.
Number of words in which vowels are never together
= (total number of words) - (no. of words in which vowels are always together)
= (40320 - 4320) = 36000

3.
(d) 210
Explanation:
7p 7!
7×6×5×(4!)
= 210.
3= (7−3)!
=
4!

4. (a) 66
Explanation:
Number of handshakes = 12C2 = 12×11

2
= 66.

5. (a) 64
Explanation:
Number of straight lines joining 12 points if we take 2 points at a time = 12
C2

= = 66
12!

2!10!

Number of straight lines joining 3 points if we take 2 points at a time = 3

C2 =3
But, 3 collinear points, when joined in pairs, give only one line.
∴ Required number of straight lines = 66 - 3 + 1 = 64.

6.
(b) 20
Explanation:
Here, it is given
nC = nC8 [∵ nCr = nCn-r]
12
nC = nCn-8
12
∴ n - 8 = 12
⇒ n = 12 + 8 = 20

1/6
 7. (a) 6 !
Explanation:
6 boys can be arranged in a row in 6 ! ways.
8.
(c) 7560
Explanation:
There are 9 letters in all. Out of these A is repeated 4 times, L is repeated 2 times and the rest are different.
9!
Required number of words = (4!)⋅(2!)
= 7560.

9.
(c) r!
Explanation:
The product of r consecutive integer can be represented as
(n+r)!
(n + r)(n + r - 1) ... (n + 1) =
n!

where n is the number less than the smallest of the consecutive integers.
Now, if it is true that prime in (n + r)! appear just as frequently or more as in
n!r!, then now for same integer k that (n + r)! = k ⋅ n! r!
(n+r)! k⋅n!r!
= = k ⋅ r!
n! n!

and is therefore divisible by r!

10.
(d) 12
Explanation:
r - 6 + 3r + 1 = 43 [∵ n
Cx =
n
Cy ⇒ n = x + y or x = y]
⇒ 4r - 5 = 43

⇒ 4r = 48

⇒ r = 12.

11.
(c) 25200
Explanation:
Number of ways of selecting 3 consonants out of 7 and 2 vowels out of 4
7
= ( C3 ×
4
C2 ) = (
7×6×5

3×2×1
×
4×3

2×1
) = 210.
Now, 5 letters can be arranged among themselves in 5 ! ways = 120 ways.
Required number of words = (210 × 120) = 25200

12.
(b) 5
Explanation:
If you join every distinct pair of vertices you will get n
C2 lines.
These n
C2 lines account for the n sides of the polygon as well as for the diagonals.
n(n−1) n(n−3)
So the number of diagonals is given by n
C2 − n =
2
− n=
2

But given number of sides = number of diagonals =n

n(n−3)
⇒ n=
2

⇒ 2n = n(n − 3)

⇒ n− 3 = 2

⇒ n= 5

13.
(c) 7200

2/6
 Explanation:
Here, it is given that total numbers of vowels = 4
and total numbers of consonants = 5
Total number of words formed by 2 vowels and 3 consonants
4 5 4! 5! 4×3×2! 5×4×3!
= C2 × C3 = × = ×
2!2! 3!2! 2×1×2! 3!×2

= 6 × 10 = 60
Now permutation of 2 vowels and 3 consonants = 5!
= 5 × 4 × 3 × 2 × 1 = 120
Therefore,the total number of words = 60 × 120 = 7200

14.
(b) 210
Explanation:
You can either choose true or false, therefore for 10 questions you will have 210 possibilities.

15. (a) 24
Explanation:
Required number of ways = (4 × 3 × 2) = 24.
16.
(b) 5! × 4!
Explanation:
If there are n objects to be arranged in circular order the no. of permutations possible = (n - 1)!
First, we will make the 5 girls around the table and this can be done in (5 - 1)! = 4! = 24, different ways.
Now we have 5 places available between these girls and the 5 boys can be seated in these 5 available places in 5! = 120,
different ways.
Hence the 5 boys and 5 girls can be arranged in 4! 5! = 23⋅ 120 = 2880 ways.

17.
(c) 6
Explanation:
According to the question:
nP = 12 × nP2
4
⇒
n!
= 12 × n!

(n−4)! (n−2)!

(n−2)!
⇒ = 12
(n−4)!

⇒ (n - 2) (n - 3) = 4 × 3
⇒ n-2=4
⇒ n=6

18.
(b) 1

2
n(n − 3)

Explanation:
In a polygon of n sides, number of diagonals = 1

2
n(n − 3)

19.
(b) 31
Explanation:
5 5 5 5 5
C1 + C2 + C3 + C4 + C5

= C + C + C + C +
5
1
5
2
5
2
5
1
5
C5

=2× C +2× C + C 5
1
5
2
5
5

=2×5+2× + 1
5!

2!3!

3/6
 = 10 + 20 + 1
= 31.

20.
(b) 31
Explanation:
The candidate can fail by failing in 1 or 2 or 3 or 4 or 5 subjects out of 5 in each case.
∴ required number of ways = 5C1 + 5C2 + 5C3 + 5C4 + 5C5

= 5C1 + 5C2 + 5C(5-3) +5C(5-4) + 1

= 5C1 + 5C2 + 5C2 + 5C1 + 1

= 2(5C1 + 5C2) + 1

= 2 (5 + 5×4

2×1
) + 1 = (30 + 1) = 31.

21.
(d) 40
Explanation:
Number of line segments formed by joining pairs of points out of 10
10 10×9
= C2 = = 45
2
4
Number of line segments formed by joining pairs of 4 points = C2 =
4×3

2
= 6

But, these points being collinear give only one line

∴ Required number of line segments = (45 - 6 + 1) = 40

22.
(d) 120
Explanation:
If set S has n elements, then
C(n, k) is the number of ways of choosing k elements from S
Thus, the number of subsets of S of all possible values is given by
C(n, 0) + C(n, 1) + C(n, 3) + ....+ C(n, n) = 2n
Comparing the given equation with the above equation:
2n = 256
⇒ 2n = 28

⇒ n = 8
16
2n
∴ C2 = C2
16! 16×15
⇒
16
C2 = 2!14!
=
2
= 120.

23.
(c) 56
Explanation:
r + r + 4 = 20 [∵ n
Cx =
n
Cy ⇒ n = x + y or x = y]
⇒ 2r + 4 = 20

⇒ 2r = 16

⇒ r = 8

Now,
r 8
C3 = C3

8
C3 = 3!5!
8!
=
8×7×6

3×2×1
= 56

24. (a) 78
Explanation:

4/6
 4 out of 13 players are bowlers.
In other words, 9 players are not bowlers.
A team of 11 is to be selected so as to include at least 2 bowlers.
∴ Number of ways = 4
C2 ×
9 4
C9 +
9
C3 ×
4
C8 +
9
C4 × C7

= 6 + 36 + 36
= 78
25.
(c) 2m = n(n - 1)
Explanation:
m n
C1 = C2

⇒
m!
= n!

1!(m−1)! 2!(n−2)!

m(m−1)! n(n−1)(n−2)!
⇒ =
(m−1)! 2(n−2)!

⇒ 2m = n(n - 1).

26. (a) 720

Explanation:
We have to find the total number of four-digit odd numbers formed using the digits 0, 1, 2, 3, 5, 7.
Since it is an odd number the last place (unit's place) can be filled by any of the odd numbers 1, 3, 5, 7 in 4 different ways.
Since repetition is allowed the second and third places can be filled by any of the six given digits.
Since it has to be a four digit number the first place can be filled by any of the five given digits other than zero in 5 ways.
Hence all the four places can be filled in 4 × 6 × 6 × 5 = 720 ways.
27. (a) 420
Explanation:
He may select:
i. (3 out of 7 from A) and (5 out of 5 from B) or
ii. (4 out of 7 from A) and (4 out of 5 from B) or
iii. (5 out of 7 from A) and (3 out of 5 from B).
The number of ways of these selections are:
i. 7
C3 ×
5
C5 = (35 × 1) = 35
ii. 7
C4 ×
5
C4 = (35 × 5) = 175

iii. 7
C5 ×
5
C3 = (21 × 10) = 210.

∴ Required number of ways = (35 + 175 + 210) = 420.

28. (a) 24
Explanation:
nC = nC
p q
⇒ p+q=n
nC = nC14
∴ 10
⇒ n = (10 + 14) = 24
29.
(b) 9
Explanation:
We have 3600 = 24 32 52
To get the odd factors we will get rid of 2's
We will make the selection from only 3's and 5's
Number of ways 3 can be selected from a lot of two 3's = 3 ways (one 3, two 3's or three 3's)
Number of ways 5 can be selected from a lot of two 5's = 3 ways (one 5, two 5's or three 5's)
Therefore the number of odd factors is 3600 = 3 × 3 = 9

30.
(c) 630

5/6
Explanation:
36C = 36C(36 - 34) = 36C2 = 36×35
= 630.
34 2

6/6