Prove the principal of strong introduction: Let P(n) be the statement that is either true or false for each n N . Then P(n) is true for all n N provided that

a) P(1) is true, and

b) for each k N , P(j) is true for all integers j such that 1 j k, then P( k+1) is true.