This preview shows page 1. Sign up to view the full content.
Unformatted text preview: g is n 1 2 3 4 5 6 7 8 :: : g ( n ) b 1 b 2 b 3 b 4 b 5 f (1) f (2) f (3) :: : We need A and B to be disjoint to avoid duplicates in the second row of the table. What if A and B are not disjoint? Let B = B n A = f x 2 B : x = 2 A g . Then A and B are disjoint and A [ B = A [ B . We can write B = f b 1 ;: :: ;b k g for some k < 5 . De&ne g : N ! A [ B by g ( n ) = & b n if n ± k f ( n & k ) if n > k 4. Let A be the set of rational numbers with odd denominators. Explain why A is countable . Theorem 1.4.11 tells us that Q is countable. Theorem 1.4.12 tells us that any in&nite subset of a countable set is countable. The set A is in&nite because it contains 1 = 1 , 2 = 1 , 3 = 1 , 4 = 1 , . . . . It is a subset of Q , so it is countable....
View
Full
Document
This note was uploaded on 05/26/2010 for the course MATH maa 4200 taught by Professor Dr. during the Spring '08 term at Miami University.
 Spring '08
 Dr.
 Algebra, Sets

Click to edit the document details