Tag Archives: Mathematics

About the Cardinality of Sets

Even though it “only” was an assignment in Computational Models, it has a rather nice solution. The Problem:
Show that for every set it holds that .
A proof: The basic idea is to generalize Cantor’s diagonal argument. Assume that there is a set such that . Then there is a surjective mapping . Define [...]

A lower bound for 3-Clique

We will (recap the) proof of

Share/Save