Analyzing the Setup
Welcome, future engineer! Today, we are performing a mathematical autopsy on a sequence. We are given the sum of the first n terms of an Arithmetic Progression as Sn=cn2.
Our mission is to find the sum of the squares of these terms. Think of Sn as the total weight of a stack of bricks; we need to isolate the weight of each individual brick to square them.
We use the fundamental bridge: Tn=Sn−Sn−1. By subtracting the sum of the first n−1 terms from the total sum of n terms, we isolate the very last term, Tn.
The Transformation
From Sum to Term
Let us perform the algebra. We have Sn=cn2, which implies Sn−1=c(n−1)2.
Substituting these into our bridge equation, we get:
Expanding the square, we have Tn=cn2−c(n2−2n+1). The cn2 terms cancel out, leaving us with:
This linear expression is our general term and holds the key to everything that follows.
The Summation
Setting the Stage
Now, we need the sum of the squares of these terms, denoted as ∑r=1nTr2. Substituting our general term, this becomes:
We can pull the constant c2 outside the summation:
We distribute the summation operator across three distinct, manageable parts:
c2[4r=1∑nr2−4r=1∑nr+r=1∑n1]
The Algebraic Dance
The Grand Finale
Now, we invoke our standard summation identities:
∑r2=6n(n+1)(2n+1), ∑r=2n(n+1), and ∑1=n.
Substituting these into our expression, we get:
c2[46n(n+1)(2n+1)−42n(n+1)+n]
Simplifying the fractions, we have:
c2[32n(n+1)(2n+1)−2n(n+1)+n]
To make this cleaner, we factor out 3n:
3c2n[2(n+1)(2n+1)−6(n+1)+3]
Expanding the terms inside the bracket gives 2(2n2+3n+1)−6n−6+3, which simplifies to 4n2+6n+2−6n−3. The 6n and −6n terms cancel out, leaving us with 4n2−1.
The final result is:
You have just conquered a classic JEE Advanced problem. Remember, the complexity is just a mask; the underlying structure is always elegant.