course Mth151 Vassignment #005
......!!!!!!!!...................................
13:20:56 `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} confidence assessment: 2
.................................................
......!!!!!!!!...................................
13:21:06 This correspondence can be written [ 1 <--> 1, 2 <--> 3, 3 <--> 5, ... ].
......!!!!!!!!...................................
RESPONSE --> ok self critique assessment: 2
.................................................
......!!!!!!!!...................................
13:22:04 `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 --> confidence assessment:
.................................................
......!!!!!!!!...................................
13:22:16 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 --> self critique assessment:
.................................................
sꔺګ̟{ww_Ա assignment #006 006. Sequences and Patterns Liberal Arts Mathematics I 02-15-2009
......!!!!!!!!...................................
13:46:09 `q001. Note that there are 6 questions in this assignment. Find the likely next element of the sequence 1, 2, 4, 7, 11, ... .
......!!!!!!!!...................................
RESPONSE --> confidence assessment:
.................................................
Dzќ] assignment #005 005. Infinite Sets Liberal Arts Mathematics I 02-15-2009
......!!!!!!!!...................................
13:47:22 `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} confidence assessment: 2
.................................................
......!!!!!!!!...................................
13:47:28 This correspondence can be written [ 1 <--> 1, 2 <--> 3, 3 <--> 5, ... ].
......!!!!!!!!...................................
RESPONSE --> ok self critique assessment: 2
.................................................
......!!!!!!!!...................................
13:48:38 `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 --> I'm not sure confidence assessment: 0
.................................................
......!!!!!!!!...................................
13:49:00 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 --> ok self critique assessment: 0
.................................................
......!!!!!!!!...................................
13:51:14 `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<--> next odd number confidence assessment: 0
.................................................
......!!!!!!!!...................................
13:51:30 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: 0
.................................................
......!!!!!!!!...................................
13:54:10 `q004. Write an unambiguous rule involving n for the correspondence between { 1, 2, 3, ... } and { 5, 10, 15, ... }.
......!!!!!!!!...................................
RESPONSE --> n<->5n confidence assessment: 2
.................................................
......!!!!!!!!...................................
13:54:20 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: 2
.................................................
......!!!!!!!!...................................
13:55:07 `q005. Write an unambiguous rule involving n for the correspondence between { 1, 2, 3, ... } and { 7, 12, 17, ... }.
......!!!!!!!!...................................
RESPONSE --> n<->n+5 confidence assessment: 2
.................................................
......!!!!!!!!...................................
13:55:22 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: 0
.................................................
......!!!!!!!!...................................
14:00:24 `q006. Write an unambiguous rule involving n for the correspondence between { 1, 2, 3, ... } and { 3, 10, 17, ... }.
......!!!!!!!!...................................
RESPONSE --> n<-> n+20 confidence assessment: 0
.................................................
......!!!!!!!!...................................
14:00:44 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: 0
.................................................
......!!!!!!!!...................................
14:05:15 `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: 2
.................................................
......!!!!!!!!...................................
14:05:44 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: 0
.................................................
......!!!!!!!!...................................
14:07:05 `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 --> confidence assessment:
.................................................
......!!!!!!!!...................................
14:07:22 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 --> self critique assessment:
.................................................
ŒǼ։Еw assignment #007 007. Triangular, Square, Pentagonal Numbers Liberal Arts Mathematics I 02-15-2009
......!!!!!!!!...................................
14:23:42 `q001. Note that there are 7 questions in this assignment. Sketch three points A, B and C forming an equilateral triangle on a piece of paper, with point A at the lower left-hand corner, point B at the lower right-hand corner and point C at the top. Sketch the segments AB and AC. Now double the lengths of AB and AC, and place a point at each of the endpoints of these segments. Connect these new endpoints to form a new equilateral triangle. Two sides of this triangle will have three points marked while the new side will only have its two endpoints marked. Fix that by marking that middle point, so all three sides of your new triangle are marked the same. How many marked points were there in the original triangle, and how many are there in the new triangle?
......!!!!!!!!...................................
RESPONSE --> 3 in origional and 6 in new confidence assessment: 2
.................................................
......!!!!!!!!...................................
14:23:57 The original triangle had the three points A, B and C. When you extended the two sides you marked the new endpoints, then you marked the point in the middle of the third side. So you've got 6 points marked. Click on 'Next Picture' to see the construction. The original points A, B and C are shown in red. The line segments from A to B and from A to C have been extended in green and points marked at the ends of these segments. The new endpoints have been connected to form the third side of a larger triangle, and an equally spaced point has been constructed at the midpoint of that side. Your figure should contain the three original points, plus the three points added when the new side was completed.
......!!!!!!!!...................................
RESPONSE --> ok self critique assessment: 2
.................................................
......!!!!!!!!...................................
14:25:37 `q002. Extend the two sides that meet at A by distances equal to the distance original lengths AC and AB and mark the endpoints of the newly extended segments. Each of the newly extended sides will have 4 marked points. Now connect the new endpoints to form a new right triangle. Mark points along the new side at the same intervals that occur on the other two sides. How many marked points are on your new triangle, and how many in the whole figure?
......!!!!!!!!...................................
RESPONSE --> nine total 3 on new confidence assessment: 2
.................................................
......!!!!!!!!...................................
14:25:48 You added the two new endpoints when you extended the sides. You then should have marked two new points on the new third side, so that each side contains 4 points including its endpoints. Your figure will now contain 10 marked points.
......!!!!!!!!...................................
RESPONSE --> ok self critique assessment: 2
.................................................
......!!!!!!!!...................................
14:26:11 `q003. Continue the process for another step-extend each side by a distance equal to the original point-to-point distance. How many points do you have in the new triangle?
......!!!!!!!!...................................
RESPONSE --> 15 confidence assessment: 2
.................................................
......!!!!!!!!...................................
14:26:27 You will add an endpoint to each newly extended side, so each of the new sides will contain 5 points. You will then have to add 3 equally spaced points to the new side, giving you a total of 13 points on the new triangle. In addition there are two marked points inside the triangle, for a total of 15 points. Click on 'Next Picture' to see the construction. The line segments along two sides of the triangle have again been extended and points marked at the ends of these segments. The new endpoints have been connected to form the third side of a larger triangle, and equally spaced points have been constructed along that side.
......!!!!!!!!...................................
RESPONSE --> ok self critique assessment: 2
.................................................
......!!!!!!!!...................................
14:26:45 `q004. Continue the process for one more step. How many points do you have in the new triangle?
......!!!!!!!!...................................
RESPONSE --> 21 confidence assessment: 2
.................................................
......!!!!!!!!...................................
14:26:58 You will add an endpoint to each newly extended side, so each of the new sides will contain 6 points. You will then have to add 4 equally spaced points to the new side, giving you a total of 15 points on the new triangle. There are also 5 marked points inside the triangle for a total of 21 marked points.
......!!!!!!!!...................................
RESPONSE --> ok self critique assessment: 2
.................................................
......!!!!!!!!...................................
14:27:26 `q005. The sequence of marked points is 3, 6, 10, 15, 21. What do expect will be the next number in this sequence?
......!!!!!!!!...................................
RESPONSE --> 28 confidence assessment: 2
.................................................
......!!!!!!!!...................................
14:27:32 The differences between these numbers are 3, 4, 5, 6. The next difference, according to this pattern, should be 7, which would make the next number 28.
......!!!!!!!!...................................
RESPONSE --> ok self critique assessment: 2
.................................................
......!!!!!!!!...................................
14:28:54 `q006. How can you tell, in terms of the process you used to construct these triangles, that the next number should be 7 greater?
......!!!!!!!!...................................
RESPONSE --> because each tim the triangle is extended its t+1 confidence assessment: 2
.................................................
......!!!!!!!!...................................
14:29:03 When you extend the triangle again, you will add two new endpoints and each side will now have 7 points. The 7 points on the new triangle will be all of the new points.
......!!!!!!!!...................................
RESPONSE --> ok self critique assessment: 0
.................................................
......!!!!!!!!...................................
14:31:30 `q007. How do you know this sequence will continue in this manner?
......!!!!!!!!...................................
RESPONSE --> Because each time we extend the triangle it increases the amount of points by n+1 confidence assessment: 21
.................................................
......!!!!!!!!...................................
14:31:38 Each time you extend the triangle, each side increases by 1. All the new marked points are on the new side, so the total number of marked points will increase by 1 more than with the previous extension.
......!!!!!!!!...................................
RESPONSE --> ok self critique assessment: 2
.................................................
R{~Oέxa assignment #008 008. Arithmetic Sequences Liberal Arts Mathematics I 02-15-2009
......!!!!!!!!...................................
17:32:36 `q001. There are seven questions in this set. See if you can figure out a strategy for quickly adding the numbers 1 + 2 + 3 + ... + 100, and give your result if you are successful. Don't spend more than a few minutes on your attempt.
......!!!!!!!!...................................
RESPONSE --> 101/2x100=5050 confidence assessment: 2
.................................................
......!!!!!!!!...................................
17:32:49 These numbers can be paired as follows: 1 with 100, 2 with 99, 3 with 98, etc.. There are 100 number so there are clearly 50 pairs. Each pair adds up to the same thing, 101. So there are 50 pairs each adding up to 101. The resulting sum is therefore total = 50 * 101 = 5050.
......!!!!!!!!...................................
RESPONSE --> ok self critique assessment: 2
.................................................
......!!!!!!!!...................................
17:34:07 `q002. See if you can use a similar strategy to add up the numbers 1 + 2 + ... + 2000.
......!!!!!!!!...................................
RESPONSE --> 2002/2x2000=20020000 confidence assessment: 1
.................................................
......!!!!!!!!...................................
17:34:18 Pairing 1 with 2000, 2 with 1999, 3 with 1998, etc., and noting that there are 2000 numbers we see that there are 1000 pairs each adding up to 2001. So the sum is 1000 * 2001 = 2,001,000.
......!!!!!!!!...................................
RESPONSE --> ok self critique assessment: 2
.................................................
......!!!!!!!!...................................
17:35:42 `q003. See if you can devise a strategy to add up the numbers 1 + 2 + ... + 501.
......!!!!!!!!...................................
RESPONSE --> 501/2x500+1=125251 confidence assessment: 2
.................................................
......!!!!!!!!...................................
17:35:56 We can pair 1 with 501, 2 with 500, 3 with 499, etc., and each pair will have up to 502. However there are 501 numbers, so not all of the numbers can be paired. The number in the 'middle' will be left out. However it is easy enough to figure out what that number is, since it has to be halfway between 1 and 501. The number must be the average of 1 and 501, or (1 + 501) / 2 = 502 / 2 = 266. Since the other 500 numbers are all paired, we have 250 pairs each adding up to 502, plus 266 left over in the middle. The sum is 250 * 502 + 266 = 125,500 + 266 = 125,751. Note that the 266 is half of 502, so it's half of a pair, and that we could therefore say that we effectively have 250 pairs and 1/2 pair, or 250.5 pairs. 250.5 is half of 501, so we can still calculate the number of pairs by dividing the total number of number, 501, by 2. The total sum is then found by multiplying this number of pairs by the sum 502 of each pair: 250.5 * 502 = 125,766.
......!!!!!!!!...................................
RESPONSE --> ok confidence assessment: 2
.................................................
......!!!!!!!!...................................
17:38:44 `q004. Use this strategy to add the numbers 1 + 2 + ... + 1533.
......!!!!!!!!...................................
RESPONSE --> 1534/2*1533=1175811 confidence assessment: 1
.................................................
......!!!!!!!!...................................
17:39:19 Pairing the numbers, 1 with 1533, 2 with 1532, etc., we get pairs which each adult to 1534. There are 1533 numbers so there are 1533 / 2 = 766.5 pairs. We thus have a total of 1534 * 766.5, whatever that multiplies out to (you've got a calculator, and I've only got my unreliable head).
......!!!!!!!!...................................
RESPONSE --> ok self critique assessment: 1
.................................................
......!!!!!!!!...................................
17:42:16 `q005. Use a similar strategy to add the numbers 55 + 56 + ... + 945.
......!!!!!!!!...................................
RESPONSE --> 945/2=472.5*945=446512.5 confidence assessment: 1
.................................................
......!!!!!!!!...................................
17:42:52 We can pair up 55 and 945, 56 and 944, etc., obtaining 1000 for each pair. There are 945 - 55 + 1 = 891 numbers in the sum (we have to add 1 because 945 - 55 = 890 tells us how many 1-unit 'jumps' there are between 55 and 945--from 55 to 56, from 56 to 57, etc.. The first 'jump' ends up at 56 and the last 'jump' ends up at 945, so every number except 55 is the end of one of the 890 'jumps'. But 55 is included in the numbers to be summed, so we have 890 + 1 = 891 numbers in the sum). If we have 891 numbers in the sum, we have 891/2 = 445.5 pairs, each adding up to 1000. So we have a total of 445.5 * 1000 = 445,500.
......!!!!!!!!...................................
RESPONSE --> ok self critique assessment: 1
.................................................
......!!!!!!!!...................................
17:44:42 `q006. Devise a strategy to add the numbers 4 + 8 + 12 + 16 + ... + 900.
......!!!!!!!!...................................
RESPONSE --> 904*900/8=101700 confidence assessment: 1
.................................................
......!!!!!!!!...................................
17:45:06 Pairing 4 with 900, 8 with 896, etc., we get pairs adding up to 904. The difference between 4 and 900 is 896. The numbers 'jump' by 4, so there are 896 / 4 = 224 'jumps'. None of these 'jumps' ends at the first number so there are 224 + 1 = 225 numbers. Thus we have 225 / 2 = 112.5 pairs each adding up to 904, and our total is 112.5 * 904.
......!!!!!!!!...................................
RESPONSE --> ok self critique assessment: 2
.................................................
......!!!!!!!!...................................
17:45:44 `q007. What expression would stand for the sum 1 + 2 + 3 + ... + n, where n is some whole number?
......!!!!!!!!...................................
RESPONSE --> n/2*n confidence assessment: 1
.................................................
......!!!!!!!!...................................
17:46:04 We can pair 1 and n, 2 and n-1, 3 and n-2, etc., in each case obtaining a sum of n + 1. There are n numbers so there are n/2 pairs, each totaling n + 1. Thus the total is n/2 * (n+1).
......!!!!!!!!...................................
RESPONSE --> ok self critique assessment: 2
.................................................