A sequence { a n } satisfies a 1 = 1 and n + 2 a n + 1 = n a n + 2 1 for all natural numbers n .
Let S = 3 1 + 4 1 + 5 1 + ⋯ + 1 0 2 1 .
Find the value of a 1 0 3 − 5 3 5 6 S .
This problem has been modified by me, and is a part of <Grade 11 CSAT Mock test> series .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
What is meant by adding "sides by sides"? Also I'm not understanding how u got that step just after adding sides by sides...can u please elaborate it little bit and give?
Log in to reply
b 2 = b 1 + 2 ⋅ 2 1 b 3 = b 2 + 2 ⋅ 3 1 b 4 = b 3 + 2 ⋅ 4 1 b 5 = b 4 + 2 ⋅ 5 1 . . . b k = b k − 1 + 2 ⋅ k 1
Add them all, and you get
b 2 + b 3 + b 4 + ⋯ + b k = b 1 + b 2 + b 3 + ⋯ b k − 1 + 2 1 ( 2 1 + 3 1 + 4 1 + ⋯ + k 1 )
Now we can eliminate b 2 + b 3 + b 4 + ⋯ + b k − 1 from each side.
b k = b 1 + 2 1 ( 2 1 + 3 1 + 4 1 + ⋯ + k 1 ) .
Log in to reply
Oh, ok... Thanks a lot! Great solution, though!
Problem Loading...
Note Loading...
Set Loading...
Divide both sides by n + 1 and you see that
( n + 1 ) ( n + 2 ) a n + 1 = n ( n + 1 ) a n + 2 ( n + 1 ) 1 .
Then define n ( n + 1 ) a n = b n .
b n + 1 = b n + 2 ( n + 1 ) 1 , and b 1 = 2 a 1 = 2 1 .
Substitute n = 1 , 2 , 3 , ⋯ , k − 1 and then add them sides by sides.
b k = b 1 + 2 1 ( 2 1 + 3 1 + 4 1 + ⋯ + k 1 ) = 2 1 ( 1 + 2 1 + 3 1 + ⋯ + k 1 ) ( k ≥ 2 )
We see that this also holds for k = 1 , as b 1 = 2 1 .
Therefore,
a n = n ( n + 1 ) b n = 2 n ( n + 1 ) ( 1 + 2 1 + 3 1 + ⋯ + n 1 ) .
a 1 0 3 = 2 1 0 3 × 1 0 4 ( 1 + 2 1 + 3 1 + ⋯ + 1 0 3 1 ) = 5 3 5 6 ( 1 + 2 1 + S + 1 0 3 1 )
∴ a 1 0 3 − 5 3 5 6 S = 5 3 5 6 ( 1 + 2 1 + 1 0 3 1 ) = 5 3 5 6 + 2 6 7 8 + 5 2 = 8 0 8 6 .