Jump to content

Induction/Alternating sum of squares/Exercise/Solution

From Wikiversity

Initial step. For n=1 we have on the left hand side only the summand for k=2, which is

(1)012=1.

On the right hand side we also have

(1)2122=1.

Induction step. Suppose that the statement ist already proven for n, we have to show that it is also true for n+1. We have

k=1n+1(1)k1k2=k=1n(1)k1k2+(1)n(n+1)2=(1)n+1n(n+1)2+(1)n+2(n+1)(n+1)=(1)n+2n(n+1)2+(1)n+22(n+1)(n+1)2=(1)n+2n(n+1)+2(n+1)(n+1)2=(1)n+2(n+1)(n+2n+2)2=(1)n+2(n+1)(n+2)2.

Thus the statement holds for all n.