The challenge
The Grand Hotel has rooms numbered 1, 2, 3, 4, … going on forever. Tonight every single room is occupied. There are no empty rooms at all.
Work out a method for each of these situations, and explain why your method always works:
- One new guest arrives and asks for a room. Can you fit them in?
- A coach arrives carrying infinitely many new guests. Can you fit them all in?
How to get started
- Picture the rooms as a never-ending list. Ask not "where is there a gap?" but "can everyone move by a rule?"
- For one new guest, try asking every current guest to move along. Where could they all go?
- For infinitely many new guests, you need to free up infinitely many rooms at once — think about a rule based on each guest's room number.
- Write your rule as clearly as a set of instructions a receptionist could follow.
Stuck? Open a hint
Try the challenge first — then reveal these one at a time.
Hint 1
n to move to room n+1. Everybody still has a room (there's always a next one), and room 1 is now free.Hint 2
n to move to room 2n. Now every even room is taken by an old guest — and every odd room is empty.Hint 3
Take it further
Now the real test: infinitely many coaches arrive, each carrying infinitely many passengers. Can you still fit everyone? (Hint: prime numbers, or a zig-zag through a grid, can help.)
This puzzle is about countable infinity. Mathematician Georg Cantor proved some infinities are actually bigger than others — the infinity of decimal numbers can't be fitted into the hotel at all. Look up "Cantor's diagonal argument" and see if you can follow it.
Explore more puzzles like this at NRICH.
Produce & share
Make something: Write a clear explanation (a page, a poster, or a short video) of how you fit first one and then infinitely many new guests into the full hotel — and have a go at the infinitely-many-coaches extension. The test of a good explanation is that a younger student could follow it.
What you'll practise
Reasoning about infinity, thinking of operations as rules (functions and mappings), and constructing an argument that covers every case — the heart of mathematical proof.