Infinity Problem

Suppose you have a hotel which has one floor with infinite number of rooms in a row and all of them are occupied. A new customer wants to check in, how will you accommodate her? What if infinite number of people want to check in, how will you accommodate them then?

Hint: Define infinity. :)

Update (18/12/09): Solution in comments by Nikhil Pandey (CSE, IITB alumnus)

Comments

  1. Gold and Iron2:07 PM, December 16, 2009

    1) ask everyone to move to next room
    2) ask everyone to move from x->2x

    ????

    ReplyDelete
  2. Pratik Poddar12:29 AM, December 18, 2009

    pandeyji.. (@Gold and Iron)
    sahi jawaab.. dhanyawaad. :)

    Since there are infinite number of rooms and infinite+1= infinite
    Just ask person in room k to move to k+1. Thus making a room in the first room. :)

    In the other case, since infinite+infinite = infinite
    asking person in room k to move to 2k solves the problem.

    ReplyDelete
  3. The Sherminator1:24 PM, October 11, 2010

    Third part: Suppose infinite number of buses arrive at the hotel, each having infinite number of people, how will you accommodate them? :)

    ReplyDelete
  4. Pratik Poddar2:31 PM, October 11, 2010

    @Sherminator..
    Nice one..
    Since NxN is countable set. We can get a one to one mapping from N to NxN
    Hence, we can accommodate (infinite people X infinite buses) in the hotel.

    Relevant article:

    http://en.wikipedia.org/wiki/Cantor_pairing_function

    Thanks!

    ReplyDelete
  5. Unknown5:07 PM, October 02, 2014

    @Pratik . Infinite number of buses having infinite number of people would make the set N^N i.e. N x N x N..... N times...

    ReplyDelete
  6. Unknown5:10 PM, October 02, 2014

    Infinite Cartesian product of countable sets is uncountable

    ReplyDelete
  7. Unknown5:23 PM, October 02, 2014

    Oh got it . Its a countable union of countable set.

    ReplyDelete

Post a Comment

Popular posts from this blog

Fraction Brainteaser

Source: Sent to me by Gaurav Sinha Problem: Siddhant writes a Maths test and correctly answers 5 out of 6 Arithmetic questions and 20 out of 28 Geometry questions.  In total, Siddhant scores 25 out of 34.  Vaibhav writes another Maths test and correctly answers 20 out of 25 Arithmetic questions and 6 out of 9 Geometry questions. in total, Vaibhav scores 26 out of 34. Note that a) Vaibhav scores more than Siddhant b) Siddhant score better than Vaibhav in both individual topics -  5/6 > 20/25 and 20/28 > 6/9 How is it possible? 
Read more

Buying Dimsums

Source: Alok Goyal (Stellaris VP, Ex-Helion VC) puzzle blog Problem: A fast food restaurant sells dimsums in boxes of 7 and 3. What’s the greatest number of dimsums a person cannot buy. Generalize it for p and q where p and q are relatively prime. I loved the puzzle. Hope you enjoy it too.
Read more

Consecutive Heads

Let's say A keep tossing a fair coin, until he get 2 consecutive heads, define X to be the number of tosses for this process; B keep tossing another fair coin, until he get 3 consecutive heads, define Y to be the number of the tosses for this process. 1) Calculate P{X>Y} 2) What's the expected value of X 3) What's the expected value of Y This is probably the hardest puzzle I have ever put on my blog. Hence, I will post its solution in the post directly rather than on comment. Solution: 1) (Solved by me finally after 13 months :)) Make a state diagram. Let the state be (a,b) where a is the number of consecutive heads streak "A" is on currently and b is the number of consecutive heads streak "B" is on currently. So, (0,3) (1,3) are final accepted states and (2,0) (2,1) (2,2) (2,3) are failure states. If you get tails, your contribution to the state reaches to "0" f(State) = P(X>Y | "State" configuration initially)
Read more