# Real analysis

Oct 27th, 2015
Anonymous
Category:
Mathematics
Price: \$5 USD

Question description

For each n ∈ N, let Fn denote the set of all n-element subsets of N. Thus F0={Ø}, F1={{1},{2},...}, F2={{1,2},{1,3},...}, etc.

(a) Show that Fn is countable for each n.

(b) Show that the set F = F0 ∪ F1 ∪ F2 ∪ ... of all finite subsets of N is countable.

(Top Tutor) Borys S
School: University of Maryland

Studypool has helped 1,244,100 students

Review from student
Anonymous
" Outstanding Job!!!! "

1827 tutors are online

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors