Solution

PREODIC -2

Class 11 - Mathematics
Section A
100!
1. (b) 50!

Explanation: 2⋅ 6⋅ 10⋅ 14 ... upto 50 factors

= (2 ×  1) ( 2 ×  3) (2 ×  5) ... upto 50 factors

= 250 (1 ×  3 ×  5 ×  ... upto 50 factors)

50
2 (1×2×3×4×5×… ...upto 100 factors )
=  2×4×6×… ...upto 50 factors 

50

=  2 ×100!

(2×1)(2×2)(2×3)…(2×50)

50

=  2

50
×100!
=
100!

2 ×50! 50!

2. (a) 1800

Explanation: One subject gets 2 periods in a day that subject is selected in 5 ways.

The number of ways to arrange 6 periods with five subjects = 

6!

2!

⇒  The required number of ways

= 5 ×  = 5 × 6!

2!
 = 1800 720

3. (b) 11

Explanation: Required number of ways = 4C2 + 4C3 + 4C4 = 11

4. (d) 64

Explanation: The required number of ways to select

i. 1 black ball and 2 others = 3C1 ⋅  6C2

= 3 ×  15 = 45
ii. 2 black balls and 1 other = 3C2 ⋅  6C1

= 3 ×  6 = 18
iii. All the three balls are black = 3C3 = 1

Total number of ways = 45 + 18 + 1 = 64

5. (a) 20C5

Explanation: Distributing 15 identical objects among 6 people is similar to finding non negative integer solutions to x1 + x2 +

... + x6 = 15 and the number of non negative integer solutions is 15+6-1C6-1

⇒  The number of ways of distributing n identical objects among r persons is n+r-1Cr-1

⇒  Required number of ways = 15+6-1C6-1 = 20C5

6. (c) a = b3

Explanation: We have, a = sum of the coefficients in the expansion of (1 - 3x + 10x2)n

Putting x = 1, we get

a = (1 - 3 + 10)n

⇒  a = (8)n

⇒  a = (2)3n = (2n)3 ...(i)

and b = sum of the coefficients in the expansion of (1 + x2)n

Putting x = 1, we get

b = (1 + 1)n

⇒  b = 2n ...(ii)

1/6
maths 1
 From (i) and (ii), we get

a = b3
7. (a) 12

Explanation: 12
8. (b) 32

Explanation: 32
9. (a) Both A and R are true and R is the correct explanation of A.

100

Explanation: ∑
500−r
C3 + 400C4

r=0

= 500C3 + 499C3 +...+ 401C3 + 400C3 + 400C4

= 500C3 + 499C3 +...401C3 + 401C4

= 500C3 + 499C3 + ... + 402C4

Similarly,

500C + 500C

3 4
501C = RHS
4

10. (a) Both A and R are true and R is the correct explanation of A.

Explanation: Given: x + y + z + w = 20

20 is divided in four groups.

Now if include zero values for all the integers here, then the total number of solutions

= 20+4-1C4-1
Section B
11. Let E2 (n) denote the index of 2 in n. Then,

E2 (33!) = E2 (1 ⋅ 2 ⋅ 3 ⋅ 4 ⋅ 5 ⋅ 6 .... 32 ⋅ 33)

⇒ E2 (33!) = E2 (2 ⋅ 4 ⋅ 6 ⋅ 8 ....30 ⋅ 32)

⇒ E2 (33!) = 16 + E2 (1 ⋅ 2 ⋅ 3 .......15 ⋅ 16)

⇒ E2 (33!) = 16 + E2 (2 ⋅ 4 ⋅ 6 .... 14 ⋅ 16)

⇒ E2 (33!) = 16 + 8 + E2 (1 ⋅ 2 ⋅ 3... 8)

⇒ E2 (33!) = 16 + 8 + E2 (2 ⋅ 4 ⋅ 6 ⋅ 8)

⇒ E2 (33!) = 16 + 8 + 4 + E2 (1 ⋅ 2 ⋅ 3 ⋅ 4)

⇒ E2 (33!) = 16 + 8 + 4 + E2(2 ⋅ 4) =16 + 8 + 4 + 3 = 31

Thus, exponent of 2 in 33! is 31 i.e. 33! = 231 × an integer

This shows that 33! is divisible by 215 and the largest integer n such that 33! is divisible by 2n is 31
OR
Given: 15C8 + 15C9 - 15C6 - 15C7

To prove: 15C8+ 15C9 - 15C6 - 15C7=0

We know that:

n = C
Cr
n

n−r

15C = 15C and 15C9 = 15 C6

⇒ 8 7
15C + 15C - 15C - 15C = 15C + 15C - 15C - 15C8 = 0

⇒ 8 9 6 7 8 9 9

Hence,proved that 15C8 + 15C9 - 15C6 - 15C7 = 0

12. Let 2n negative integers be (-r), (-r - 1), (-r - 2),. ..... (-r - 2n + 1)

Then, product = (-1)2n (r)(r + 1)(r + 2), ..... (r + 2n - 1)

(r−1)!(r)(r+1)(r+2)……(r+2n−1)
= (r−1)!

(r+2n−1)!
= (r−1)!

2/6
maths 1
 (r+2n−1)!
= (r−1)!(2n)!
× (2n)!

= r+2n−1
C × (2n)!
2n

This is divisible by (2n)!

OR
The total number of arrangements of ten digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 taking 4 at a time is 10P4.

But, these arrangements also include those numbers which have 0 at thousand's place. Such numbers are not four-digit numbers.

When 0 is fixed at thousand's place, we have to arrange the remaining 9 digits by taking 3 at a time.

The number of such arrangements is 9P3.

So, the total number of numbers having 0 at thousand's place = 9P3

Hence, the total number of four-digit numbers = 10P4 - 9P3 = 5040 - 504 = 4536
n
Cr n−r+1
13. nC
= r

r−1
n
Cr
LHS = n
Cr−1

n! (r−1)!(n−r+1)!
= r!(n−r)!
×
n!

(n−r+1)(n−r)!(r−1)!
=

r(r−1)!(n−r)!

n−r+1
= r
= RHS

∴ LHS = RHS

Hence proved
14. We have 9n+1 = (1 + 8)n+1

=
n+1
C0 +
n+1
C1 (8)+
n+1
C2 (8) +
2 n+1 3
C3 (8) +. . . +
n+1
Cn+1 (8)
n+1

= 1 + (n + 1) × 8+
n+1
C2 (8)
2
+
n+1 3
C3 (8) +. . . +
n+1
Cn+1 (8)
n+1

n+1 2 n+1 3 n+1 n+1

= 1 + 8n + 8+ C2 (8) + C3 (8) + . . . . + Cn+1 (8)
2 3
= 9 + 8n +
n+1
C2 (8)
n+1
+ C3 (8) +. . . . . . . . +
n+1
Cn+1 (8)
n+1

⇒ 9
n+1
− 8n − 9 =
n+1
C2 (8)
2
+
n+1
C3 (8)
3
+. . . +
n+1
Cn+1 (8)
n+1

= 64[
n+1
C2 +
n+1
C3 ⋅ 8 +. . . +
n+1
Cn+1 ⋅ 8
n+1
]

which show that 9n+1 - 8n-9 is divisible by 64 wherever n is a positive integer

n n n−r r n
∑ Cr a b = (a + b) . . . . . . . . . (1)
r=0

n
n
15. N ow, ∑
r=0
3
r n
Cr = ∑
n
Cr (1)
n−r r
.3 = (1 + 3)
n
(by (1)
r=0

n
= 4

Section C
16. Clearly, ALGEBRA has seven letters, where two A’s, one L, one G, one E, one B, one R.
i. Since, two A’s are always together. We take both the A’s as one letter.

If p is the number of arrangements, then

p = 6! = 6 × 5 × 4 × 3 × 2 × 1 = 720
ii. Total number of arrangements of given word

q= = 7!

2!

7×6×5×4×3×2!

2!

= 7 × 6 × 5 × 4 × 3 = 2520

In these arrangements, some arrangements have two A’s are together while in the rest they are not together.

Hence, the number of arrangements in which two A’s are not together is q - p = 2520 - 720 = 1800
17. Given the word ZENITH. It has 6 letters.

To find: Total number of words that can be generated by relative arranging the letters of the word ZENITH.

Since it has 6 letters with no repetition, therefore the number of ways of arranging 6 letters on 6 positions is 6! = 720

To find: Rank of word ZENITH when all its permutations are arranged in alphabetical order, i.e. in a dictionary.

First comes, the words starting from the letter E = 5! = 120

words starting from the letter H = 5! = 120

words starting from the letter I = 5! = 120

words starting from the letter N = 5! = 120

words starting from the letter T = 5! = 120

words starting from letter Z:

3/6
maths 1
 words starting from ZE:

words starting from ZEH = 3! = 6

words starting from ZEI = 3! = 6

words starting from ZEN:

words starting from ZENH = 2! = 2

words starting from ZENI:

words starting from ZENIHT = 1

ZENITH = 1

The rank of word ZENITH = 120 + 120 + 120 + 120 + 120 + 6 + 6 + 2 + 1 + 1 = 616

Hence, the rank of the word ZENITH when arranged in the dictionary is 616
OR
Let the two classes be C1 and C2 and the four rows be R1 R2 R3, R4. There are 16 students in each class. So, there are 32 students.
According to the given conditions there are two different ways in which 32 students can be seated:
R1 R2 R3 R4

I C1 C2 C1 C2

II C2 C1 C2 C1

Since the seating arrangement can be completed by using any one of these two ways. So, by the fundamental principle of addition,

Total number of seating arrangements = No. of arrangement in I case + No. of arrangements in II case.

In case 1, 16 students of class C1 can be seated in R1 and R3 in 16P8 × 8! = 16! ways. And 16 students of class C2 can be seated

in R2 and R4 in 16P8 × 8! = 16! ways

∴ Number of seating arrangements in case I = 16! × 16!

Similarly, Number of seating arrangements in case II = 16! × 16!

Hence, Total number of seating arrangements = (16! × 16!) + (16! × 16!) = 2 (16! × 16!)
18. The required natural numbers consist of 4-digit, 3-digit, 2-digit, and 1-digit.

Total number of 4-digit natural numbers with distinct digits

= 10P4 - 9P3 [here, we subtract those cases in which 0 can be the first place]

Total number of 3-digit natural numbers with distinct digits

= 10P3 - 9P2 [here, we subtract those cases in which 0 can be the first place]

Total number of 2-digit natural numbers with distinct digits

= 10P2 - 9P1 [here, we subtract those cases in which 0 can be the first place]

Total number of 1 -digit natural numbers = 9

Hence, the required numbers of natural number,

= (10P4 - 9P3) + (10P3 - 9P2) + (10P2 - 9P1) + 9

=[ 10!
−
9!
] + [
10!
−
9!
]+ [
10!
−
9!
] +9
(10−4)! (9−3)! (10−3)! (9−2)! (10−2)! (9−1)!

=( 10!
−
9!
) + (
10!
−
9!
) + (
10!
−
9!
) + 9

6! 6! 7! 7! 8! 8!

= (10 × 9 × 8 × 7 - 9 × 8 × 7) + (10 × 9 × 8 - 9 × 8) + (10 × 9 - 9) + 9

= 4536 + 648 + 81 + 9

= 5274
OR
Here total students are 25 from which 10 are chosen for an excursion party. If the 3 students join the party then 7 students out of
remaining 22 students or 3 students not join the party them 10 students out of remaining 22 students.

∴ Number of ways of selection = C ×

3 22 3 22
C + C × C 3 7 0 10

= 1 ×
22!

7!15!
+ 1 ×
22!

10!12!

=
22×21×20×19×18×17×16×15

7×6×5×4×3×2×1×15!
+
22×21×20×19×18×17×16

10×9×8×7×6×5×4×3

= 170544 + 646646 = 817190

– –
19. To find: Value of (2 + √3) + (2 − √3)
7 7

Formula used: C = n

r
n!

(n−r)!(r)!

4/6
maths 1
 (a + b)n =   nC0an + nC1an-1b + nC2an-2b2 + …… +nCn-1abn-1 + nCnbn

(a + b)7 = [ 7 7
C0 a ] + [ C1 a
7 7−1
b] + [ C2 a
7 7−2 2
b ]+ [ C3 a
7 7−3 3
b ] + [ C4 a
7 7−4
b ]
4

7
+ [ C5 a
7−5 5
b ] + [ C6 a
7 7−6 6
b ] + [ C7 b ]
7 7

= 7C0a7 + 7C1a6b + 7C2a5b2 + 7C3a4b3 + 7C4a3b4 + 7C5a2b5 + 7C6a1b6 + 7C7b7 … (i)

(a - b)7 [ 7 7
C0 a ] + [ C1 a
7 7−1
(−b)] + [ C2 a
7 7−2 2
(−b ) ] + [ C3 a
7 7−3 3
(−b ) ] + [ C4 a
7 7−4 4 7 7−5
(−b) ] + [ C5 a
5
(−b) ]

7
+ [ C6 a
7−6 6
(−b ) ] + [ C7 (−b ) ]
7 7

= 7C0a7 - 7C1a6b + 7C2a5b2 - 7C3a4b3 + 7C4a3b4 - 7C5a2b5 + 7C6a1b6 - 7C7b7 ….. (ii)

Adding eqn. (i) and (ii)

(a+b)7 + (a-b)7= [7C0a7 + 7C1a6b + 7C2a5b2 + 7C3a4b3 + 7C4a3b4 + 7C5a2b5 + 7C6a1b6 + 7C7b7] + [7C0a7 - 7C1a6b + 7C2a5b2 -
7C a4b3 + 7C a3b4 - 7C a2b5 + 7C a1b6 - 7C b7]

3 4 5 6 7

= 2[7C0a7 + 7C2a5b2 + 7C4a3b4 + 7C6a1b6]

2
= 2 [[
7! 7
a ] + [
7!
a
5b
]+[
7! 3
a b ] + [
4 7! 1
a b ]]
6

0!(7−0)! 2!(7−2)! 4!(7−4)! 6!(7−6)!

= 2[(1)a7 + (21)a5b2 + (35)a3b4 + (7)ab6]

= 2[a7 + 21a5b2 + 35a3b4 + 7ab6] = (a+b)7 + (a-b)7

–
Putting the value of a = 2 and b = √3 in the above equation

– –
(2 + √3) + (2 − √3)

7 7

– 2 – 4 – 6
7 3 5
= 2 [{2 } + {21(2) (√3) } + {35(2) (√3) } + {7(2)(√3) }]

= 2[128 + 21(32)(3) + 35(8)(9) + 7(2)(27)]

= 2[128 + 2016 + 2520 + 378]

= 10084
20. To prove: (2 + √−
x)
4 − 4
+ (2 − √x ) = 2(16 + 24x + x2)

Formula used: n
Cr =
(n−r)!(r)!
n!

(a+b)n =   nC0an + nC1an-1b + nC2an-2b2 + …… +nCn-1abn-1 + nCnbn(a+b)4 = 4C0a4 + 4C1a4-1b + 4C2a4-2b2 + 4C3a4-3b3 + 4C4b4

= 4C0a4 + 4C1a3b + 4C2a2b2 + 4C3a1b3 + 4C4b4 … (i)

(a - b)4 = 4C0a4 + 4C1a4-1(-b) + 4C2a4-2(-b)2 +4C3a4-3(-b)3+4C4(-b)4

= 4C0a4 - 4C1a3b + 4C2a2b2 - 4C3ab3 + 4C4b4 … (ii)

Adding (i) and (ii)

(a+b)4 + (a-b)7 = [4C0a4 + 4C1a3b + 4C2a2b2 + 4C3a1b3 + 4C4b4] + [4C0a4 - 4C1a3b + 4C2a2b2 - 4C3ab3 + 4C4b4]

= 2[4C0a4 + 4C2a2b2 + 4C4b4]

4! 4 4! 2 2 4! 4
= 2 [( a ) + ( a b )+ ( b )]
0!(4−0)! 2!(4−2)! 4!(4−4)!

2[(1)a4 + (6)a2b2 + (1)b4]

= 2[a4 + 6a2b2 + b4]

Therefore, (a+b)4 + (a-b)7 = 2[a4 + 6a2b2 + b4]

Now, putting a = 2 and b = (√− x ) in the above equation.

− 4 − 4 − 2 − 4
4 2
(2 + √x ) + (2 − √x ) = 2 [(2) + 6(2) (√x ) + (√x ) ]

= 2(16 + 24x + x2)

Hence proved
OR
We have,

(x + a)n = {nC0xn a0 + nC1 xn-1 a1 + nC2 xn-2 a2 + ... + nCn-1 x an-1 + nCn an

⇒ (x + a)n = {nC0xn a0 + nC2 xn-2 a2 + ...} + {nC1 xn-1 a1 + nC3 xn-3 a3 + ...}

⇒ (x + a)n = O + E ...(a)

and, (x - a)n = nC0 xn - nC1 xn-1 a1 + nC2 xn-2 a2 - nC3 xn-3 a3 + ... + nCn-1 x (- 1)n-1 an-1 + nCn (- 1)n an

5/6
maths 1
⇒ (x - a)n = {nC0 xn + nC2 xn-2 a2 + ...} - {nC1 xn-1 a1 + nC3 xn-3 a3 + ...}

⇒ (x - a)n = O - E ... (b)

i. Multiplying (a) and (b), we get
(x + a)n (x - a)n = (O +E) (O -E)

⇒ (x2 - a2)n = O2 - E2
ii. We have,

4 OE = (O+E)2 -(O -E )2

⇒ 4 OE = {((x + a)n}2 - {(x - a)n}2 [Using (a) and (b)]

⇒ 4 OE = (x + a)2n - (x - a)2n

6/6
maths 1