19.10.2019 Views

1.Algebra Booster

  • No tags were found...

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Binomial Theorem 6.25<br />

fi m π not an integer<br />

Thus, the greatest term = 4<br />

31. We have,<br />

= 6 n .6 2 +7 2n .7<br />

t È 5 ˘+<br />

= 36.6 n + 7(6 + 43) n 1<br />

Î 19˚<br />

n n n n-1<br />

= 36.6 + 7[6 + C<br />

= t 6<br />

= 6th term.<br />

1◊ (6) 43 +<br />

n n-2 2 n n-n n<br />

C2<br />

◊ + + Cn<br />

◊<br />

( n+<br />

1)| x|<br />

n n n-1 n n-1<br />

m =<br />

= 43[6 + C1<br />

◊ (6) + + Cn<br />

◊43 ]<br />

a + | x|<br />

Thus, it is divisible by 43.<br />

Ê 5 1ˆ<br />

16<br />

(15 + 1) Á- ¥<br />

36. We have,<br />

Ë<br />

˜<br />

3 5¯<br />

= =<br />

3<br />

11<br />

= 4<br />

10 – 1<br />

Ê 5 1ˆ<br />

4<br />

10<br />

1 + Á- ¥<br />

= (1 + 10) -1<br />

Ë<br />

˜<br />

3 5¯<br />

3<br />

10 10 2 10 3<br />

= (1 + C1◊ 10 + C2◊ 10 + C3◊10<br />

m = an integer<br />

10 100<br />

+ + C100<br />

◊10 ) -1<br />

10 10 2 10 3<br />

= ( C1◊ 10+ C2◊ 10 + C3◊10<br />

10 100<br />

+ + C100<br />

◊10 )<br />

= (1 + 3) n – 3n – 1<br />

10 10 10 98<br />

= 100( C2 + C3 ◊ 10 + + C100<br />

◊10 )<br />

n n 2 n n<br />

= (1 + C1◊ 3 + C2◊ 3 + + Cn<br />

◊3 ) -3n-1<br />

Thus, it is divisible by 100.<br />

n 2 n n<br />

= (1 + 3n+ C2<br />

◊ 3 + + Cn<br />

◊3 ) -3n-1<br />

37. We have,<br />

n 2 n 3 n n<br />

7<br />

= ( C2◊ 3 + C3◊ 3 + + Cn<br />

◊3 )<br />

98 = (7 2 ) 49<br />

2 n n n n-<br />

2<br />

= 3( C2+ C3◊ 3+ + Cn<br />

◊3 )<br />

= (50 – 1) 49<br />

49 49 48 49 47<br />

= (50 - C1◊ 50 + C2◊50<br />

49 46 49<br />

- C3◊ 50 + - C49◊1)<br />

49 49 48 49 47<br />

= (50 - C1◊ 50 + C2◊50<br />

49 46<br />

- C<br />

= 9.(1 + 8) n 3 ◊ 50 + - 5) + 4<br />

– 8n – 9<br />

Thus, the remainder is 4.<br />

n n 2<br />

= 9(1 + C1◊ 8 + C2◊8<br />

38. We have<br />

n 3 n n<br />

+ C3<br />

◊ 8 + + Cn<br />

◊8 )-8n<br />

-9<br />

1 2013 + 2 2013 + 3 2013 + … + 2011 2013 + 2012 2013<br />

n 2 n 3<br />

= 9(8n + C2◊ 8 + C3◊8<br />

n n<br />

+ + Cn<br />

◊8) -8n<br />

2 n 2 n 3<br />

= (8 n + C2◊8 ◊ 9 + C3◊8 ◊9<br />

n n<br />

+ + Cn<br />

◊8 ◊9)<br />

2 n n<br />

= 8 ( n + C2◊ 9 + C3◊8.9<br />

n n-<br />

2<br />

+ + Cn<br />

◊8 ◊9)<br />

= 121.11 n + 12.(11 + 133) n<br />

n n n n-1<br />

= 121.11 + 12[11 + C1<br />

◊(11) 133<br />

n n-2 2 n n-n n<br />

+ C2<br />

◊ (11) 133 + + Cn<br />

◊(11) 133 ]<br />

n n n-1 n n-1<br />

= 133[11 + C1<br />

◊ (11) + + Cn<br />

◊133 ]<br />

6 n+2 + 7 2n+1<br />

fi<br />

Thus, the greatest term are t 4<br />

and t 4+1<br />

, i.e 4th and 5th<br />

terms.<br />

32. We have,<br />

(4 n – 3n – 1)<br />

Thus, (4 n – 3n – 1) is divisible by 9.<br />

33. We have,<br />

3 2n+2 – 8n – 9<br />

= 3 2 .3 2n – 8n – 9<br />

= 9.9 n – 8n – 9<br />

Thus, it is divisible by 64.<br />

34. We have,<br />

11 n+2 + 12 2n+1<br />

= 11 2 .11 n + 12.12 2n<br />

= 121.11 n + 12.(144) n<br />

Thus, it is divisible by 133.<br />

35. We have,<br />

(6) 43 (6) 43 ]<br />

= (1 2013 + 2012 2013 ) + (2 2013 + 2011 2013 )<br />

+ … + (1006 2013 + 1007 2013 )<br />

Here, each bracket is of the form of (a 2n+1 + b 2n+1 ) and so<br />

is divisible by (a + b).<br />

Hence, the given expression is divisible by 2013.<br />

39. We have<br />

1992 1998 – 1955 1998 – 1938 1998 + 1901 1998<br />

= (1992 1998 – 1938 1998 ) – (1955 1998 – 1901 1998 )<br />

Clearly, it is divisible by 54.<br />

Also, the given expression can be written as<br />

(1992 1998 – 1955 1998 ) – (1938 1998 – 1901 1998 )<br />

It is divisible by 37.<br />

Thus, the given expression<br />

1992 1998 – 1955 1998 – 1938 1998 + 1901 1998<br />

is divisible by 54 ¥ 37 = 1998<br />

40. We have,<br />

53 53 – 33 3<br />

= ((53 53 – 43 53 ) + (43 53 – 33 3 ))<br />

= ((53 53 – 43 53 ) + (43 53 – 33 43 ) + (33 43 – 33 3 ))<br />

Clearly, each bracket is divisible by 10.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!