This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: (b) Let P be the set of all subsets of N . Show that P is uncountable. [ Hint : for an alleged bijection f : N → P , consider the set D = { n ∈ N ; n n∈ f ( n ) } .] 3 . Exercise 7, p. 43 of Rudin. 4 . Exercise 8, p. 43 of Rudin. 5 . Exercise 9, p. 43 of Rudin. MIT OpenCourseWare http://ocw.mit.edu 18.100B Analysis I Fall 2010 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms ....
View
Full
Document
 Fall '10
 Prof.KatrinWehrheim

Click to edit the document details