Problem
Imagine you see a really huge party bus pulling out, an infinite bus with no seats. Instead everyone on board is identified by their unique name, which is an infinite sequence of s and s. The bus has every person named with every possible infinite sequence of s and s, someone is named , someone else , and so on. Prove that this time you will not be able to accommodate all the new guests no matter how hard you try.