⎩ ⎪ ⎨ ⎪ ⎧ a 1 = 1 5 2 7 − 2 a 2 > 0 a k = 2 a k − 1 − a k − 2 for k = 3 , 4 , … , 1 1
Let a 1 , a 2 , … , a 1 1 be real numbers satisfying the conditions above. If 1 1 a 1 2 + a 2 2 + a 3 2 + ⋯ + a 1 1 2 = 9 0 , then find 1 1 a 1 + a 2 + a 3 + ⋯ + a 1 1 .
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.
From the characteristic equation of the linear recurrence, we can conclude that
a n = A n + B .
It remains to find these constants.
Very neat solution.Did the same way.
From a k = 2 a k − 1 − a k − 2 , it follows that a k − a k − 1 = a k − 1 − a k − 2 , which may be used to conclude that the given sequence is an Arithmetic Progression.
Let a − 5 d , a − 4 d , . . . , a , a + d , a + 2 d , . . . , a + 5 d be a 1 , a 2 , . . . , a 6 , a 7 , a 8 , . . . , a 1 1 respectively, so that 1 1 ∑ i = 1 1 1 a i 2 = 9 0 reduces to a 2 + 1 0 d 2 = 9 0 . And now, we need to find 1 1 ∑ i = 1 1 1 a i = a
Also a − 5 d = 1 5 , or a = 1 5 + 5 d . Solve the equation obtained in previous step for d .
And − 2 d = 2 a 1 − 2 a 2 = 3 0 − 2 a 2 = 3 + ( 2 7 − 2 a 2 ) > 3 can be used to eliminate one value of d to yield the single value d = − 3 .
Thus, a = 1 5 + 5 d = 0 .
Great solution
Problem Loading...
Note Loading...
Set Loading...
Using characteristic equation as mention by Challenge Master.
From the linear recurrence relation a k = 2 a k − 1 − a k − 2 , we have the characteristic equation x 2 − 2 x + 1 = 0 with repeated root of x = 1 and the general solution of a n = c 1 + c 2 n .
⟹ { a 1 = c 1 + c 2 = 1 5 a 2 = c 1 + 2 c 2 . . . ( 1 ) . . . ( 2 )
( 2 ) − ( 1 ) : a 2 − 1 5 ⟹ c 2 ( 1 ) : c 1 + a 2 − 1 5 ⟹ c 1 ⟹ a n = c 2 = a 2 − 1 5 = 1 5 = 3 0 − a 2 = 3 0 − a 2 + n ( a 2 − 1 5 ) = ( n − 1 ) a 2 − 1 5 ( n − 2 )
From a n = ( n − 1 ) a 2 − 1 5 ( n − 2 ) , we have:
n = 1 ∑ 1 1 a n 2 = n = 1 ∑ 1 1 [ ( n − 1 ) a 2 − 1 5 ( n − 2 ) ] 2 = n = 0 ∑ 1 0 [ n a 2 − 1 5 ( n − 1 ) ] 2 = n = 0 ∑ 1 0 [ ( a 2 − 1 5 ) 2 n 2 + 3 0 ( a 2 − 1 5 ) n + 2 2 5 ] = 6 1 0 ( 1 1 ) ( 2 1 ) ⋅ ( a 2 − 1 5 ) 2 + 2 1 0 ( 1 1 ) ⋅ 3 0 ( a 2 − 1 5 ) + 1 1 ( 2 2 5 ) = 1 1 ( 3 5 ( a 2 − 1 5 ) 2 + 1 5 0 ( a 2 − 1 5 ) + 2 2 5 )
Now, we have:
1 1 1 n = 1 ∑ 1 1 a n 2 3 5 ( a 2 − 1 5 ) 2 + 1 5 0 ( a 2 − 1 5 ) + 2 2 5 3 5 ( a 2 − 1 5 ) 2 + 1 5 0 ( a 2 − 1 5 ) + 1 3 5 7 ( a 2 − 1 5 ) 2 + 3 0 ( a 2 − 1 5 ) + 2 7 ( 7 ( a 2 − 1 5 ) + 9 ) ( a 2 − 1 5 + 3 ) ( 7 a 2 − 9 6 ) ( a 2 − 1 2 ) ⟹ a 2 = 9 0 = 9 0 = 0 = 0 = 0 = 0 = 1 2
a 2 = 7 9 6 does not satisfy the condition 2 7 − 2 a 2 > 0 .
Therefore, a n = 1 2 ( n − 1 ) − 1 5 ( n − 2 ) = 1 8 − 3 n , ⟹ n = 1 ∑ 1 1 a n = 1 5 + 1 2 + 9 + 6 + 3 + 0 − 3 − 6 − 9 − 1 2 − 1 5 = 0 ⟹ 1 1 1 n = 1 ∑ 1 1 a n = 0 .