Assign 25

course Mth 151

I think I know what I was doing wrong. On the last question, I entered a response after I entered my answer. Does the last question look the way it suppose to look?

ΩʰʽIƀ១

Your work has been received. Please scroll through the document to see any inserted notes (inserted at the appropriate place in the document, in boldface) and a note at the end. The note at the end of the file will confirm that the file has been reviewed; be sure to read that note. If there is no note at the end, notify the instructor through the Submit Work form, and include the date of the posting to your access page.

assignment #005

005. `Query 5

College Algebra

09-19-2007

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

17:05:58

Query 2.5.12 n({9, 12, 15, ..., 36})

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

RESPONSE -->

10 Cardianl nubers in the set

confidence assessment: 3

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

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

17:08:11

Query 2.5.18 n({x | x is an even integer }

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

RESPONSE -->

The even integer would be aleph null because they are never ending.

confidence assessment: 3

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

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

17:16:41

Query 2.5.24 how many diff corresp between {Foxx, Myers, Madonna} and {Powers, Charles, Peron}?

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

RESPONSE -->

There would be 3 different groups. (Foxx<->Powers, Myers<->Charles, Madonna<->Peron), (Foxx<->Charles, Myers<->Powers, Madonna<->Peron) (Foxx<->Peron, Myers<->Charles, Maddona<->Powers)

confidence assessment: 2

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

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

17:22:53

2.5.36 1-1 corresp between counting #'s and {-17, -22, -27, ...}

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

RESPONSE -->

(1<->-17, 2<->-22, 3<->-27, n<->n-5,......). the second number is increasing by -5.

confidence assessment: 1

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

„έؚҫyF

assignment #005

005. `Query 5

College Algebra

09-19-2007

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

17:27:35

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

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

RESPONSE -->

Completed

self critique assessment:

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

xWwD}`iز

assignment #005

005. `Query 5

College Algebra

09-19-2007

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

17:28:26

Query 2.5.12 n({9, 12, 15, ..., 36})

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

RESPONSE -->

confidence assessment:

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

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

17:28:33

** There are 10 numbers in the set: 9, 12, 15, 18, 21, 24, 27, 30, 33, 36 **

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

RESPONSE -->

self critique assessment:

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

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

17:28:36

Query 2.5.18 n({x | x is an even integer }

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

RESPONSE -->

confidence assessment:

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

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

17:28:40

** {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. **

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

RESPONSE -->

self critique assessment:

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

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

17:28:44

Query 2.5.24 how many diff corresp between {Foxx, Myers, Madonna} and {Powers, Charles, Peron}?

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

RESPONSE -->

confidence assessment:

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

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

17:28:48

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

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

RESPONSE -->

self critique assessment:

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

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

17:28:55

2.5.36 1-1 corresp between counting #'s and {-17, -22, -27, ...}

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

RESPONSE -->

confidence assessment:

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

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

17:29:01

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

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

RESPONSE -->

self critique assessment:

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

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

17:30:08

2.5.42 show two vert lines, diff lengths have same # of points

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

RESPONSE -->

you would add three everytime you moved the blue line further to the right.

confidence assessment: 0

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

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

17:31:24

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

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

RESPONSE -->

Your right, it was a tough question. I think I understand your explanation of how you would do it.

self critique assessment: 2

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

"

The last part of the submission appears to contain all the information.