Browse Teasers
Search Teasers

## Apartment Block Fire

Math brain teasers require computations to solve.

 Puzzle ID: #28484 Fun: (2.74) Difficulty: (2.67) Category: Math Submitted By: Dave

Dave, the janitor of an apartment block, notices that the boiler pressure is rising, and will shortly explode.
He phones two of the residents, tells them the news, asks them to do the same and phone just two more people, and then get out of the building.
Assume that each of the residents is in, and answers the phone immediately.
If each phone call takes 30 seconds, and it takes each person 90 seconds to get out of the building, how long will it take to empty all 375 apartments?

## What Next?

See another brain teaser just like this one...

Or, just get a random brain teaser

If you become a registered user you can vote on this brain teaser, keep track of
which ones you have seen, and even make your own.

 norcekri Feb 07, 2006 A classic application of the Fibonacci sequence; good choice! Jimbo Feb 10, 2006 A nice twist, summing the Fibonnacci series with a constant. Great puzzle! keveffect1 Feb 20, 2006 Yes, I have to agree MarcM1098 Dec 16, 2006 Good use of Fibonacci, but how does each person know who to call? i.e. What if B called A (A would be on the phone), or Z called A (A would be long gone)? jvs13 May 14, 2007 doesn't look right... shouldn't it be: Dave / \ A B 2 / \ / \ C D E F 4 /\ /\ /\ /\ G H I J K L M N 8 ... and so forth... so on the completion of the 7th step, 222 (2+4+8+16+32+64+12 people were informed. furthermore, during the 8th step, after 128 people made their first call, a total of 350 (222+12 people are already notified, hence only 25 phone calls are needed to complete the total of 375. At 30 second per call or 1 minute per step, 8 x 1min = 8 mins + 90 secs = 9 1/2 minutes. I humbly stand corrected. javaguru Feb 06, 2009 I made the same error as jvs13. I computed the slowest chain of a binary tree, but this is wrong. The teaser is correct, and a very nice one at that. I don't miss many of these. Good job! I did have the same quibble with the unrealistic perfect call sequence. It would have been good to provide a rationale, such as the call sequence was predetermined by the emergency evacuation plan. opqpop Sep 11, 2010 This is a fantastic problem. The key is to note at each 30 second mark, the people who were informed 30 seconds ago and people who were informed 60 seconds ago will inform a new person. Hence, we think of the fibonacci sequence. Since we're interested in the sum of a fibonacci sequence, it's handy to know the sum of the first n fibonacci terms = the (n+2)th term - 1, which is easily proved by induction. Because the fibonacci sequence here omits the first two terms (0 and 1), we correct the formula by subtracting 2 instead of 1. After listing the fibonaccis up to 377. We can see it takes 11 calls to inform everybody. Hence, the total time spent in seconds is 11 * 30 + 90 = 7 minutes. Thank you very much for the problem. jasp05 Mar 07, 2011 Am i misunderstanding the question. He says the first guy calls 2 ppl and asks the 2ppl he called to ring 2 other ppl each? so shouldnt it be 1,2, 4, 8, 16, 32 ppl notified?