Due: Nov 17th at the start of class

Homework #10
CMSC250 - Fall 2010 PRINT Name
Mark your section : 0101 / 0102 / 0201 / 0202 / 0301 / 0302
o Grades depend on neatness and clarity. o Write your answers with enough detail about your approach and concepts used, so that the grader will be able to understand it easily. o Write your answers in the spaces provided. If needed, attach other pages.

1. Function and are defined by the following arrow diagram. Find and and determine whether they equal each other:

g is the constant function g=1, so gof is also the constant 1. But fog (x) = f(1)=5. So gof =/= fog 2. Let ( ) = and = 1/5 for all real numbers x. Does equal ? Why? Each real number has only one fifth root, so F and G are inverse functions that simply undo whatever the other does: FoG (x) = GoF(x) = x. Thus the two compositions are equal. 3. Let 25Z be the set of all integers that are multiples of 25. Prove that 25Z has the same cardinality as 2Z, the set of all even integers. We define a function f:25Z2Z as follows: f(25n) = 2n. Then f is 1-1 and onto. Here is what really happens: f(m) = 2m/25 which is an even number since m has the form 25n. 4. a) Give an example of a function from Z to Z that is onto but not one-to-one. For n even, let f(n) = n/2; this already makes f onto. And for n odd, let f(n)=0 (so all the odds as well as 0 aer sent to 0 by f).

b) Give an example of function from Z to Z that is one-to-one but not onto. For n negative let f(n) = 2|n|, and for n positive or zero, let f(n) = 2n+1. Then f is never neg or 0, so not onto. Yet it is 1-1; diff neg ns give diff even f values; and diff pos ns give diff odd values. 5. [Prob. 11, p. 449] Let ={3,4,5} and ={4,5,6} and let be the divides relation. That is, for all , , | . State explicitly which ordered pairs are in and 1. Recall that R^-1 means R inverse, the reversed pairs in the relation R. SO S = {(3,6), (4,4,(=), (5,5)} and S inverse = {(6,3), (4,4), (5,5)} 6. [Prob. 34-42, p. 460] Assume that and are relations on a set . Prove or disprove each statement. a) If is reflexive, then 1 is reflexive. Reflexive means xRx for each x; so yes, R inverse is reflexive if R is: xRx iff xRx b) If is symmetric, then 1 is symmetric. Yes: If xRy implies yRx, and if a R^-1 b, then b R a and so a R b and so b r&^-1 a. c) If is transitive, then 1 is transitive. Yes: if xRy and yRx means xRz; then if aR^-1 b and b r^-1 c, that means bRa and cRb, so cRa. d) If and are reflexive, is reflexive. Yes; xRx and xSx both hold e) If and are symmetric, is symmetric. Yes; if xRy implies yRx, and aSb implies bSa, then c RintS d implies cRd and cSd so also c RintS d f) If and are transitive, is transitive.

Yes: a RintS b and b RintS c mean aRb and bRc (so aRc) and similarly AsC, so A RintS c. 7. [Prob. 19-31, p. 477] For each of the following, (I) prove that the relation is an equivalence relation, and (II) describe the distinct equivalence classes of each relation. a) Define on the set as follows: For all ( , ), , , , , = . nd Here two pairs are related if their 2 elts are the same (equal). But this clearly is symm,trans, and refl. So it is an equiv rel. The equiv classes (partition subsets) are just the sets of pairs {(w,x)| w in R} for each indiv real x. Thus {(w,1) | w in R}, {(w,-5)| w in R}, etc. b) is a relation defined on as follows: For all , , 4|( ). F is just the relation m cong n mod 4, and we know that is an equiv rel. Its classes are the four sets 4Z, 4Z+1, 4z+2, and 4Z+3. c) Let be a set of parts shipped to a company from various suppliers. is a relation defined on as follows: For all , , has the same part number and is shipped from the same supplier as . Clearly xSx since x has the same part number as itself, etc. Similarly if x and y, and y and z, have the samne #s, so do x and z. Etc. The partition (equiv) classes are the sets of parts that have the same number and are from the same supplier. For instance, the set {x|x has # 12904 and is from supplier ABC} is one equiv class (it is one of the partition subsets).