1) For each counting number n let Sn := "Sigma(sub n) = (n(n+1))/2.

Prove that if n is a counting number, then Sn is true.

(The definition of counting number that we are using is meant to be a number in the minimal induction set. By the minimal induction set is meant an induction set no proper subset of which is an induction set.)