MHB Finding the Value of $S_n$: A Summation Problem

  • Thread starter Thread starter Saitama
  • Start date Start date
  • Tags Tags
    Summation Value
Saitama
Messages
4,244
Reaction score
93
Let

$$\Large S_n=\sum_{k=1}^{4n} (-1)^{\frac{k(k+1)}{2}}k^2$$

Then $S_n$ can take the value(s)

A)1056

B)1088

C)1120

D)1332
 
Mathematics news on Phys.org
Pranav said:
Let

$$\Large S_n=\sum_{k=1}^{4n} (-1)^{\frac{k(k+1)}{2}}k^2$$

Then $S_n$ can take the value(s)

A)1056

B)1088

C)1120

D)1332

[sp]Writing the first terms You obtain...

$\displaystyle S_{n} = -1 -4 + 9 + 16 - 25 - 36 + 49 + 64 - 81 - 100 + 121 + 144 +... = 8 + 12 + 24 + 28 + 40 + 44 + ... =$

$\displaystyle = 20\ n + 32\ \frac{n\ (n - 1)}{2} = 16\ n^{2} + 4\ n\ (1)$

... and for n=8 is $S_{8} = 1056$ and n=9 is $S_{9}= 1332$...[/sp]

Kind regards

$\chi$ $\sigma$
 
Last edited:
\begin{align}
S_n &= \sum_{k=1}^{4n} (-1)^{\frac{k(k+1)}{2}} k^2 \\
&= \sum_{k=1}^n [ (-1)^{\frac{(4k-3)(4k-2)}{2}} (4k-3)^2 +
(-1)^{\frac{(4k-2)(4k-1)}{2}} (4k-2)^2 +
+(-1)^{\frac{(4k-1)(4k)}{2}} (4k-1)^2 +
(-1)^{\frac{(4k)(4+1)}{2}} (4k)^2 ] \\
&= \sum_{k=1}^n [ -(4k-3)^2 +
-(4k-2)^2
+(4k-1)^2
+(4k)^2 ] \\
&= \sum_{k=1}^n [ -(16k^2 - 24k + 9) - (16k^2 - 16k + 4) + (16k^2 - 8k + 1) + 16k^2] \\
&= \sum_{k=1}^n [ 32k - 12] \\
&= 16n(n+1)-12n
\end{align}

Enumerate through a few $n$, we find that (a) and (d) are possible values (for $n=8$ and $n=9$ respectively).

Instead of enumerating through $n$, we can also just spot check each answer.
We can actually do better to find all $X$ that this will work for: $16n^2 + 4n = X$. So the quadratic equation
would be $16n^2 - 4n - X = 0$. The discriminant $\Delta = 16+64X$ has to be a perfect square.

Note that when $X = 1056$, $\Delta = 260^2$ and when $X = 1332$, then $\Delta = 292^2$.
 
Last edited:
chisigma said:
[sp]Writing the first terms You obtain...

$\displaystyle S_{n} = -1 -4 + 9 + 16 - 25 - 36 + 49 + 64 - 81 - 100 + 121 + 144 +... = 8 + 12 + 24 + 28 + 40 + 44 + ... =$

$\displaystyle = 20\ n + 32\ (n - 1) = 52 n - 32\ (1)$

... so that $S_{n} - 32$ must divide 52 and that happens for 1332 because $\displaystyle \frac{1300}{52} = 25$...[/sp]

Kind regards

$\chi$ $\sigma$

magneto said:
\begin{align}
S_n &= \sum_{k=1}^{4n} (-1)^{\frac{k(k+1)}{2}} k^2 \\
&= \sum_{k=1}^n [ (-1)^{\frac{(4k-3)(4k-2)}{2}} (4k-3)^2 +
(-1)^{\frac{(4k-2)(4k-1)}{2}} (4k-2)^2 +
+(-1)^{\frac{(4k-1)(4k)}{2}} (4k-1)^2 +
(-1)^{\frac{(4k)(4+1)}{2}} (4k)^2 ] \\
&= \sum_{k=1}^n [ -(4k-3)^2 +
-(4k-2)^2
+(4k-1)^2
+(4k)^2 ] \\
&= \sum_{k=1}^n [ -(16k^2 - 24k + 9) - (16k^2 - 16k + 4) + (16k^2 - 8k + 1) + 16k^2] \\
&= \sum_{k=1}^n [ 32k - 12] \\
&= 16n(n+1)-12n
\end{align}

Enumerate through a few $n$, we find that (a) and (d) are possible values (for $n=8$ and $n=9$ respectively).

Instead of enumerating through $n$, we can also just spot check each answer.
We can actually do better to find all $X$ that this will work for: $16n^2 + 4n = X$. So the quadratic equation
would be $16n^2 - 4n - X = 0$. The discriminant $\Delta = 16+64X$ has to be a perfect square.

Note that when $X = 1056$, $\Delta = 260^2$ and when $X = 1332$, then $\Delta = 292^2$.

Thank you both for your participation, your answers are correct! :)

chisigma, you missed one of the answers. :p
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top