Consider a sequence of 2016 real numbers a 1 , a 2 , a 3 , … , a 2 0 1 6 satisfying the property of 1 ≤ i ≤ 2 0 1 5 : a i = j = i + 1 ∑ 2 0 1 6 a j .
If i = 0 ∑ 2 0 1 4 ( ( 2 0 1 6 − i ) a i + 1 ) = 2 0 1 5 , we can express i = 1 ∑ 2 0 1 6 a i 1 as a b × c − a for positive integers a , b and c , compute a + b + c − 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.
I think that a better explanation of "what a i = j = i + 1 ∑ 2 0 1 6 a j exactly means" is that a 2 0 1 6 = a 2 0 1 5 = 2 1 a 2 0 1 4 = 4 1 a 2 0 1 3 = … .
I got the same answer as Saurabh Chaturvedi. I apologize for reporting this problem, but it seems that you haven't edit it.
The end result should be 3 . 2 2 0 1 5 − 2 .
@Saurabh Chaturvedi @Billy Sugiarto Thank you very much for correcting my solution.In future, if you spot any mistake/flaw in the problem please report the problem in the report's section.
Isn't the 2015th term equal to the 2016th term? It made me approach at a different result.
Log in to reply
You are correct, I forgot to use that and wrote the last term as 2 2 0 1 6 1 instead of 2 2 0 1 5 1 . Its surprising no one (except you) noticed this flaw in the problem :/
Log in to reply
I got the answer as 3.2^2015 - 2, which was far from the mentioned form in the problem.
Log in to reply
@Saurabh Chaturvedi – Can you explain how you got 3 × 2 2 0 1 5 − 2 ?
Log in to reply
@Nihar Mahajan – Sum of 2^i from 1 to 2015, plus 2^2015.
Log in to reply
@Saurabh Chaturvedi – I am getting this: 2 2 0 1 6 − 2 + 2 2 0 1 5 . Ok I need to go now, will look into this tomorrow.
Log in to reply
@Nihar Mahajan – It's the same thing.
2 2 0 1 6 − 2 + 2 2 0 1 5 = 2 2 0 1 5 ( 2 + 1 ) − 2 = 3 × 2 2 0 1 5 − 2
The flaw in the problem is very subtle. I just noticed that. The mistake was to forget that the closed form is valid only for 1 ≤ i ≤ 2 0 1 5 .
@Calvin Lin I think I forgot to tick for challenge master note, please provide it. Thanks!
Log in to reply
I think this is wrong, doesn't the first condition imply that a 2 0 1 5 = a 2 0 1 6 = 2 − 2 0 1 5 ?
So the sum should really be i = 1 ∑ 2 0 1 5 a i 1 + a 2 0 1 6 1 = i = 1 ∑ 2 0 1 5 2 i + 2 2 0 1 5 = 2 2 0 1 6 + 2 2 0 1 5 − 2
or is that wrong?
Log in to reply
No, you are correct. The problem is a bit flawed as of now.
I have corrected it. Thanks for spotting the mistake.
+1 for solution. ;)
Log in to reply
Thanks. Also congrats for solving this!
Awesome problem, +1!
Log in to reply
Thanks, you motivate me to post more problems :)
Interesting approach. +1
My approach was to note that a i = 2 2 0 1 5 − i a 2 0 1 6 ∀ 1 ≤ i ≤ 2 0 1 5 and then do some tedious algebra to solve for a 2 0 1 6 to obtain the complete closed form for a i and evaluate the final sum.
Log in to reply
Exactly, I also did those tedious calculations.
Same here... I also used a tedious approach +1
@Nihar Mahajan
Great solution.... I just used the tedious AGP Formula. Didn't realise that the summation within the boundary was equal to 2015. This would be a clever RMO question.
Nice problem and a great solution!
To begin with, let's prove the following statements.
For i = 2 0 1 5 we have a 2 0 1 5 = j = 2 0 1 6 ∑ 2 0 1 6 a j = a 2 0 1 6 = a 2 0 1 6 × 2 0 . Let's assume that the statement holds for i = k . Then a k − 1 = j = k ∑ 2 0 1 6 a j = a 2 0 1 6 × 2 2 0 1 5 − k + a 2 0 1 6 × 2 2 0 1 5 − ( k + 1 ) + … + a 2 0 1 6 × 2 + a 2 0 1 6 + a 2 0 1 6 = a 2 0 1 6 × ( 1 + ( 1 + + 2 + … + 2 2 0 1 5 − k ) ) = a 2 0 1 6 × 2 2 0 1 5 − ( k − 1 ) .
For x = 1 we have i = 1 ∑ 1 i × 2 1 − i = 1 = 2 1 + 1 − ( 1 + 2 ) . Let's assume that the statement holds for x = k . Then for x = k + 1 we have
i = 1 ∑ x i × 2 x − i = i = 1 ∑ k + 1 i × 2 k + 1 − i = 2 × i = 1 ∑ k i × 2 k − i + ( k + 1 ) × 2 0 = 2 × ( 2 k + 1 − ( k + 2 ) ) + k + 1 = = 2 ( k + 1 ) + 1 − ( ( k + 1 ) + 2 ) .
Applying ( 1 ) and ( 2 ) , we have
2 0 1 5 = i = 0 ∑ 2 0 1 4 ( ( 2 0 1 6 − i ) × a i + 1 ) = i = 0 ∑ 2 0 1 4 ( ( 2 0 1 6 − i ) × a 2 0 1 6 × 2 2 0 1 4 − i ) = a 2 0 1 6 × ( 2 0 1 6 × i = 0 ∑ 2 0 1 4 2 2 0 1 4 − i − i = 0 ∑ 2 0 1 4 i × × 2 2 0 1 4 − i ) = a 2 0 1 6 × ( 2 0 1 6 × ( 2 2 0 1 5 − 1 ) − ( 2 2 0 1 5 − 2 0 1 6 ) ) = a 2 0 1 6 × 2 0 1 5 × 2 2 0 1 5 .
Hence, a 2 0 1 6 = 2 − 2 0 1 5 .
FInally,
i = 1 ∑ 2 0 1 6 a i 1 = a 2 0 1 6 1 × ( 1 + ( 1 + 2 − 1 + … + 2 − 2 0 1 4 ) ) = 2 2 0 1 5 × ( 1 + 2 − 1 − 1 2 − 2 0 1 5 − 1 ) = 2 2 0 1 5 × ( 1 + 2 × ( 1 − 2 − 2 0 1 5 ) ) = = 2 2 0 1 5 × ( 3 − 2 − 2 0 1 4 ) = 2 2 0 1 5 × 3 − 2 .
Therefore, a + b + c − 1 = 2 + 2 0 1 5 + 3 − 1 = 2 0 1 9 .
Problem Loading...
Note Loading...
Set Loading...
First see what a i = j = i + 1 ∑ 2 0 1 6 a j exactly means. It means that the term a i equals the sum of the terms successive to a i in the sequence. So, if we let S = i = 1 ∑ 2 0 1 6 a i = S we get the following relations:
S S S … … … … S S = 2 a 1 = a 1 + 2 a 2 = a 1 + a 2 + 2 a 3 = a 1 + a 2 + a 3 + ⋯ + a 2 0 1 3 + 2 a 2 0 1 4 = a 1 + a 2 + a 3 + ⋯ + a 2 0 1 4 + 2 a 2 0 1 5
Let us sum all the 2 0 1 5 equations of s written above and we arrive at this equation:
2 0 1 5 S = 2 0 1 6 a 1 + 2 0 1 5 a 2 + 2 0 1 4 a 3 + ⋯ + 4 a 2 0 1 3 + 3 a 2 0 1 4 + 2 a 2 0 1 5
Note that the RHS above is nothing but i = 0 ∑ 2 0 1 4 [ ( 2 0 1 6 − i ) a i + 1 ] that equals 2 0 1 5 which is given.
So we have 2 0 1 5 S = 2 0 1 5 ⇒ S = 1
Substituting S = 1 in the above 2 0 1 5 equations, we can individually get all the terms in the sequence < a i > as 2 1 , 4 1 , 8 1 , … , 2 2 0 1 5 1 , 2 2 0 1 5 1 . Thus, we have a i = 2 i 1 .
Isn't this astonishing? So lets take reciprocal:: a i 1 = 2 i and we need to just sum it using geometric progression sum to get the answer:
i = 1 ∑ 2 0 1 5 2 i + 2 2 0 1 5 = 2 − 1 2 ( 2 2 0 1 5 − 1 ) + 2 2 0 1 5 = 2 2 0 1 5 − 2 + 2 2 0 1 5 = 3 × 2 2 0 1 5 − 2
So a + b + c − 1 = 2 + 2 0 1 5 + 3 − 1 = 2 0 1 9
credits to @Saurabh Chaturvedi @Billy Sugiarto for correct my solution!