course Mth 151 «€Ö|°ßŸ”¦Îó™ÿŽèÏظ‚ßíåt³Ýïassignment #005
......!!!!!!!!...................................
18:23:52 `q001. Note that there are 8 questions in this assignment. The set { 1, 2, 3, ... } consists of the numbers 1, 2, 3, etc.. The etc. has no end. This set consists of the familiar counting numbers, which most of us have long known to be unending. This is one example of an infinite set. Another is the set of even positive numbers { 2, 4, 6, ... }. This set is also infinite. There is an obvious one-to-one correspondence between these sets. This correspondence could be written as [ 1 <--> 2, 2 <--> 4, 3 <--> 6, ... ], where the ... indicates as before that the pattern should be clear and that it continues forever. Give a one-to-one correspondence between the sets { 1, 2, 3, ... } and the set { 1, 3, 5, ... } of odd numbers.
......!!!!!!!!...................................
RESPONSE --> 1 <-> 1, 2 <-> 3, 3 <-> 5, 4 <-> 7, 5 <-> 9, 6 <-> 11..... confidence assessment: 3
.................................................
......!!!!!!!!...................................
18:24:00 This correspondence can be written [ 1 <--> 1, 2 <--> 3, 3 <--> 5, ... ].
......!!!!!!!!...................................
RESPONSE --> OK self critique assessment: 3
.................................................
......!!!!!!!!...................................
18:31:22 `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, ... ]?
......!!!!!!!!...................................
RESPONSE --> Using the set of counting numbers, begin by adding zero to the first number, 1 to the next number, two to the next number, and so on, pairing the numbers in this set with the numbers in the set of counting numbers. confidence assessment: 2
.................................................
......!!!!!!!!...................................
18:32:10 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, ... .
......!!!!!!!!...................................
RESPONSE --> I didn't think of this solution, but I think that the solution I came up with works also. self critique assessment: 2
.................................................
......!!!!!!!!...................................
18:33:00 `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, ... ]?
......!!!!!!!!...................................
RESPONSE --> n <-> 2n-1 confidence assessment: 3
.................................................
......!!!!!!!!...................................
18:33:09 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.
......!!!!!!!!...................................
RESPONSE --> OK self critique assessment: 3
.................................................
......!!!!!!!!...................................
18:33:52 `q004. Write an unambiguous rule involving n for the correspondence between { 1, 2, 3, ... } and { 5, 10, 15, ... }.
......!!!!!!!!...................................
RESPONSE --> Multiply the first number by 5. n <-> 5n confidence assessment: 3
.................................................
......!!!!!!!!...................................
18:33:59 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.
......!!!!!!!!...................................
RESPONSE --> OK self critique assessment: 3
.................................................
......!!!!!!!!...................................
18:35:26 `q005. Write an unambiguous rule involving n for the correspondence between { 1, 2, 3, ... } and { 7, 12, 17, ... }.
......!!!!!!!!...................................
RESPONSE --> n <-> 5n+2 confidence assessment: 3
.................................................
......!!!!!!!!...................................
18:35:34 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, ... ].
......!!!!!!!!...................................
RESPONSE --> OK self critique assessment: 3
.................................................
......!!!!!!!!...................................
18:42:10 `q006. Write an unambiguous rule involving n for the correspondence between { 1, 2, 3, ... } and { 3, 10, 17, ... }.
......!!!!!!!!...................................
RESPONSE --> n <-> 7n-4 confidence assessment: 3
.................................................
......!!!!!!!!...................................
18:42:16 The numbers in the second set are going up by 7 each time, so we will probably 7n in our formula. Just plain 7n gives us 7, 14, 21, ... . These numbers are each 4 greater than the numbers 3, 10, 17, ... . So if we subtract 4 from 7n we get the numbers we want. Thus the rule is n <--> 7n-4, or [ 1 <--> 3, 2 <--> 10, 3 <--> 17, ..., n <--> 7n-4, ... ].
......!!!!!!!!...................................
RESPONSE --> OK self critique assessment: 3
.................................................
......!!!!!!!!...................................
18:43:55 `q007. Surprisingly, the numbers { 1, 2, 3, ... } can be put into correspondence with the set of all integer-divided-by-integer fractions (the set of all such fractions is called the set of Rational Numbers). This set would include the fractions 1/2, 1/3, 1/4, ..., as well as fractions like 38237 / 819872 and 232987 / 3. It is a bit surprising that this set could be in 1-1 correspondence with the counting numbers, because just the fractions 1/2, 1/3, 1/4, ... can be put into one-to-one correspondence with the set {1, 2, 3, ... }, and these fractions are less than a drop in the bucket among all possible fractions. These fractions all have numerator 1. The set will also contain the fractions of numerator 2: 2/1, 2/2, 2/3, 2/4, ... . And the fractions with numerator 3: 3/1, 3/2, 3/3, 3/4, ... . We could go on, but the idea should be clear. It certainly seems like there should be more fractions than counting numbers. But it isn't so, as you will see in the lectures and the text. Give a one-to-one correspondence between just the fractions 1/2, 1/3, 1/4, ... and the counting numbers {1, 2, 3, ... }.
......!!!!!!!!...................................
RESPONSE --> 1/2 <-> 1, 1/3 <-> 2, 1/4 <-> 3.... confidence assessment: 3
.................................................
......!!!!!!!!...................................
18:44:28 The correspondence would be [ 1 <--> 1/2, 2 <--> 1/3, 3 <--> 1/4, ... ]. The denominator of the fraction is always 1 greater than the counting number. So if the counting number is n, the denominator the corresponding fraction is n + 1. We would therefore write the correspondence as n <--> 1 / (n+1), or in a bit more detail [ 1 <--> 1/2, 2 <--> 1/3, 3 <--> 1/4, ... , n <--> 1/(n+1), ... ].
......!!!!!!!!...................................
RESPONSE --> OK self critique assessment: 3
.................................................
......!!!!!!!!...................................
18:56:37 `q008. How might we write a one-to-one correspondence between the set {1, 2, 3, ... } of counting numbers and the set union { 1/2, 1/3, 1/4, ... } U { 2/2, 2/3, 2/4, ... } of fractions with numerator 1 or 2?
......!!!!!!!!...................................
RESPONSE --> 1 <-> 2/2, 2 <-> 2/3, 3 <-> 2/4.... confidence assessment: 3
.................................................
......!!!!!!!!...................................
19:02:16 We could alternate between the two sets, using odd numbers with fractions whose numerator is 1 and even numbers with fractions whose numerator is 2. The correspondence would be [ 1 <--> 1/2, 2 <--> 2/2, 3 <--> 1/3, 4 <--> 2/3, 5 <--> 1/4, 6 <--> 2/4, ... ]. It would be a little bit tricky, but not all that difficult, to write this rule in terms of n. However, we won't go into that here.
......!!!!!!!!...................................
RESPONSE --> The union of the two sets would eliminate the fractions whose numerator is 1 because they are all equal to a fraction whose numerator is 2 (for example, 1/2 = 2/4), so I only used the set with numerator 2. self critique assessment: 2 "