Reccurence relation???

Algebra Level 4

I have a sequence a 1 , a 2 , a 3 . . . a_1,a_2,a_3... with a i > 0 a_i> 0 for every i 0 i\geq 0 . Let a 0 = 1 a_0=1 and a n 2 = a n 1 2 + 4 n ( n + 1 ) ( n + 2 ) a_{n}^{2}=a_{n-1}^{2}+4n(n+1)(n+2) for n 1 n\geq 1 . If S n = a 1 + a 2 + a 3 + . . . + a n S_n=a_1+a_2+a_3+...+a_n . Find S 20 S_{20} .


The answer is 3520.

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.

1 solution

Mark Hennings
Nov 7, 2019

It is a simple induction to show that a n = n 2 + 3 n + 1 a_n = n^2 + 3n + 1 for all nonnegative integers n n , so that S N = n = 1 N a n = 1 3 N ( N + 2 ) ( N + 4 ) S_N \; = \; \sum_{n=1}^N a_n \; = \; \tfrac13N(N+2)(N+4) for all positive integers N N , which makes S 20 = 3520 S_{20} = \boxed{3520} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...