Hilbert's Hotel Paradox: Guests moving to new room every day? Suppose there are infinitely many coaches with infinitely many members in each coach. They stay at the hotel for infinitely many days. I know that guests can be accommodated using various methods like the prime powers method, but there's a slight variation in the question which is that the guests have to change their room every day such that one guest can't occupy the same room again (i.e., they have to occupy unique rooms every day). How can we achieve that? 
I tried solving the problem using the following method:


*

*I allotted rooms using the prime powers method.

*The next day, guests move from their current room $x$ to the new room $x+c$.
I'm struggling after this step. Can someone please help me out?
 A: Have guest $i$ on day $j$ stay in room number $p_i^j$, where $p_i$ is the $i$'th prime. The fundamental theorem of arithmetic shows that each guest stays in a unique room compared to all other guests and to their own previous occupied rooms.
Update: As reminded by Will Orrick's comment below, I should have been clear about how to appropriately assign specific guest identifiers ($i$ used above) for the "infinitely many coaches with infinitely many members in each coach". This assumes all of the coaches arrive & can be accessed at the same time, as even the tiniest finite delay in time between coaches means not all of the coaches can arrive in one day. With this assumption, let $c_{m,n}$ be the $n$'th member of coach $m$, with $m,n \ge 1$. Next, order the coach members as shown below
$$\begin{array}
0c_{1,1} & c_{1,2} & c_{1,3} & c_{1,4} & c_{1,5} & \dots\\
c_{2,1} & c_{2,2} & c_{2,3} & c_{2,4} & c_{2,5} & \dots\\
c_{3,1} & c_{3,2} & c_{3,3} & c_{3,4} & c_{3,5} & \dots\\
c_{4,1} & c_{4,2} & c_{4,3} & c_{4,4} & c_{4,5} & \dots\\
c_{5,1} & c_{5,2} & c_{5,3} & c_{5,4} & c_{5,5} & \dots\\
\vdots & \vdots & \vdots & \vdots & \vdots & \ddots
\end{array}$$
Assign each guest number in turn, start at $i = 1$ at $c_{1,1}$, then going right to $c_{1,2}$ (for $i = 2$), down to $c_{2,2}$ (for $i = 3$), left to $c_{2,1}$, then down to $c_{3,1}$, right until $c_{3,3}$, then up until $c_{1,3}$, then right to $c_{1,4}$, then down to $c_{4,4}$, then left to $c_{4,1}$, etc. As you can see, this snakelike type pattern will cover all of the entries above (by going through all entries of the edges of an increasing square-like pattern), and will eventually get to any $c_{m,n}$ coach member exactly once. This shows one bijection (among other possible ones) between the assigned guest numbers and all of the infinitely many coach members among all of the infinitely many coaches.
Note the method I used is similar to some arguments used to prove the cardinality of the set of rational numbers is the same as the set of the integers, like what this answer of All sets of rational numbers are bigger than the set containing infinite integers - or are they? uses.
A: There's another option.  With the Prime Powers method, you're relying on:


*

*No prime, to any power, is equal to any other prime to any power.


Which makes if you think about it from a prime factorization perspective.  Each number has exactly one prime factorization.  So if you generate a number by taking a prime number X to the power of Y - it's factorization is X, Y times.  That'll obviously be a different prime factorization than a prime number A to the Bth power.
But once you think about it in terms of prime factorization, you'll realize you've got a lot of open space.  After all... the 6th room will never be filled.
Why?  Because 6's prime factorization involves two different primes - so you can't get to it by taking any prime X to the power Y.
So - you've got an infinite number of coaches with an infinite number of people... and they're arriving every day to stay forever?
On the first day, you're set.  Each coach gets a different prime number, and each person from that coach gets a different power of that prime.
The second day?  Each coach gets a different prime and the next prime higher than it, multiplied together.  So the first coach gets 6 - and each of its infinite occupants gets a different power of 6.  The next coach gets 15 (3x5).  The third coach gets 35 (5x7).
The third day?  Each coach gets a different prime and the second prime after it.  (So the coaches that day would be: 10, 21, 55, ...) Fourth day?  Each coach gets a different prime and the third prime after it.  (So the coaches would be: 14, 33, 65, ...)
You've got an infinite number of days covered.
In fact... we covered those infinite days simply by using only two different primes.
(We don't even have to stop there.  Imagine we were asked to solve this problem... across an infinite number of universes.  Universe #1 uses two primes.  Universe #2 uses three primes.  Universe #4 uses four primes.  Etc.)
A: A far simpler approach than prime powers is as follows. Number the rooms starting from $0$. Each day,


*

*guests in even-numbered rooms move two rooms up

*guests in odd-numbered rooms move two rooms down, except for the one in room $1$, who moves to room $0$
This creates an infinite cycle linking every room, on which all guests move:
$$\dots\to5\to3\to1\to0\to2\to4\to6\cdots$$
So not only is it possible to have all guests occupy different rooms on infinitely many days, it is possible to achieve full utilisation while doing so for all eternity.

If all rooms can only ever be occupied by at most one guest, the following construction (also simpler than prime powers) still ensures that every room is eventually used. Arrange the rooms in an array like this, and this time start from $1$:
$$\begin{array}
01&2&4&7&11&\dots\\
3&5&8&12&17&\dots\\
6&9&13&18&24&\dots\\
10&14&19&25&32&\dots\\
15&20&26&33&41&\dots\\
\vdots&\vdots&\vdots&\vdots&\vdots&\ddots\end{array}$$
On the first day, the guests stay in triangular-numbered rooms, i.e. the first column of the above array. Each subsequent day, all guests move to the room that is to their immediate right in the array, e.g. $6$ moves to $9$, then to $13$ and $18$, etc.

Both solutions here are based on canonical bijections to $\mathbb N$, from $\mathbb Z$ and $\mathbb N^2$ respectively.
