Problem #83 HARD

The Infinite Hotel Upgrade

Apple Adobe Infinity Math

Problem Statement

A hotel has countably infinite rooms numbered 1, 2, 3, ... All rooms are occupied. The manager receives three new guest groups simultaneously: a finite group of 7 guests, a countably infinite group (one guest per positive integer), and a group whose size is the set of all real numbers between 0 and 1. Can the manager accommodate all three groups? Which groups can be accommodated and which cannot?

Answer & Quick Explanation

Think you've got it? Click below to check your answer.

The 7 finite guests: yes (shift everyone up 7). The countably infinite group: yes (move guests to even rooms, new group takes odd rooms). The real-number group: NO — the interval (0,1) is uncountably infinite, strictly larger than the hotel's countably infinite capacity. Cantor's diagonal argument proves no bijection exists.

Detailed Editorial Solution

Want to see the step-by-step breakdown? Click below to reveal the editorial.

Different sizes of infinity: countably infinite (aleph-null, size of natural numbers) vs uncountably infinite (aleph-one, size of real numbers). The hotel has aleph-null rooms. You can fit anything countable; you cannot fit an uncountable set. Step 1: Finite group (7 guests): Ask every current guest to move from room n to room n+7. Rooms 1-7 are now free. The 7 new guests check in. Step 2: Countably infinite group: Simultaneously with the finite group (or after), move current guests from room n to room 2n (even rooms). All odd rooms (1,3,5,...) become free — countably infinitely many. The infinite group checks into odd rooms. Step 3: Combining both moves: move current guests to room 2n+14 (even rooms ≥ 16). Rooms 1-14 free for 7 guests + 7 buffer. Odd rooms 15,17,19,... for infinite group. More elegantly, use Cantor pairing to encode all new guests into a single countable sequence. Step 4: Real-number group: The interval (0,1) has the cardinality of the continuum — it is uncountably infinite. Cantor's diagonal argument proves there is no bijection between (0,1) and the natural numbers. Step 5: Cantor's diagonal proof: Suppose we listed all reals in (0,1) as r1, r2, r3,... Construct a new number d where d's nth decimal digit differs from rn's nth digit. Then d ≠ rn for all n — d is not in the list. Contradiction. No complete listing exists. Step 6: Conclusion: The hotel (countably infinite rooms) cannot accommodate an uncountably infinite group. There simply are not enough rooms — not because the hotel is small, but because uncountable infinity is fundamentally larger than countable infinity. Key Insight: Cantor's theorem — that the real numbers are strictly more numerous than the natural numbers — was revolutionary and initially controversial. The diagonal argument is one of the most elegant proofs in mathematics: it shows that any attempted list of reals is necessarily incomplete, by constructing a real number that differs from every entry on the list.