Results 1 to 2 of 2

Math Help - Hilberts Hotel

  1. #1
    Member
    Joined
    May 2008
    Posts
    140

    Hilberts Hotel

    I came across this and problem and wanted to know how people would go about answering it.

    Recall that the Hilbert Hotel doors are numbered 1,2,3,.... Suppose the door to any room can be open or closed. We call these the two states of a door, and we suppose that initially all the doors are closed.

    A sequence of robots, R1, R2, R3,..., walk down the corridor, each having a simple program; the first robot, R1 changes the state of every second door and nothing else; R2 changes the state of every third door and does nothing else; in general Rk is to change the state of every (k+1)th door and does nothing else.

    a) Provide a succinct and precise reason why each door eventually reaches a final state: it will either be open or closed, depending on the room number.

    b) Determine a formula for the number of changes, Change(n), that the door to room n undergoes, in terms of the prime factorization of n.

    c) Using your formula for Change(n), what can you say about which doors have a final state that is open, and which have a final state that is closed?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,964
    Thanks
    1784
    Awards
    1
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. 3 guys go to a Hotel
    Posted in the Math Puzzles Forum
    Replies: 9
    Last Post: November 22nd 2011, 05:32 AM
  2. Reverse Engineering Hotel Industry Ratios
    Posted in the Algebra Forum
    Replies: 3
    Last Post: March 15th 2011, 12:27 PM
  3. Hilbert's Hotel is Troubling Me
    Posted in the Discrete Math Forum
    Replies: 9
    Last Post: November 15th 2009, 04:01 PM
  4. Hotel Rooms probability
    Posted in the Advanced Statistics Forum
    Replies: 10
    Last Post: July 27th 2006, 10:06 AM

Search Tags


/mathhelpforum @mathhelpforum