19.10.2019 Views

1.Algebra Booster

  • No tags were found...

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Binomial Theorem 6.43<br />

and<br />

D<br />

Now, n + 1 C 1<br />

+ n + 1 C 2<br />

S 1<br />

+ n + 1 C 3<br />

S 3<br />

+ … + n + 1 C n + 1<br />

S n<br />

25. Given, a = (4 1/401 – 1)<br />

fi (a + 1) 401 = 4<br />

Now, b n<br />

= n C 1<br />

+ n C 2<br />

◊ a + n C 3<br />

◊ a 2 + … + n C n<br />

◊ a n – 1<br />

\ 1 + ab n<br />

= n C 1<br />

◊ a + n C 2<br />

◊ a 2 + n C 3<br />

◊ a 3 + … + n C n<br />

◊ a n<br />

fi<br />

fi<br />

n+<br />

1<br />

1 - q<br />

fi<br />

=<br />

1 - q<br />

2<br />

n<br />

Êq + 1ˆ Êq + 1ˆ Êq<br />

+ 1ˆ<br />

fi<br />

n = 1 + Á + + +<br />

Ë<br />

˜ Á ˜ Á ˜<br />

2 ¯ Ë 2 ¯ Ë 2 ¯<br />

fi<br />

n+<br />

1<br />

Ê1<br />

+ qˆ<br />

1 - Á n+ 1 n+<br />

1<br />

Ë<br />

˜<br />

2 ¯ 2 - (1 + q)<br />

= =<br />

1 q<br />

n<br />

Ê + ˆ<br />

1 -<br />

2 (1-<br />

q)<br />

Á<br />

Ë<br />

˜<br />

2 ¯<br />

1 [<br />

n+<br />

1<br />

= C1<br />

(1 - q )<br />

1 - q<br />

n+ 1 2 n+<br />

1 3<br />

+ C2(1 - q ) + C3(1 - q )<br />

n+ 1 n+<br />

1<br />

+ + Cn+<br />

1(1 - q )]<br />

n 1 n 1<br />

1 È<br />

+ +<br />

˘<br />

n+ 1 n+<br />

1 k<br />

= ÍÂ<br />

Ck<br />

-Â<br />

Ckq<br />

˙<br />

1 - q Í Îk= 1 k=<br />

1 ˙ ˚<br />

1 ((2<br />

n+ 1 1) {(1 )<br />

n+<br />

1<br />

= - - + q - 1})<br />

1 - q<br />

n+ 1 n+<br />

1<br />

2 - (1 + q)<br />

=<br />

(1 - q)<br />

n<br />

= 2 Dn<br />

fi<br />

27. Let<br />

fi<br />

1 + ab n<br />

= (1 + a) n<br />

n<br />

(1 + a) -1<br />

bn<br />

=<br />

a<br />

2006 2005<br />

(1 + a) - 1 (1 + a) -1<br />

= -<br />

a<br />

a<br />

2006 2005<br />

(1 + a) -(1 + a)<br />

=<br />

a<br />

2005<br />

(1 + a) (1 + a -1)<br />

=<br />

a<br />

2005<br />

( 1 + a)<br />

¥ a<br />

=<br />

a<br />

= (1 + a) 2005<br />

fi<br />

– n C 4<br />

a n – 4 + … + (–1) n – 1 n C n – 1<br />

Hence,<br />

the value of (b 2006<br />

– b 2005<br />

)<br />

2005<br />

= 4 401<br />

= 4 5 = 2 10<br />

26. We have,<br />

f(n) = n C 0<br />

◊ a n – 1 – n C 1<br />

◊ a n – 2 + n C 2<br />

◊ a n – 3<br />

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

0 1 2<br />

n n-3 n-1<br />

n<br />

Ca 4 ( 1) Cn-1<br />

a 1<br />

af ( n) + (- 1) = C ◊a - C ◊ a + C ◊a<br />

- + + - ◊ -<br />

af(n) + (–1) n = (a – 1) n<br />

( a -1) - (-1)<br />

f( n)<br />

=<br />

a<br />

Now,<br />

f(2007) + f(2008)<br />

n<br />

n<br />

2007 2007 2008 2008<br />

( a -1) - (-1) ( a -1) - (-1)<br />

= +<br />

a<br />

a<br />

2007 2008<br />

( a - 1) + 1 ( a -1) -1<br />

= +<br />

a<br />

a<br />

2007 2008<br />

( a - 1) + ( a -1)<br />

=<br />

a<br />

2007<br />

( a - 1) (1+ a -1)<br />

=<br />

a<br />

2007<br />

( a - 1) ¥ a<br />

=<br />

a<br />

2007<br />

= ( a -1)<br />

2007<br />

323<br />

= 3 = 3<br />

Now, 9m = 3 9<br />

9<br />

3 7<br />

m = = 3 = 2187<br />

9<br />

n<br />

Â<br />

k = 0<br />

n<br />

9<br />

S = C ◊sin( kx) ◊cos( n - k)<br />

x<br />

n<br />

Â<br />

k = 0<br />

n<br />

k<br />

S = C ◊sin[( n - k) x] ◊cos( k)<br />

x<br />

Adding, we get<br />

n<br />

Â<br />

n<br />

k = 0<br />

n<br />

k = 0<br />

n-<br />

k<br />

2S = C ◊sin( kx) ◊cos( n - k)<br />

x<br />

n<br />

Â<br />

k = 0<br />

n<br />

n<br />

Â<br />

n<br />

k<br />

+ C◊sin[( n- kx ) ] ◊cos( kx )<br />

n<br />

k<br />

= C ◊ sin[ kx + ( n - k) x]<br />

Â<br />

k = 0<br />

k<br />

= C ◊sin( n)<br />

x<br />

k<br />

n<br />

= sin( nx ) Â<br />

k = 0<br />

= sin(n)x ¥ 2 n<br />

S = 2 n – 1 ¥ sin(n)x<br />

28. Let d be the common difference.<br />

So, a n–1<br />

= a + nd<br />

We have,<br />

n<br />

Â<br />

k = 0<br />

n<br />

Ck<br />

◊ a k + 1<br />

n<br />

C<br />

k

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

Saved successfully!

Ooh no, something went wrong!