The Infinite Hotel: Understanding Hilbert's Paradox
Imagine a hotel with infinitely many rooms, numbered 1, 2, 3, 4 and so on forever. Tonight, every single room is occupied. The sign outside says NO VACANCY.
A traveler arrives and asks for a room. In any real hotel, they'd be turned away. In Hilbert's Hotel, the manager says: "No problem." Then an infinite bus full of new guests pulls up. "No problem." Then infinitely many infinite buses. Still no problem.
This thought experiment, introduced by German mathematician David Hilbert, is one of the clearest ways to see how differently infinite sets behave from finite ones.
"Full" Doesn't Mean "No Room"
For a finite hotel, "every room is occupied" and "there's no room for anyone else" mean the same thing. For an infinite hotel, they don't.
The trick is that nobody has to leave. The manager just moves guests to new rooms, following a rule that gives everyone a room while freeing others up. Because there's no last room, there's never a guest who gets pushed out of the building.
Case 1: One New Guest
The manager announces: "Everyone please move from room n to room n + 1."
Room 1 → Room 2
Room 2 → Room 3
Room 3 → Room 4
…
Every current guest still has a room. And Room 1 is now empty, ready for the new arrival.
This works because the natural numbers can be paired with the numbers from 2 onward: n ↔ n + 1. In the language of set theory, the set {1, 2, 3, …} and the set {2, 3, 4, …} have the same size, even though one is missing an element.
Want room for 1,000 new guests? Move everyone from room n to room n + 1,000.
Case 2: An Infinite Bus
A bus arrives with infinitely many passengers, numbered 1, 2, 3, …. Shifting everyone by a fixed amount won't work, since no finite shift frees infinitely many rooms.
The manager announces: "Everyone move from room n to room 2n."
Room 1 → Room 2
Room 2 → Room 4
Room 3 → Room 6
…
Current guests now fill only the even-numbered rooms. All the odd-numbered rooms (1, 3, 5, 7, …) are empty, and there are infinitely many of them. Passenger k goes to room 2k − 1.
This shows that the even numbers and the odd numbers are each as numerous as all the natural numbers combined. Check parity with the even number checker and odd number checker.
Case 3: Infinitely Many Infinite Buses
Now infinitely many buses arrive, bus 1, bus 2, bus 3, …, each with infinitely many passengers. Can the hotel handle ℵ₀ × ℵ₀ new guests?
Yes. One elegant method uses prime numbers:
- Current guests move from room n to room 2ⁿ
- Passengers from bus 1 go to rooms 3ⁿ
- Passengers from bus 2 go to rooms 5ⁿ
- Passengers from bus k go to rooms pₖⁿ, where pₖ is the (k+1)-th prime
By the fundamental theorem of arithmetic, every number has only one prime factorization. So 2³ = 8, 3³ = 27 and 5² = 25 can never collide. Each guest gets a unique room, and many rooms (like 6, 10, 12) stay empty. See why with the prime factorization tool.
There's also a tidier method that fills every room: arrange all guests in a grid (bus number × seat number) and walk through the grid diagonally. That's the same trick Georg Cantor used to show the fractions are countable.
An Insider Reference: Hilbert's Lecture and Gamow's Book
Hilbert introduced the hotel in a 1924 lecture titled "Über das Unendliche" ("On the Infinite") in Göttingen. The lecture notes weren't widely known for decades.
The idea reached a mass audience through physicist George Gamow, who described it in his 1947 popular science book One Two Three... Infinity. Gamow's book is how generations of readers first met the paradox.
Hilbert was a fierce defender of Georg Cantor's set theory. In 1926 he wrote the famous line: "No one shall expel us from the paradise that Cantor has created." The hotel was one of his tools for making Cantor's ideas intuitive.
Where the Trick Fails
Is there any group of guests the hotel can't hold? Yes.
Suppose a bus arrives with one passenger for every real number between 0 and 1. No room-assignment rule can fit them all. Cantor's diagonal argument proves that any list of such numbers misses some. The real numbers are uncountable, a strictly bigger infinity than the rooms.
So Hilbert's Hotel isn't infinitely accommodating. It can hold any countable crowd, but not an uncountable one.
It's a "Paradox," Not a Contradiction
Nothing about Hilbert's Hotel is logically inconsistent. It feels paradoxical because our intuitions come from finite collections, where:
- Adding guests to a full hotel is impossible
- A part is always smaller than the whole
Both intuitions fail for infinite sets. In fact, one standard definition says a set is infinite precisely when it can be put into one-to-one correspondence with a proper part of itself. That's called a Dedekind-infinite set, after Richard Dedekind, who proposed the definition in 1888. Hilbert's Hotel is that definition dressed up as a story.
Two Concepts Worth Knowing
Bijection
A bijection is a one-to-one pairing that uses every element of both sets. Each room-reassignment rule in the hotel is a bijection, which is how we know nobody is lost or doubled up.
Countable Infinity
A set is countably infinite if its elements can be listed as a first, second, third, and so on. Its size is ℵ₀. The natural numbers, integers, even numbers and fractions are all countably infinite.
Quick Answer: What Is Hilbert's Hotel Paradox?
Hilbert's Hotel is a thought experiment about a full hotel with infinitely many rooms. By moving each guest from room n to room n + 1, room 1 frees up for a new guest. Moving guests to room 2n frees infinitely many odd rooms. It shows that infinite sets can have the same size as their own parts.
Try Them Yourself
- Even Number Checker: where current guests end up
- Odd Number Checker: the freed rooms
- Prime Numbers: the infinite-buses trick
- Prime Factorization: why no two guests collide
- Counting Tables: room numbers, one after another
- What Is Infinity?: the math behind the hotel
Pick bus 3, seat 2. Using the prime method, which room does that passenger get? (Bus 3 uses the 4th prime, 7, so the answer is 7² = 49.)