What is the fewest number of aircraft necessary to get one plane all the way around the world assuming that all of the aircraft must return safely to the airport? How did you get to your answer? Though the fuel is unlimited, the island is the only source of fuel.
The planes have the ability to refuel in flight without loss of speed or spillage of fuel. Each airplane has a fuel capacity to allow it to fly exactly 1/2 way around the world, along a great circle. The airport is the homebase of an unlimited number of identical airplanes. The puzzle question is : On Bagshot Island, there is an airport. move up 14 then 13, then 12 floors, etc) until it breaks (or doesn't at 100) From the above table we can see that the optimal one will be needing 0 linear trials in the last step. Now finding out the optimal one we can see that we could have done it in either 15 or 14 drops only but how can we find the optimal one. and we can figure out whether we can find out whether we can figure out the floor in 16 drops.ġ + 15 16 if breaks at 16 checks from 1 to 15 in 15 dropsġ + 14 31 if breaks at 31 checks from 17 to 30 in 14 dropsġ + 8 100 We can easily do in the end as we have enough drops to accomplish the task Now if it did not break then we have left 13 drops. The reason being if it breaks at 32nd floor we can try all the floors from 17 to 31 in 14 drops (total of 16 drops). First we drop from height 16,and if it breaks we try all floors from 1 to 15.If the egg don’t break then we have left 15 drops, so we will drop it from 16+15+1 =32nd floor. Lets see whether we can find out the height in 16 drops. That I need 16 drops to find out the answer. Taking an example, lets say 16 is my answer. And now if the first drop of the first egg doesn’t breaks we can have x-2 drops for the second egg if the first egg breaks in the second drop. So we have determined that for a given x we must drop the first ball from x height. So if the first egg breaks maximum we can have x-1 drops and so we must always put the first egg from height x.
Let x be the answer we want, the number of drops required.
0 kommentar(er)
