WOLFRAM|DEMONSTRATIONS PROJECT

The Hilbert Hotel

​
number of new guests
finite
finite × infinite
infinite × infinite
new guests
3
width
4
full hotel
room
1
2
3
4
⋯
guest
g
1
g
2
g
3
g
4
⋯
new guests
T
1
,
T
2
,
T
3
new guests in full hotel
room
1
2
3
4
5
6
7
⋯
guest
T
1
T
2
T
3
g
1
g
2
g
3
g
4
⋯
Hilbert owns a hotel with an infinite number of rooms numbered
1,2,3,4,…
. The rooms are all occupied by guests who are numbered just like the rooms they occupy, that is, guest
g
n
is in room
n
.
A taxi arrives with
k
new guests labeled
T
1
,
T
2
,…,
T
k
. How can the manager give them rooms in the already full hotel? But there is always room at the Hilbert hotel, no matter how many people show up! To make room for them, the manager moves all of the original guests over by
k
rooms.
A plane arrives with
k
rows of seats, each row seating an infinite number of fliers. Label the fliers in the
th
i
row
F
i,1
,
F
i,2
,
F
i,3
,…
. To make room for all of them, the manager shifts the original guests in the hotel from room
n
to room
(k+1)n
.
A ship arrives with an infinite number of decks, each with an infinite number of sailors. Label the sailors on the
th
i
deck
S
i,1
,
S
i,2
,
S
i,3
,…
. To fit them all into the hotel, the hotel manager and the captain of the ship free the first deck by shifting all the sailors by one deck. They move the original hotel guests
g
n
to the first deck. The hotel is empty. The manager arranges the room numbers diagonally in a table. The original guests and the sailors go to the room assigned to them by the table. The
th
j
person on the
th
i
deck goes to the room that is in the table at row
i
and column
j
.