Search the corpus

    Alternating sum of squares $1^2-2^2+\cdots+(-1)^{n-1}n^2$

    P-S07IN

    Area
    Prelim
    Topics
    Induction
    Seen at
    UGA
    Years
    2007
    Status
    draft

    Using mathematical induction, show that for each positive integer \(n\), \[1^2 - 2^2 + 3^2 - \dots + (-1)^{n-1}n^2 = (-1)^{n-1}n(n+1)/2.\] (Hint: in the induction step, consider separately the cases where \(n\) is even or odd.)

    <1>2. The formula holds for \(n=1\).

    <1>3. Assume the formula holds for some \(n\ge1\). Then it also holds for \(n+1\).

    <1>4. Therefore \[ 1^2-2^2+\cdots+(-1)^{n-1}n^2 =(-1)^{n-1}\frac{n(n+1)}2 \] for every positive integer \(n\).

    Solution

    1. Let\[ S_n=1^2-2^2+3^2-\cdots+(-1)^{n-1}n^2. \]We prove by induction that\[ S_n=(-1)^{n-1}\frac{n(n+1)}2 \]for every \(n\ge1\).

    We have \[ S_1=1=(-1)^0\frac{1\cdot2}{2}. \]

    By the induction hypothesis, \[ \begin{aligned} S_{n+1} &=S_n+(-1)^n(n+1)^2\\ &=(-1)^{n-1}\frac{n(n+1)}2+(-1)^n(n+1)^2\\ &=(-1)^n(n+1)\left(-\frac n2+n+1\right)\\ &=(-1)^n\frac{(n+1)(n+2)}2. \end{aligned} \] This is exactly the required formula with \(n\) replaced by \(n+1\).

    This follows from 2 and 3 by mathematical induction.