Comments by "eggynack" (@eggynack) on "TED-Ed" channel.

  1. 1
  2. 1
  3. 1
  4. 1
  5. 1
  6. 1
  7. 1
  8. 1
  9. 1
  10. 1
  11. 1
  12. 1
  13. 1
  14. 1
  15.  @jayjeckel  No, I can do it because I already did it. It is what is called in math a constructive proof. You prove that a thing can be done by doing it. In this case, the question is whether there is a bijective mapping from all the guests in the full hotel plus one additional guest to the rooms in the full hotel. And there is one. In particular, this mapping is that guest n, where the new guest is guest 0, goes to room n+1. Clean bijective mapping. No new rooms or initially unoccupied rooms needed. It might be easier for you to get a handle on it if we ditch the hotel for something more abstract. There are infinitely many primes, right? It makes sense, then, to talk about the first prime, the second prime, the fifth prime, the 100th prime. In fact, no matter which prime you want, it'll be there. Because there are infinitely many of them. What this means, however, is that there is a one to one mapping from natural numbers to primes. The first prime goes to one, the fifth prime goes to five, the 100th prime goes to 100, and so on. Every natural and every prime is accounted for exactly once each. We can, if we want, extend this reasoning back to the hotel. There's a guest for each natural number, because they're assigned to the natural numbered rooms. We can, therefore, cleanly map the guests in this full hotel to only the prime numbered rooms. This leaves us with infinitely many empty rooms, all the composite numbered ones (which are also infinite), and all just by moving people.
    1
  16. 1
  17. 1
  18. 1
  19. 1
  20. 1
  21. 1
  22. 1
  23. 1
  24. 1
  25. 1
  26. 1
  27. 1
  28. 1
  29. 1
  30. 1
  31. 1
  32. 1
  33. 1
  34. 1
  35. 1
  36. 1
  37. 1
  38. 1
  39. 1
  40. 1
  41. 1
  42. 1
  43. 1
  44. 1
  45. 1
  46. 1
  47. 1
  48. 1
  49. 1
  50. 1