{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# HW6 - N A i is countable Note that x ∈ A if and only if x...

This preview shows page 1. Sign up to view the full content.

Math 23b Homework 6 Spring, 2009 Due Monday, March 30. Be sure to write clearly, using complete sentences. Do not use abbreviations like s.t., w/, w/o, b/c, c/o, etc. In all problems you must prove that your answer is correct, even if the problem does not explicitly ask you to do so. 1. Compute the following in base 3, and verify your answers by redoing the computations in decimal representations and convert the results back to base 3: 12012 - 2221 = , 12012 × 2221 = . 2. Suppose that you have a balance and weights of 1, 3, 9 and 27 oz . How can you balance a weight of 17 oz? You need to find b 0 , b 1 , b 2 , b 3 ∈ {- 1 , 0 , 1 } such that 17 = 3 i =0 b i 3 i . Note that 40 = 3 i =0 3 i . To find the b i , it is easier to find the base 3 representation of 17 + 40 first. 3. Let A 1 , A 2 , A 3 , ... be a list of countable sets. In no more than 1 page, prove that their union A =
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: N A i is countable. Note that x ∈ A if and only if x ∈ A i for some i ∈ N . (List the members of the union in an inﬁnite array, and use it to deﬁne a surjection f : N → A . Then apply a result we proved in class. ) 4. Problem 4 Page 268. Justify your answer in no more than 10 lines. 5. Problem 8 Page 268. Recall that S bounded means that there is a number M > 0 such that | x | ≤ M for all x ∈ S . Justify your answer in no more than 10 lines. 6. Let S be a nonempty set of real numbers which has a lower bound. Let-S denote {-x : x ∈ S } . In no more than 10 lines, show that-S has an upper bound. By the Least Upper Bound Property,-S has a least upper bound α . In no more than 20 lines, show that-α is the greatest lower bound of S ....
View Full Document

{[ snackBarMessage ]}