This preview shows page 1. Sign up to view the full content.
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 A-B = , then A = B . 6. (10 points) Suppose P (1) ,P (2) ,P (3) ,... is an innite 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
This note was uploaded on 01/27/2010 for the course MATH 347 taught by Professor ? during the Spring '09 term at University of Illinois at Urbana–Champaign.
- Spring '09