Math 320 Exam 3 Answers 1. Let f : N N be the function dened below: f (n) = n2 + n, Prove that f is one-to-one.

. Reminder: N = {1, 2, 3, . . .} is the set of natural numbers. SOLUTION: Let a, b be natural numbers and suppose that f (a) = f (b). Then a2 + a = b 2 + b a2 b 2 + a b = 0 (a b)(a + b + 1) = 0.

December 3, 2012 W. Watkins

Therefore, either a b = 0 or a + b + 1 = 0. The second possibility is impossible because both a and b are positive. Thus a b = 0 and so a = b. This proves that f is one-to-one. 2nd SOLUTION by J. Limbacher: Suppose f (a) = f (b) for a, b N. Then a2 + a = b2 + b and thus a2 b2 = b a. But a2 b2 equals b a only if b = a, because if b > a > 0, then a2 b2 is negative and b a is positive. And if 0 < b < a then a2 b2 is positive and b a is negative, which is a contradiction, so a = b. 2. Let f : [ 1 , ) [0, ) be dened by f (x) = 2 [0, ). SOLUTION: We must show that for every y [0, ), there exists an x [ 1 , ) such that f (x) = y. So 2 2 +1 let y be a real number with y 0. Let x = y 2 . Then x 1 since y 2 0. Now 2 f (x) = f But y2 + 1 2 = 2 y2 + 1 2 1= y2. 2x 1. Prove that f maps [ 1 , ) onto 2

y 2 = y since y 0. Therefore f (x) = y. This proves that f maps [ 1 , ) onto [0, ). 2

3. Let f : (, 1) (1, ) R be dened by f (x) = 2x 1 . x+1

Show that f does not map (, 1) (1, ) onto R. SOLUTION: The real number y = 2 is not in the range of f (x). Proof by contradiction. Suppose there exists x (, 1) (1, ) such that f (x) = 2. Then 2(x + 1) = 2x 1, which is impossible. 4. Write the permutation = (1354)(246) S6 in table notation and in disjoint cycle notation. Notice that the two cycles above are not disjoint. SOLUTION: Writing the two cycles in table notation, we have (1354) = Now compute = 1 2 3 4 5 6 3 2 5 1 4 6 1 2 3 4 5 6 1 4 3 6 5 2 = 1 2 3 4 5 6 3 1 5 6 4 2 = (135462). 1 2 3 4 5 6 3 2 5 1 4 6 and (246) = 1 2 3 4 5 6 1 4 3 6 5 2 .

5. What is the maximum order for a permutation in S7 ? Give an example of a permutation in S7 with the maximum order. SOLUTION: The permutations in S7 have cycle lengths that sum to 7. Among those, the cycle structure whose lengths have the least least common multiple (LCM) is a 4-cycle and a 3-cycle with an LCM of 12. Therefore the maximum order for a permutation in S7 is 12. One such permutation that achieves this maximum is = (1234)(567).

6. Let = (1682)(34)(57) S8 . Write the following permutations in (disjoint) cycle notation: a. 1 b. 3 SOLUTION: 1 = 3 = (1286)(34)(57). 7. Set S and T be sets and R a subset of S T . a. Dene what it means for R to be a function from S into T . SOLUTION: R is a function if for every s S there exists t T such that (s, t) R. if (a, b) R and (a, c) R, then b = c. b. Let S = {n2 : n Z} and T = {2n + 1 : n Z}. Consider the subset R of S T described below: R = {(n2 , 2n + 1) : n Z}. Is R a function? Prove that R is a function from S into T or give a counterexample. SOLUTION:R is not a function. Set n = 1 to get (1, 3) R. Set n = 1 to get (1, 1) R. So (1, 3) R and (1, 1) R. But 3 = 1.