Unformatted text preview: (a) For all functions f : R → R , if f is bounded, then h ( x ) = ( f ( x )) 2 is bounded. (b) For all sets A and B , if AB = ∅ , then A = B . 6. (10 points) Suppose P (1) ,P (2) ,P (3) ,... is an inﬁnite sequence of statements. Also, suppose that for all n ∈ N , if P ( n ) and P ( n + 1), then P ( n + 5) (think of this as an inductive step). What statements need to be proved in a base step in order to conclude that P ( n ) is true for all n ? Explain your reasoning....
View
Full Document
 Spring '09
 ?
 Math, Logic, Inductive Reasoning

Click to edit the document details