assign5

course

???—?~??????

?{??????`????

assignment #005

005. Infinite Sets

Liberal Arts Mathematics I

09-15-2008

......!!!!!!!!...................................

20:12:16

`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....}

confidence assessment: 3

.................................................

......!!!!!!!!...................................

20:12:23

This correspondence can be written [ 1 <--> 1, 2 <--> 3, 3 <--> 5, ... ].

......!!!!!!!!...................................

RESPONSE -->

self critique assessment: 3

.................................................

......!!!!!!!!...................................

20:20:08

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 -->

{1<->5, 2<->10, 3<->15,....n<->5n,...}

self critique assessment: 3

.................................................

......!!!!!!!!...................................

20:25:43

`q005. Write an unambiguous rule involving n for the correspondence between { 1, 2, 3, ... } and { 7, 12, 17, ... }.

......!!!!!!!!...................................

RESPONSE -->

{1<->7, 2<->12, 3<->17,...,n<->5n+2...}

confidence assessment: 3

.................................................

......!!!!!!!!...................................

20:26:17

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 -->

I understand this pretty well.

self critique assessment: 3

.................................................

......!!!!!!!!...................................

20:48:00

`q006. Write an unambiguous rule involving n for the correspondence between { 1, 2, 3, ... } and { 3, 10, 17, ... }.

......!!!!!!!!...................................

RESPONSE -->

Im not sure what the formula would be but I know that you have to add 7 to the next answer

(1<->3,2<->10,3<->17, 4<->24...}

Also there is a difference of 6 if you use the first set 1+2=3, 2+8=10, 3+14=17 you add 6 more than you previously added

confidence assessment: 0

.................................................

......!!!!!!!!...................................

20:48:24

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 -->

self critique assessment: 3

.................................................

......!!!!!!!!...................................

20:57:31

`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<->1/2,2<->1/3, 3<->1/4, 4<->1/5... n<->1/n+1}

confidence assessment: 3

.................................................

......!!!!!!!!...................................

20:57:51

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 -->

self critique assessment: 3

.................................................

......!!!!!!!!...................................

21:06:49

`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<->1/2, 2<->1/3, 3<->1/4, ... n<->1/n+1}U {2/2, 2/3, 2/4,...}

confidence assessment: 1

.................................................

......!!!!!!!!...................................

21: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: 3

.................................................

???—?~??????

you are doing very well on these assignments. Any difficulties appear to be confined to the questions about dark hair and bright eyes.