Math 347 C1

HOUR EXAM I
27 June 2013 SOLUTIONS 1. Let f : N N R be dened by f (a, b) = (a + 1)(a + 2b) . 2

Show that the image of f is a subset of N . SOLUTION a+2b) We must show that (a+1)( is a natural number. 2 If a is even, then there is a natural number r such that a = 2r. Hence (a + 1)(a + 2b) (2r + 1)(2r + 2b) = = (2r + 1)(r + b) N. 2 2 If a is odd, then there is a natural number s such that a = 2s + 1. Hence (a + 1)(a + 2b) (2s + 2)(2s + 1 + 2b) = = (s + 1)(2s + 1 + 2b) N. 2 2 2. Let P (x) be the statement that x is odd. Let Q(x) be the statement that x2 1 is a multiple of 8. Determine which of the following is true and prove your answers. a) (x Z )(P (x) Q(x)). b) (x Z )(Q(x) P (x)). SOLUTION a) If x is odd, then x = 2r + 1, for some r N . Then x2 1 = (2r + 1)2 1 = 4r2 + 4r + 1 1 = 4r2 + 4r = 4(r2 + r) = 4r(r + 1). Since r and r + 1 are consecutive natural numbers, one of then must be even. Hence x2 1 is a multiple of 8 and statement a) is true. b) We will show that b) is true by examining its contrapositive: If x is even, then x2 1 is not a multiple of 8. For if x is even, then x2 is even and so x2 1 is odd and therefore is not a multiple of 8. 3. For n N, n 2, nd and prove a formula for
n

(1
i=2

1 ). i2

SOLUTION Note that

i2 1 (i 1)(1 + i) 1 ) = = . 2 2 i i i2 Consider the rst 5 terms of the product: (1 13 4 24 9 35 16 46 25 57 36

Notice that each denominator, k 2 , from the second factor on is cancelled by a factor of k from the previous and the following numerators. Hence the product above is 1 7 1 n+1 . 2 6 . Thus, a likely guess for the product is 2 n We will try to prove that
n

P (n) : by induction on n, n 2. If n = 2, then the LHS = 1 Now let

(1
i=2

1 1 n+1 )= 2 i 2 n

1 i2 k

=1 (1

1 22

3 4

and the RHS =

1 2

n+1 n

=3 4.

i=2

1 1 k+1 ) = i2 2 k

and multiply both sides by 1 Thus we get

k+1 k

1 (k+1)2 .

1 1 (1 2 ) = 1 i (k + 1)2 i=2

(1
i=2

1 1 1 k+1 1 k+2 = . ) = 1 2 2 i (k + 1) 2 k 2 k+1

The equation of the left-most term = the right-most term is P (k + 1) and thus P (k ) P (k + 1) and the result follows from the Theorem of Mathematical Induction. 4. Let f : A B and g : B A be functions. Prove: If f g is the identity function on B , then f is surjective. Prove: If g f is the identity function on A, then f is injective. (Recall that the function h : C C is called the identity function on C , if h(c) = c for all c C.)

SOLUTION Let f g be the identity function on B , i.e., (f g )(y ) = y for all y B. Let b B. Then (f g )(b) = b and f (g (b)) = b. Therefore given an arbitrary element b of B we have produced the element g (b) A such that f (g (b)) = b. Therefore f is surjective. Now let a1 , a2 A and assume that f (a1 ) = f (a2 ). Then (g f )(a1 ) = g (f (a1 )) = (g f )(a2 ) = g (f (a2 )). But g f is the identity function and thus a1 = (g f )(a1 ) = (g f )(a2 ) = a2 . Hence a1 = a2 and f is injective.