o SOLUTIONS OF * MARKED PROBLEMS (ALGEBRA)

Miscellaneous Exercises (Algebra)

(Solutions of * marked problems)
1. The number of determinants of the second order that can be made with 0 and 1 = 2 2 2 2 = 16 (Since each of the four places of elements can be filled in 2 waysby 0 or 1). So, n (S) = 16. Let E = the event of getting non-negative determinants. Then E = the event of getting negative determinants. Clearly negative determinants of the second order that can be made with 0, 1 are

1
,

1 0

0 1 1 1 , . 1 1 1 0 13 n( E ) 3 3 = . So, P(E) = 1 P( E ) = 1 = . n( S ) 16 16 16 13 . (Ans.) 16

So, P( E ) =

Hence, the required probability =

2. Total number of small squares on a chessboard = 64. So, the total number of ways to select 2 squares = n (S) = 64 C2 . Two squares selected can have a corner in common if they are selected from two consecutive rows (columns). Since there are 8 rows (columns), so the number of ways for selecting two consecutive rows (or columns) = 7. For each pair of two consecutive rows (columns), the number of pairs of squares having exactly one common corner = 2 7 = 14.

So, the number of ways for selecting two squares having a common corner = n (E) = 7 14. The required probability =

7 14 7 4 2 7 n( E ) = = = . (Ans.) n( S ) 64 64 63 144 C2

3. In an ordinary pack of 52 cards, 26 are black and 26 are red.

RUDIMENTS OF MATHEMATICS

n (S) = total number of ways of drawing even number of cards = 52 C2 + 52 C4 + ... + 52 C52 = 252 1 1 = 251 1 n (E) = The number of ways of drawing 2n cards of which n are black and n are red = 26 C1 26 C1 + 26 C2 26 C2 + ... + 26 C26 26 C26 . Now, (1 + x)26 = 26 C0 + 26 C1 x + 26 C2 x2 + ... + 26 C26 x26

FH 1 + 1 IK 26 = 26C0 + 26C1 1 + 26C2 12 x x x

The constant term in (1 + x)26 1 +

1 + ... + 26 C26 26 . x

FH

1 x

IK 26 = (26C0)2 + (26C1)2 + ... + (26C26)2.

x ) 52 IK 26 = the co-efficient of x0 in (1 + 26 x

1 But the constant term in (1 + x)26 1 + x

FH

= co-efficient of x26 in (1 + x)52 = 52 C26 . Thus, (26 C0 )2 + (26 C1 )2 + ... + (26 C26 )2 = 52 C26 . So, n (E) = 52 C26 (26 C0 )2 =

52! (26!)2

1.

1 (26!)2 . (Ans.) Hence, the required probability = 251 1

4. From an ordinary pack of 52 cards, 4 cards can be drawn in 52 C4 ways. So, the probability of drawing all the four aces is

52!

1
52

C4 1
52

The probability of As success in the first draw = The probability of As success in the 2nd draw

C4

2 F F 1 1 IF 1 I 1 I 1 = G1 1 52 J 52 = G1 J G J 52 52 52 H C4 K H C4 K C4 H C4 K C4

since A will get the 2nd chance only when A fails in the first trial and B fails in his first trial. By the similar argument As probability of succeeding in the 3rd trial = 1

F GH

I4 1 . J 52 C4 K 52C4
1

o SOLUTIONS OF * MARKED PROBLEMS (ALGEBRA)

Hence As probability of succeeding is the sum of the infinite series.

1
52

C4

F1 1 I 2 1 + F1 1 I 4 1 GH 52C4 JK 52C4 GH 52C4 JK 52C4

1
52

+ ...

= a (1 + a 2 + a 4 + ...) where a =

C4

Since, B will have his first trial only when A fails in his 1st trial, so the probability of Bs success is the sum of the infinite series

F1 1 I GH 52C4 JK

1
52

C4

3 5 F F 1 I 1 1 I 1 + G 1 52 J + G 1 52 J 52 52 H C 4 K C4 H C4 K C4

+ ...

= (1 a ) a (1 + a 2 + a 4 + ...). So, probability of As success : probability of Bs success = a : (1 a )a = 1 : (1 a ) = 1 : 1 = 270725 : 270724. (Ans.) 5. Let A be the event of having rain in a day. Clearly P(A) =

F GH

I = 1 : 270724 J 270725 52 C4 K
1 3 . 5

40 2 = . 100 5

So, P( A ) =

Thus, the probability of having at least one rainy day in 7 days is P(E) = 1 (probability of not having rain in 7 days)
7 F 3I 2187 75938 = = 0.79 (approx.). = 1 G J = 1 H 5K 78125 78125

When there is a rainy day, then the probability of having at least two rainy days 1

probabilityof having at least one rainy day in the six days = 2 probability of having rainy day 7 C1 5 1 729

FG 3 IJ 6 H 5K

7448 14896 5 1064 15625 = = = 0.34 (approx.) (Ans.) = 3125 7 15625 14 3125 14 5

RUDIMENTS OF MATHEMATICS

5 3 7n 10. Let P(n ) be the statement : n + n + is a positive integer where e n is a positive integer. . 15 5 3

Basis step :
5 1 1 7 15 n3 7n + = + + = = 1 whence we see that P(1) holds. For n = 1, n + 3 15 5 5 3 15 15

Inductive hypothesis : Let k be any positive integer ( 1) such that P(k) holds ;
5 k3 7k + is a positive integer. er. i.e., k + 3 15 5

Inductive step : To show P(k + 1) holds. Now, ( k + 1)5 ( k + 1)3 7 ( k + 1) + + 5 3 15 1 5 1 7 [k + 5k4 + 10k3 + 10k2 + 5k + 1] + [k3 + 3k2 + 3k + 1] + (k + 1) 5 3 15

FG k5 + k3 + 7k IJ + k4 + 2k3 + 2k2 + k + 1 + k2 + k + 1 + 7 H 5 3 15 K 5 3 15 F k5 + k3 + 7k IJ + k4 + 2k3 + 3k2 + 2k + 1. = G H 5 3 15 K

FG k5 + k3 + 7k IJ is also a positive integer, whence combining these two o H 5 3 15 K

Now, as k is a positive integer ( k4 + 2k3 + 3k2 + 2k + 1) must be a positive integer and by inductive hypothesis

information we conclude that P(k + 1) holds. Consequently, by the principle of mathematical induction the result follows. (Proved.) 16. First Solution : We prove it by induction on n . Basis Step : Suppose n = 0. Then A is empty and hence f is the only subset of A. We find that the number of subsets of A is 1 = 20 . Inductive hypothesis : Let n be a positive integer. Suppose for any set A with n 1 elements, the number of subsets of A is 2n 1 . Inductive Step : Let A be a set with n 1 elements. Since n 1, A contains at least one element a . Let B = A \ {a }. Then, the number of elements of B is n 1. By inductive hypothesis the number of subsets of B is 2n 1 .

o SOLUTIONS OF * MARKED PROBLEMS (ALGEBRA)

Let T1 = {D P (A) | a D}. Now, T1 = P (B). Let T2 = {D P (A) | a D}. Then, T2 = {D P (A) | D \ {a } T1 }. Hence T1 , T2 have 2 n 1 elements. Since, P (A) = T1 T2 and T1 T2 = f, we see that | P (A) | = | T1 | + | T2 | = 2n 1 + 2n 1 = 2.2n 1 = 2n . Hence, the result follows by mathematical induction. (Proved.) Second Solution : (Without using mathematical induction) Let A be a set containing n elements. Then the number of its subsets having only one element is the same as the number of combinations of n elements taken 1 at a time, i.e., n C1 . In general, the number of subsets of A, containing r elements (r n ) is given by n Cr. Consequently, the number of all possible subsets (including the null set) is given by,
nC n n ... + n Cn = 2n . (Proved.) 0 + C1 + C2 +

n ( n 1) n ( n 1)( n 2 ) + 3. + ... + n .1 36. (i) Here, C1 + 2C2 + 3C3 + ... + n Cn = n + 2. 2! 3! = n 1+

LM N

( n 1) ( n 1)( n 2 ) + + + 1 = n [n 1 C0 + n 1 C1 + n 1 C2 + ... + n 1 Cn 1 ] 1! 2!

OP Q

= n (1 + 1)n 1 [putting x = 1 and replacing n by n 1 in the given identity] = n .2n 1 . (Proved.) (ii) Here C0 C1 C2 C n (n 1) + ... + ( 1)n n = 1 n + ... + ( 1)n . 1 1 2 3 n +1 1 2 1! 3 2! n +1

1 n + 1 ( n + 1) n (n + 1) n ( n 1) + + + ( 1) n 1 n +1 1 2! 3! 1 n +1

LM N

OP Q

nn+1C0 n+1C1 + n+1C2 n+1C3 + + (1)n+1 n+1Cn+1s 1

1 [(1 1)n +1 1] [Replacing n in the given identity by n + 1 and putting x = 1] n +1

1 . (Proved.) n +1 Cr (n r + 1)!( r 1)! n! (n r +1)!r ! = r. = = n r + 1. Cr 1 r !( n r )! n! r !(n r )!

(iii) We have, r.

RUDIMENTS OF MATHEMATICS

Putting r = 1, 2, 3, ..., n and then adding we get C1 C C C + 2 2 + 3 3 + ... + n . n = n + (n 1) + ( n 2) + ... + 2 + 1 C0 C1 C2 Cn 1 n ( n + 1) . (Proved.) = 1 + 2 + 3 + ... + n = 2 (iv) We have, (1 + x)n (x + 1)n = (1 + x)2 n or, (C0 + C1 x + C2 x2 + C3 x3 + ... + Crxr + Cr+1xr+1 + ... + Cn xn ) (C0 xn + C1 xn 1 + C2 xn 2 + ... + Cnrxr + Cnr+1xr1 + ... + Cn ) = 2 n C0 + 2 n C1 x + ... + 2 n Crxr + ... 2 n C2 n x2 n ... (i) Comparing the coefficients of xn+r of both the sides of the identity (i) we have, CrC0 + Cr+1 C1 + Cr+2 C2 + ... + Cn Cnr = 2 n Cn+r or, C0 Cr + C1 Cr+1 + C2 Cr+2 + ... + Cnr Cn =

(2n)! . (Proved.) (n + r )!(n r )!

(v) From (1 + x)n +1 (x + 1)n = (1 + x)2 n +1 we have, (n +1C0 + n +1C1 x + n +1C2 x2 + ... + n +1Cn xn + n +1Cn +1xn +1).(C0 xn + C1 xn 1 + C2 xn 2 + ... + Cn 1 x + Cn ) = 2 n +1C0 + 2 n +1C1 x + 2 n +1C2 x2 + ... + 2 n +1Cn +1xn +1 + ... + 2 n +1C2 n +1x2 n +1 ... (i) Comparing the coefficients of xn +1 of both the sides of the identity (i) we have
n +1C C + n +1C C + n +1C C + ... + n +1C 2 n +1C 1 0 2 1 3 2 n +1 C n = n +1 ... (ii) n +1

Since

Cr

Cr 1

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

n +1C = n + 1 . n C , for r = 1, 2, ... n . ... (iii) r r1 r

From (ii) applying (iii), we have n + 1 . C .C + n + 1 . C .C + n + 1 . C .C + ... + n + 1 . C .C = (2 n + 1)! 0 0 1 1 2 2 1 2 3 n + 1 n n ( n + 1)! n ! ( 2n + 1)! (2n + 1)! (2n + 1)! or, C2 + 1 C2 + 1 C2 + + 1 C2 = = = . (Proved.) ed.) 0 2 1 3 2 n n +1 (n + 1)!(n + 1)(n!) (n + 1)!(n + 1)! {( n + 1)!}2 r Note : To solve problems of the type (iv) or, (v) a sort of mechanical rule is of help : First take an identity of the form (1 + x)r1 (1 + x)r2 = (1 + x ) 1
r +r2

o SOLUTIONS OF * MARKED PROBLEMS (ALGEBRA)

The value r1 + r2 should be equal to the number within the factorial sign in the numerator of R.H.S. and then select the number r which is the greater one among the two numbers within the factorial sign in the denominator of R.H.S. and finally compare the coefficients of xr of both the sides of the above identity. (vi) We know, (x + 1)n (1 x)n = (1 x2 )n , which gives (C0 xn + C1 xn 1 + C2 xn 2 + ... + Cn )(C0 C 1 x + C2 x2 C 3 x3 + ... + ( 1)n Cn xn ) = C0 C 1 x2 + C2 x4 C 3 x6 + ... + ( 1)n Cn x2 n . ... (i) Now the coefficient of xn in the L.H.S. of the identity (i) is
2 2 ... + ( 1)n C2 . C2 0 C1 + C2 n

We see that R.H.S. of (i) contains only even powers of x; So if n is any odd positive interger then there is no term containing xn in the R.H.S. of (i), but if n be even then its coefficient in R.H.S is ( 1) 2 C n .
2 n

So comparing the coefficients of xn from both the sides of (i), we have

2 2 2 2 n 2 C2 0 C1 + C 2 C 3 + ... + ( 1) Cn = 0, n is odd = ( 1)
n

n!

{e j }
n ! 2

, n is even.

This proves the required result. (vii) If t n denotes the n th term of L.H.S. then tr = 3r +1 Cr 1 n! = 3r+1. r ( r + 1) ( r + 1)r {(r 1)!}( n r + 1)!

= 3r+1

(n + 2)(n + 1){n!} n! = 3r+1 ( r + 1)!(n r + 1)! (n + 1) (n + 2) {(r + 1)!(n r + 1)!}

n +2 C ( n + 2 )! r +1 . = 3r+1. ( n + 1)( n + 2 )[( r + 1)!{( n + 2 ) (r + 1)}!] ( n + 1)( n + 2 )

= 3r+1.

Putting r = 1, 2, 3, ..., n + 1 and then adding we get Cn 32 C0 33 C1 34 C2 + + + ... + 3n +2. ( n + 1)( n + 2 ) 1 2 23 3 4 = 1 [32 . n +2C2 + 33 . n +2C3 + ... + 3n +2. n +2Cn +2] ( n + 1)( n + 2 ) 1 [(1 + 3. n +2C1 + 32 . n +2C2 + ... + 3n +2. n +2Cn +2) (1 + 3. n +2C1 )] ( n + 1)( n + 2 ) 1 [(1 + 3)n +2 {1 + 3(n + 2)}] ( n + 1)( n + 2 )

= =

RUDIMENTS OF MATHEMATICS
2n +4 3 n 7 1 [4n +2 (3n + 7)] = 2 . (Proved.)] ( n + 1)( n + 2 ) ( n + 1)( n + 2 )

38. Let x = Now, let

3 +1

i2n = [x] + f... (i) where 0 f < 1.

3 1

i2n = f ... (ii) where 0 < f < 1.

d
3 +1
n

Adding (i) and (ii) we get [x] + f + f = = 4+ 2 3

i2n + d

3 1
n

i2n

U 2 + 3 i + d2 3 i V in + d 4 2 3 in = 2n R S d T W 2 4 n n n n 2 n n 4 U = 2n . 2 R S T C0 2 + C2 2 . 3 + C4 . 2 3 + . . . etcV W

\ [x] + f + f = 2n +1. k... (iii) where k is an integer. Hence, f + f is an integer, i.e., f + f = 1 (since 0 < f + f < 2). From (iii) [x] + 1 = 2n +1.k or,

LM d N

3+1

i2n OPQ + 1 = 2n+1. k ... from (i)

3+1

This shows

LM d N

i2n OPQ + 1 is divisible by 2n+1 for all n N. (Proved).

j e j

45. Let the co-ordinates of vertices of the triangle be

2 , 2 at 2 2 A at1 1 , B at2 , 2 at2 , C at3 , 2 at3 .

j e

Then the ordinates y1 , y2 , y3 of A, B, C are yi = 2at i respectively, i = 1, 2, 3. So, the area of the triangle is
2 t 2 2 at 1 2 1 t1 t1 1 1 at1 t1 1 1 2 2 2 at 2 2 2 t t 1 = a 2 t t t2 t1 0 D = at 2 2 1 = a 2 2 2 1 2 2 t 2 2 at 1 2 t t t3 3 1 t2 t at 3 3 2 0 3 2 3 2 t1 1 t1 2 = a (t2 t1 )(t3 t2 ) t2 + t1 1 0

[ R2 = R2 R 1 ;

R 3 = R3 R 2 ]

[Taking t 2 t1 and t3 t2 common from R2 and R 3 respectively]

t3 + t2

t2 + t1 1 = a 2 (t2 t1 )(t3 t2 ) t3 + t2 1

[expanding along the 3rd column]

o SOLUTIONS OF * MARKED PROBLEMS (ALGEBRA)

= a 2 (t2 t1 )(t3 t2 )(t2 + t1 t3 t2 ) = a 2 (t2 t1 )(t3 t2 )(t1 t3 ) =

1 1 (2at 2 2 at 1 )(2at 3 2 at 2 )(2at 1 2 at 3 ) = (y y1 )(y3 y2 )(y1 y3 ). 8a 8a 2

Since area is +ve, therefore the required area =

1 | (y2 y1 ) (y2 y3 ) (y3 y1 ) |. (Proved.) 8a

r
n n (n + 1) 2

r =1

x y z

48. Here D r =
r =1

r =1 n r =1

( 2 r - 1) (3r - 1)

n2
n ( 3n - 1) 2

n (n + 1) 2 n( n + 1) 2 n 2 n(n + 1) 3 2 n

x y z

n( n + 1) 2 n2 n ( 3 n 1) 2

n (n + 1) 2 2

x y z

n( n + 1) 2 2

n ( 3n - 1) 2

n (3 n - 1 ) 2

= 0 (Proved.) [Since C1 , C3 are identical]

53. Here A28 is a number of the form A28 = A 100 + 28, 3B9 is a number of the form 3 100 + B 10 + 9, 62C is a number of the form 6 100 + 2 10 + c. Above three numbers are divisible by k (given). Let 100A + 28 = n 1 .k 309 + 10B = n 2 .k 620 + C = n 3 .k where n 1 , n 2 , n 3 are three integers. A Now 8 2 A 3 9 6 A 3 6 C = 100A + 28 309 + 10 B 620 + C [by y R2 = 100R1 + R2 + 10R3 ] B 2 B 2 2 3 6 n3 k 2 A 3 6 n3 2 [taking k common from 2nd row.] .]

= n1k n2 k 2 B

= k n1 n2 2 B

Hence the given determinant is divisible by k. (Proved.)