Timeline for Hilbert's Hotel Paradox: Guests moving to new room every day?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 14, 2020 at 23:36 | history | edited | John Omielan | CC BY-SA 4.0 |
Add some more details.
|
| Apr 14, 2020 at 23:26 | comment | added | John Omielan | @WillOrrick Thanks for your feedback. You're right, I should have been explicit about that. I've updated my answer to address this issue. | |
| Apr 14, 2020 at 23:25 | history | edited | John Omielan | CC BY-SA 4.0 |
Add details of a bijection of how to assign guest numbers to the infinitely many coaches with infinitely many members in each coach.
|
| Apr 14, 2020 at 22:47 | comment | added | Will Orrick | Does this answer completely answer the question? I'm not seeing where it addresses the issue of the guests arriving in infinitely many coaches, each holding infinitely many passengers. This will affect how you assign the guests to rooms on the first night. | |
| Apr 14, 2020 at 5:43 | comment | added | Parcly Taxel | @aussiegirl1995 See my answer. | |
| Apr 14, 2020 at 5:11 | comment | added | aussiegirl1995 | could you suggest a way allocating rooms apart from the prime powers method such that I can use the addition or subtraction operation to calculate new unique rooms everyday? | |
| Apr 14, 2020 at 5:11 | comment | added | John Omielan | @aussiegirl1995 You're welcome. I haven't given it much thought, but I don't think you will be able to determine a sequence where you add or subtract a fixed number. I believe even using some variable number instead will at least be quite difficult as well. Nonetheless, there are many very talented & knowledgeable members here, so somebody may come up with a system like that. | |
| Apr 14, 2020 at 5:08 | comment | added | aussiegirl1995 | thank you so much! But i was wondering if we could come up with a sequence such that if we add or subtract any number from the elements, we get a unique room everyday | |
| Apr 14, 2020 at 5:06 | history | answered | John Omielan | CC BY-SA 4.0 |