Sample 2nd Midterm

Sample 2nd Midterm - SAMPLE PROBLEMS FOR THE SECOND M114S...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: SAMPLE PROBLEMS FOR THE SECOND M114S MIDTERM Forget about the numbersthe problems come from previous midterms and finals and I have not bothered to change their numbers Problem 3 . Consider the following binary relation on the set ( N N ) of all functions on the natural numbers: f g { n | f ( n ) = 0 } = c { m | g ( m ) = 0 } . 3a . Prove that is an equivalence relation on ( N N ). 3b . Prove that has a countable quotient, i.e., the following: there is a countable set Q and a surjection : ( N N ) Q, such that f g ( f ) = ( g ) ( f,g : N N ) . Problem 4 . Compute the following cardinal numbers, where = | N | , c = |P ( N ) | . Each step in the computation must be justified by some theorem we have proved, but it is not necessary to quote and state all these theoremsjust dont put down equations which cannot be justified easily from known results. All the answers are among the following cardinal numbers: , c , 2...
View Full Document

Page1 / 2

Sample 2nd Midterm - SAMPLE PROBLEMS FOR THE SECOND M114S...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online