Find the value of S as defined below:
S = 1 + 1 0 2 + 1 0 2 3 + 1 0 3 1 0 + 1 0 4 2 2 + 1 0 5 5 1 + 1 0 6 1 2 5 + 1 0 7 2 9 3 + ⋯
Enter 0.6666 if you come to the conclusion that the series fails to converge. Enter your Answer upto 4 decimal places
Note: The numerators follow the pattern T n + 3 = T n + 2 + 2 T n + 1 + 3 T n .
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.
sir, Is it easy to figure out the recursion relation ?
Log in to reply
That was the harder part! Based on your last problem, I assumed (well, hoped) that you might have used a linear recursion involving the three preceding terms.
Another fun problem!
The exact value is 1 0 9 0 / 8 7 7 .
Problem Loading...
Note Loading...
Set Loading...
The numerators satisfy the recursion a n + 3 = a n + 2 + 2 a n + 1 + 3 a n for n > 0 . The generating function is found to be ∑ n = 1 ∞ a n x n = 1 − 3 x 3 − 2 x 2 − x 1 + x − x 2 for ∣ x ∣ < 0 . 4 2 . For x = 1 0 1 the value is ≈ 1 . 2 4 2 8