Is the best way to disproof the lack of a bijection to assume there is a bijection and seek a contradiction? Or should we generally try to find some element that illustrates that the function is not surjective?
I am confused about the proof of the |S| < |P(S)|. Also I'm not following how the barber analogy relates...
Is N the biggest countable set? (And all sets whose cardinality is equivalent to |N|?)
-Batman
No comments:
Post a Comment