#$&* course math 151 005. Infinite Sets
.............................................
Given Solution: This correspondence can be written [ 1 <--> 1, 2 <--> 3, 3 <--> 5, ... ]. &&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& Self-critique (if necessary):ok ------------------------------------------------ Self-critique Rating: ********************************************* Question: `q002. Writing [ 1 <--> 1, 2 <--> 3, 3 <--> 5, ... ] for the correspondence between { 1, 2, 3, ... } and { 1, 3, 5, ... } isn't bad, but the pattern here might be a bit less clear to the reader than the correspondence [ 1 <--> 2, 2 <--> 4, 3 <--> 6, ... ] given for { 1, 2, 3, ... } and { 2, 4, 6, ... }. That is because in the latter case it is clear that we are simply doubling the numbers in the first set to get the numbers in the second. It might not be quite as clear exactly what the rule is in the correspondence [ 1 <--> 1, 2 <--> 3, 3 <--> 5, ... ], except that we know we are pairing the numbers in the two sets in order. Without explicitly stating the rule in a form as clear as the doubling rule, we can't be quite as sure that our rule really works. How might we state the rule for the correspondence [ 1 <--> 1, 2 <--> 3, 3 <--> 5, ... ] as clearly as the 'double-the-first-number' rule for [ 1 <--> 2, 2 <--> 4, 3 <--> 6, ... ]? YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY Your solution: Double the first number and subtract that number by 1 confidence rating #$&*: ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
.............................................
Given Solution: We might say something like 'choose the next odd number'. That wouldn't be too bad. Even clearer would be to note that the numbers 1, 3, 5, ... are each 1 less than the 'double-the-counting-number' numbers 2, 4, 6. So our rule could be the 'double-the-first-number-and-subtract-1' rule. If we double each of the numbers 1, 2, 3, ... and subtract 1, we get 1, 3, 5, ... . &&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& Self-critique (if necessary): ------------------------------------------------ Self-critique Rating: ********************************************* Question: `q003. The 'double-the-number' rule for the correspondence [ 1 <--> 2, 2 <--> 4, 3 <--> 6, ... ] could be made even clearer. First we we let n stand for the nth number of the set {1, 2, 3, ... }, like 10 stands for the 10th number, 187 stands for the 187th number, so whatever it is and long as n is a counting number, n stands for the nth counting number. Then we note that the correspondence always associates n with 2n, so the correspondence could be written0 [ 1 <--> 2, 2 <--> 4, 3 <--> 6, ... , n <--> 2n, ... ]. This tells us that whatever counting number n we choose, we will associate it with its double 2n. Since we know that any even number is a double of the counting number, of the form 2n, this rule also tells us what each even number is associated with. So we can argue very specifically that this rule is indeed a 1-to-1 correspondence. In terms of n, how would we write the rule for the correspondence [ 1 <--> 1, 2 <--> 3, 3 <--> 5, ... ]? YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY Your solution: Again, double the number and subtract 1 confidence rating #$&*: ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
.............................................
Given Solution: The rule for this correspondence is 'double and subtract 1', so n would be associated with 2n - 1. The correspondence would thus be [ 1 <--> 1, 2 <--> 3, 3 <--> 5, ... , n <--> 2n-1, ... ]. Note how this gives a definite formula for the rule, removing all ambiguity. No doubt is left as to how to figure which number goes with which. &&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& Self-critique (if necessary): ------------------------------------------------ Self-critique Rating: ********************************************* Question: `q004. Write an unambiguous rule involving n for the correspondence between { 1, 2, 3, ... } and { 5, 10, 15, ... }. YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY Your solution: The number multiplied by 5 confidence rating #$&*: 3 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
.............................................
Given Solution: It should be clear that each element of the second set is 5 times as great as the corresponding element the first set. The rule would therefore be n <--> 5n. &&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& Self-critique (if necessary): ------------------------------------------------ Self-critique Rating: ********************************************* Question: `q005. Write an unambiguous rule involving n for the correspondence between { 1, 2, 3, ... } and { 7, 12, 17, ... }. YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY Your solution: Multiply the number by 5 then add 2 confidence rating #$&*: 3 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
.............................................
Given Solution: First we note that the numbers in the second set are going up by 5 each time. This indicates that we will probably somehow have to use 5n in our formula. Just plain 5n gives us 5, 10, 15, ... . It's easy to see that these numbers are each 2 less than the numbers 7, 12, 17, ... . So if we add 2 to 5n we get the numbers we want. Thus the rule is n <--> 5n+2, or in a bit more detail [ 1 <--> 7, 2 <--> 12, 3 <--> 17, ..., n <--> 5n+2, ... ]. &&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& Self-critique (if necessary): " self-critique #$&* #$&* self-critique self-critique rating
#$&* course Math 151 005. `Query 5
.............................................
Given Solution: `a** There are 10 numbers in the set: 9, 12, 15, 18, 21, 24, 27, 30, 33, 36 ** &&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& Self-critique (if necessary): ------------------------------------------------ Self-critique Rating: ********************************************* Question: `qQuery 2.5.18 n({x | x is an even integer } YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY Your solution: All values of x. Infinite solution confidence rating #$&*: 2 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
.............................................
Given Solution: `a** {x | x is an even integer } indicates the set of ALL possible values of the variable x which are even integers. Anything that satisfies the description is in the set. This is therefore the set of even integers, which is infinite. Since this set can be put into 1-1 correspondence with the counting numbers its cardinality is aleph-null. ** &&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& Self-critique (if necessary): ------------------------------------------------ Self-critique Rating: ********************************************* Question: `qQuery 2.5.24 how many diff corresp between {Foxx, Myers, Madonna} and {Powers, Charles, Peron}? YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY Your solution: [ {foxx, powers} {myers, charles} {Madonna, peron}] [ {fox. Peron} {myers, charles} { Madonna, powers} [{foxx charles }{Meyers. Powers} {madonna, peron} [{Madonna, powers} {Myers, peron} {foxx,charles} [{Foxx, Powers},{Myers,Peron},{Madonna, Charles}], [{Foxx, Peron},{Myers, Powers},{Madonna,Charles}], confidence rating #$&*: 3 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
.............................................
Given Solution: `a** Listing them in order, according to the order of listing in the set. We have: [ {Foxx, Powers},{Myers, Charles},{Madonna, Perron}] , [{Foxx, Powers},{Myers,Peron},{Madonna, Charles}], [{Foxx, Charles},{Myers, Powers},{Madonna, Peron}] [ {Foxx, Charles},{Myers,Peron},{Madonna,Powers}], [{Foxx, Peron},{Myers, Powers},{Madonna,Charles}], [{Foxx, Peron},{Myers, Charles},{Madonna, Powers}] for a total of six. Reasoning it out, there are three choices for the character paired with Foxx, which leaves two for the character to pair with Myers, leaving only one choice for the character to pair with Madonna. ** STUDENT QUESTION I don’t understand what happened to the other 3 choices for pairing. I got (Foxx, Powers) (Foxx, Charles) (Foxx, Peron) (Myers, Powers) (Myers, Charles) (Myers, Peron) (Madonna, Powers) (Madonna, Charles) (Madonna, Peron) INSTRUCTOR RESPONSE What you listed were ordered pairs, one from the first set and one from the second. In fact you listed the 9 pairs of the 'product set'' A X B, an idea you will encounter later in this chapter. However an ordered pair of elements, one from the first set and one from the second (for example your listing (Madonna, Peron)), is not a one-to-one correspondence. In a 1-1 correspondence every element in the first set must be paired with an element in the second. [ {Foxx, Powers},{Myers, Charles},{Madonna, Perron}] is a one-to-one correspondence between the sets. It tells you who each member of the first set is paired with in the second. [{Foxx, Powers},{Myers,Peron},{Madonna, Charles}] is a different one-to-one correspondence. [{Foxx, Charles},{Myers, Powers},{Madonna, Peron}] is another. [ {Foxx, Charles},{Myers,Peron},{Madonna,Powers}], [{Foxx, Peron},{Myers, Powers},{Madonna,Charles}], and [{Foxx, Peron},{Myers, Charles},{Madonna, Powers}] are three more one-to-one correspondences. &&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& Self-critique (if necessary): ------------------------------------------------ Self-critique Rating: ********************************************* Question: `q2.5.36 1-1 corresp between counting #'s and {-17, -22, -27, ...} YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY Your solution: Keep subtracting the numbers by 5 confidence rating #$&*: ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
.............................................
Given Solution: `a**You have to describe the 1-1 correspondence, including the rule for the nth number. A complete description might be 1 <-> -17, 2 <-> -22, 3 <-> -27, ..., n <-> -12 + 5 * n. You have to give a rule for the description. n <-> -12 - 5 * n is the rule. Note that we jump by -5 each time, hence the -5n. To get -17 when n=1, we need to start with -12. THE REASONING PROCESS TO GET THE FORMULA: The numbers in the first set decrease by 5 each time so you need -5n. The n=1 number must be -17. -5 * 1 = -5. You need to subtract 12 from -5 to get -17. So the formula is -5 n - 12. ** &&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& Self-critique (if necessary): ------------------------------------------------ Self-critique Rating: ********************************************* Question: `q2.5.42 show two vert lines, diff lengths have same # of points YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY Your solution: confidence rating #$&*: ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
.............................................
Given Solution: `a** This is a pretty tough question. One way of describing the correspondence (you will probably need to do the construction to understand): Sketch a straight line from the top of the blue line at the right to the top of the blue line at the left, extending this line until it meets the dotted line. Call this meeting point P. Then for any point on the shorter blue line we can draw a straight line from P to that point and extend it to a point of the longer blue line, and in our 1-1 correspondence we match the point on the shorter line with the point on the longer. From any point on the longer blue line we can draw a straight line to P; the point on the longer line will be associated with the point we meet on the shorter. We match these two points. If the two points on the long line are different, the straight lines will be different so the points on the shorter line will be different. Thus each point on the longer line is matched with just one point of the shorter line. We can in fact do this for any point of either line. So any point of either line can be matched with any point of the other, and if the points are different on one line they are different on the other. We therefore have defined a one-to-one correspondence. ** "