The Symphony of Sequences
Unlocking the Alternating Sum
Welcome, future engineer. Today, we aren't just solving a problem; we are peeling back the layers of an arithmetic progression to reveal a hidden, elegant structure.
When you first look at the expression for Ak:
Ak=a12−a22+a32−a42+⋯+a2k−12−a2k2
It might look like a chaotic mess of squares. But in the world of JEE Advanced, chaos is just order waiting to be discovered.
Phase 1
The Power of Pairing
Imagine you are standing before this series. Your instinct might be to expand every term, but that is a trap. Instead, look at the pairs: (a12−a22), (a32−a42), and so on.
Does this remind you of something? It is the classic difference of squares identity: x2−y2=(x−y)(x+y).
When we apply this to our series, each pair transforms. Since we are dealing with an arithmetic progression where the common difference is d, we know that ai+1−ai=d. Therefore, ai−ai+1=−d.
Suddenly, the complexity collapses. Each pair becomes −d(ai+ai+1). We have successfully linearized the problem!
Phase 2
The General Term Transformation
Now, we move to the summation. We have:
Ak=−di=1∑k(a2i−1+a2i)
This looks much friendlier, doesn't it? We know the general term of an AP is an=a1+(n−1)d.
Let's substitute this into our sum. The term a2i−1 becomes a1+(2i−2)d, and a2i becomes a1+(2i−1)d. Adding them together, we get 2a1+(4i−3)d.
Don't let the summation notation intimidate you. We are simply summing 2a1 and (4i−3)d from i=1 to k.
The sum of 2a1 is simply 2ka1. The sum of (4i−3) is a standard arithmetic series sum, which simplifies to k(2k−1). Putting it all together, we arrive at our master formula:
This is the 'DNA' of our series.
Phase 3
Solving the System
With our formula in hand, the problem becomes a game of substitution. We are given A3=−153 and A5=−435. By plugging k=3 and k=5 into our formula, we generate a system of two equations.
Subtracting these equations is where the magic happens. The 2a1d terms cancel out, leaving us with 4d2=36. This gives us d2=9.
Since the problem guarantees positive terms, we confidently choose d=3. Substituting this back, we find a1=1. We have cracked the code!
Phase 4
The Final Victory
We verify our findings with the condition a12+a22+a32=66. With a1=1 and d=3, our terms are 1,4,7. Indeed, 12+42+72=1+16+49=66. It fits perfectly.
Finally, we calculate a17−A7. We find a17=a1+16d=1+48=49.
Using our formula for A7, we get:
A7=−7(3)[2(1)+(13)(3)]=−21[2+39]=−21(41)=−861
The final step is a simple subtraction: 49−(−861)=910.
See? What started as a terrifying series of squares ended as a beautiful, logical progression. You didn't just solve a problem; you mastered the pattern. The final answer is 910.