This preview shows page 1. Sign up to view the full content.
Unformatted text preview: n distinct ntuples of 0 and 1. Let B n be the set of all such ntuples. As dened in class, let C ( { 1 ,..,n } ) be the set of binary functions on the set { 1 ,..,n } . Use the Bijectivity Test to prove that the function : C ( { (1 ,..,n } ) B n , f 7 ( f (1) ,..,f ( n )) is a bijection. (You should write down the inverse of rst.) Finally, use the bijection : P ( { 1 ,...,n } ) C ( { 1 ,...,n } ), introduced in class to conclude that the power set P ( { 1 ,...,n } ) has exactly 2 n members....
View Full
Document
 Spring '09
 BongLian
 Math

Click to edit the document details