Always room for one more — even when full.
David Hilbert sketched the hotel in a 1924 Göttingen lecture; George Gamow carried it to the public in his 1947 book One, Two, Three… Infinity. Below: the four classical scenarios, animated, plus the moment infinity finally pushes back — Cantor's diagonal.
Infinity is not a very large number — it is a different kind of size, with its own arithmetic. A 'full' infinite hotel can still absorb more guests because ℵ₀ + 1 = ℵ₀.
Ask every guest in room n to walk to room n+1. Nobody is kicked out, and room 1 falls vacant for the newcomer.
Hilbert's 1924 thought experiment is the cleanest argument that infinite sets follow rules our finite intuition does not. It is also the prelude to Cantor's deeper shock: some infinities really are larger than others.
The hotel has one room for every natural number — a guest in 1, a guest in 17, a guest in 10¹⁰⁰. Tonight every room is taken, yet 'full' is the wrong word: the cardinality of the guests is ℵ₀, and ℵ₀ is not a number you can fill up.
A traveller knocks. The manager broadcasts a single instruction: every guest, move from room n to room n+1. Nobody is displaced — there is always a higher-numbered room waiting — and room 1 falls vacant for the newcomer.
A coach arrives with k passengers. Send each existing guest from room n to room n+k. Rooms 1 through k empty out in one motion; the k newcomers walk straight in.
Now a countably infinite queue arrives. The manager sends each existing guest from room n to room 2n: every even room stays occupied and every odd room becomes free. The newcomers fill 1, 3, 5, 7, … — the equality ℵ₀ + ℵ₀ = ℵ₀, executed in one announcement.
Pick a scenario. The amber pulse is the shift; cyan tiles are the newcomers; rose is a bus passenger. Tile labels show original room numbers (or bus·seat for bus passengers).
A fleet of ℵ₀ buses pulls up, each carrying ℵ₀ passengers. Send each existing guest n to room 2ⁿ, then send bus-k passenger m to room pₖᵐ, where pₖ is the k-th odd prime. The fundamental theorem of arithmetic guarantees no two guests collide — ℵ₀ × ℵ₀ = ℵ₀.
| Who | Room | First rooms |
|---|---|---|
| Existing guest n | 2ⁿ | 2, 4, 8, 16, 32, … |
| Bus 1 passenger m | 3ᵐ | 3, 9, 27, 81, … |
| Bus 2 passenger m | 5ᵐ | 5, 25, 125, 625, … |
| Bus 3 passenger m | 7ᵐ | 7, 49, 343, … |
| Bus k passenger m | pₖᵐ | pₖ, pₖ², pₖ³, … |
Unique prime factorisation guarantees no two passengers ever request the same room. Many room numbers (6, 10, 12, 14, …) stay vacant: there is slack to spare.
Push one step further and the trick breaks. Cantor's 1891 diagonal argument shows that the real numbers in [0,1] cannot be listed even once — for any proposed enumeration, a new real differs from row n at the n-th digit. The reals are uncountable; the hotel is not big enough.
| ℕ | bijection | 2ℕ |
|---|---|---|
| 1 | ↔ | 2 |
| 2 | ↔ | 4 |
| 3 | ↔ | 6 |
| 4 | ↔ | 8 |
| 5 | ↔ | 10 |
| 6 | ↔ | 12 |
| 7 | ↔ | 14 |
| 8 | ↔ | 16 |
The first two modes show a clean bijection — countable. The third tries to enumerate the reals; the diagonal real at the bottom differs from every row, so no list of reals can ever be complete. See /cantor for the full argument.
Replay the four shifts, watch the prime-power assignment land bus by bus, then cross over to Cantor's diagonal and see why this particular trick stops working.
→ Open the ExplorerHow and where this technique lives in the world today.
Topics in the same vein.
