Suppose a 1 , a 2 , … , a 2 0 0 are integers arranged on a circle such that a n = 2 a n − 1 + a n + 1 and n = 1 ∑ 1 0 0 a 2 n = 1 2 3 4 . Find the value of n = 1 ∑ 2 0 0 a 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.
Or just notice that a 1 = a 2 = ⋯ = a 2 0 0 .
Log in to reply
Shortest method.I think nothing could be better than this observation.Thanks.
U p v o t e d ! ! ! !
In this case, a solution is impossible. Setting a(1)=x and a(2)=y gives a(n) = (n-1)x - (n-2)y by induction. This also gives the sum from 1 to 100 of a(2n) as 10000x - 9900y. x and y are integers, as a(1) and a(2) are stated to be integers in the question. This means that the sum divides through by 100 to give the integer 100x - 99y. 1234 does not divide by 100, so either the sum cannot equal 1234, or the restriction of a(n) to integers in the question should be removed.
Problem Loading...
Note Loading...
Set Loading...
It is very clear to get the expresses: a 2 = 2 a 1 + a 3 a 4 = 2 a 3 + a 5 . . . a 2 0 0 = 2 a 1 9 9 + a 1 → ( a 2 + … a 2 0 0 ) = a 1 + a 3 + … + a 1 9 9 S U M = 1 2 3 4 × 2 = 2 4 6 8