2007-04-27

Reminder:
A countable set of countable sets is countable.

2 Comments:

Anonymous Anonymous said...

Yes! This is Cantor's Theorem, which was presented to me by my Intermediate Analysis prof as a part of Quark's Dilemma.

Quark has a hotel with an infinite number of rooms, and during a starfleet convention an infinite number of borg ships show up each bearing an infinite number of borg. But Jean-Luc Picard and the Federation have occupied all the rooms already. So what's a poor Quark to do?

Tell everyone in the hotel to move to the room number twice that of the room they are currently in. Suddenly an infinite number of rooms are available, but there are infinitely many ships full of infinitely many borg! So what's a poor Quark to do?

Start taking on paying clients in the following order -

(1) (2) (6) (7) ...
(3) (5) (8) ...
(4) (9) ...
(10) ...
...

and so on where the column # is the ship and the row # is the passenger. Thus assuring all the borg passengers a place, Quark's coffers are lined with latinum.

6:13 AM  
Blogger Rachel said...

Adorable. I was applying it to my to-do list, but I like this better.

11:14 AM  

Post a Comment

<< Home