hw5-solutions

# (i should have said “using the idea of cantor’s

This preview shows pages 2–3. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (I should have said “using the idea of Cantor’s proof of the power set theorem”; in a deep sense the uncountability of the reals and the power set theorem are the “same idea”, but this misled some people into trying to construct diagonal arguments. 4. Let S be the set of all natural numbers that are describable in English words using no more than 50 characters (so, 240 is in S since we can describe it as “two hundred forty”, which requires fewer than 50 characters). Assuming that we are allowed to use only the 27 standard characters (the 26 letters of the alphabet and the space character), show that there are only finitely many numbers contained in S . (In fact, perhaps you can show that there can be no more than 27 50 elements in S .) Now, let the set T be all those natural numbers not in S . Show that there are infinitely many elements in T . Next, since T is a collection of natural numbers, show that it must contain a smallest number. Finally, consider the smallest number contained in T . Prove that this number must simultaneously be an element of S and not an element of S – a paradox! (B+S 3.4.20) Solution. There are only 27 50 strings consisting of fifty characters or less; furthermore most of these aren’t actually legitimate strings of English, and sometimes two describe the same number (for example, “eight” and “two cubed”). Thus there are only finitely many numbers contained in S . So there are infinitely many elements in T , since T consists of all the natural numbers except for a finite set, and removing a finite set from a countable set gives a countable set. A collection of natural numbers contains a smallest number, as we can see by checking if it contains 1, then 2, then 3, and so on. The smallest number contained in T is not contained in S , since it is contained in T . But it can be described as “the smallest number contained in T ”, which is a phrase containing less than fifty characters, so it is contained in S ....
View Full Document

{[ snackBarMessage ]}

### Page2 / 3

(I should have said “using the idea of Cantor’s proof...

This preview shows document pages 2 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online