To determine the possible values that the sum Sn=∑k=14n(−1)2k(k+1)k2 can take, we first analyze the sign pattern of (−1)2k(k+1) for values of k:
-
For k=4m+1:
2k(k+1)=2(4m+1)(4m+2)=(4m+1)(2m+1)⟹odd⟹(−1)2k(k+1)=−1
-
For k=4m+2:
2k(k+1)=2(4m+2)(4m+3)=(2m+1)(4m+3)⟹odd⟹(−1)2k(k+1)=−1
-
For k=4m+3:
2k(k+1)=2(4m+3)(4m+4)=(4m+3)(2m+2)⟹even⟹(−1)2k(k+1)=+1
-
For k=4m+4:
2k(k+1)=2(4m+4)(4m+5)=(2m+2)(4m+5)⟹even⟹(−1)2k(k+1)=+1
Thus, the sign pattern repeats every 4 terms as −1,−1,+1,+1.
We can group the terms of the sum into n blocks, each containing 4 consecutive terms for m=0,1,2,…,n−1:
Tm=−(4m+1)2−(4m+2)2+(4m+3)2+(4m+4)2
Simplifying Tm:
Tm=[(4m+3)2−(4m+1)2]+[(4m+4)2−(4m+2)2]
Tm=(4m+3−4m−1)(4m+3+4m+1)+(4m+4−4m−2)(4m+4+4m+2)
Tm=2(8m+4)+2(8m+6)=16m+8+16m+12=32m+20
Now, summing Tm from m=0 to n−1:
Sn=∑m=0n−1(32m+20)
Sn=32∑m=0n−1m+∑m=0n−120
Sn=32⋅2(n−1)n+20n
Sn=16n(n−1)+20n=16n2+4n=4n(4n+1)
Now we test the given options to check for integer values of n≥1:
-
Option (A): 1056
4n(4n+1)=1056⟹4n2+n−264=0
The discriminant is Δ=12−4(4)(−264)=1+4224=4225=652.
n=8−1+65=8
Since n=8 is a positive integer, Sn can equal 1056.
-
Option (B): 1088
4n(4n+1)=1088⟹4n2+n−272=0
The discriminant is Δ=12−4(4)(−272)=1+4352=4353, which is not a perfect square. Thus, no integer solution exists.
-
Option (C): 1120
4n(4n+1)=1120⟹4n2+n−280=0
The discriminant is Δ=12−4(4)(−280)=1+4480=4481, which is not a perfect square. Thus, no integer solution exists.
-
Option (D): 1332
4n(4n+1)=1332⟹4n2+n−333=0
The discriminant is Δ=12−4(4)(−333)=1+5328=5329=732.
n=8−1+73=9
Since n=9 is a positive integer, Sn can equal 1332.
Therefore, the correct options are A and D.