n

Prove # (2 j "1) = n 2

j =1

A. State and prove the basis step.

1

We must prove P(1): (2 j 1) = 12

j =1

Proof:

1

j =1

j =1

(2 j 1) = 2(1) 1 = 1 and 12= 1, so (2 j 1) = 12

B. State the inductive step.

n

n+1

j=1

j=1

Prove " ( 2 j !1) = n 2 # " ( 2 j !1) = ( n +1)

C. Prove the proposition in the inductive step.

n

Assume n 1: (2 j 1) = n 2
j =1

Then
n+1

"(2 j !1)

j=1
n

= " ( 2 j !1) + 2 ( n +1) !1

j=1

= n 2 + 2n + 2 !1 (from inductive hypothesis)

= n 2 + 2n +1
= ( n +1)