0 Members and 1 Guest are viewing this topic.

GeEez!!... What happened to this thread?? :WTF:Now calm down girls! :LolLolLolLol:

Okay everyone, I do believe I've got a grip on this. It's a puzzle! Here we go:Puzzle: There are two identical crystal balls and one needs to find out which is the maximum floor in a 100 storey building from where the balls can fall before they break. In the most efficient way, what will be the maximum number of drops required to find the right floor in any possible scenario? The balls are allowed to be broken (if required) while finding the right floor.Solution: The maximum drops required will be 14 to find the right floor considering all possible scenarios.The approach should be to drop the first crystal ball from a floor and if it breaks then try dropping the second crystal ball (of course until it breaks) from the floor next to the previously tested floor until one less than that floor from where the first crystal ball broke when dropped.In the most efficient way, the maximum number of trials needed should be kept to the minimum possible. We have a maximum of 100 floors, so we need to divide these floors in such a way that the sum of the number of trials consumed by first crystal ball and that of the second crystal ball (if the first breaks) remains the minimum. For this to happen we need to reduce the difference between the previously tested floor and the next floor to test the first ball from every time by 1 as the first balls has already been dropped by those many times. Confused? Let's try to understand it this way: Suppose we drop the first ball from the Nth floor for the first time then we'll require a maximum of N drops if the first ball breaks as in this case the second ball will be tried from floor #1 to floor #(N-1). If the first ball doesn't break then we'll have to select the next floor to test the drop of the first ball from. This can't be more than (N-i) from the previously tested floor where i = 1 ... N-1 for every subsequent step in this order only. Reason being, if we test the first ball from a higher floor and if the ball breaks then we may require to test the second ball more number of times and hence the maximum attempts may exceed N in this case. Similarly, if we test the first ball from a lower floor then we'll require to test the first ball more than N times if it doesn't break at all.Obviously this N will of course be dependent upon the maximum number of floors which is 100 in our case. Putting N = 14, we will require the first ball test from floor #14, #(14 + 14 - 1 = 27), #(27 + 14 - 2 = 39), #(39 + 14 - 3 = 50), #(50 + 14 - 4 = 60), #(60 + 14 - 5 = 69), #(69 + 14 - 6 = 77), #(77 + 14 - 7 = 84), #(84 + 14 - 8 = 90), #(90 + 14 - 9 = 95), #(95 + 14 - 10 = 99), and finally from #100. The test will continue until we reach #100 OR the first ball breaks in which case the second crystal ball will be used for the floors lying between the floor where the first ball breaks and the previously tested floor.I doubt if there is any easy formula to find out this number N, but we can certainly reach this by using a heuristic approach. As we move on we consume trials at every stage and this should always be kept in mind. This is the reason why we can't keep the difference between the previously tested floor and the next floor to test from as constant for the first crystal ball drop.For N = 14, if the first ball doesn't break at all then we need to try a maximum of 12 times and if it breaks the very first time itself then we may require to try a maximum of 14 times (1 by the first ball from floor #14 and a maximum of 13 by the second ball from floor #1 ... #13). Similarly, if the first ball breaks at floor #27 then maximum attempts required will again be 14 (2 by first ... [from floor #14 and from floor #27] plus 12 by second [from floor #15 ... floor #26]). And and so on. Thus we see that in this case if the first ball breaks at any of the floors then we need a maximum of 14 attempts to figure out the correct floor and if it doesn't break at all then we'll done with a maximum of 12 attempts only.The answer is: Which floor?

You are not allowed to view links. Register or Login@Souza maybe it's different but still you made me think about my "Bob" lol, obviously another user here. Different personality, maybe, but definitely a Virgo.It just stroke me the "old guy" thing. Could be a coincidence though.wow. comparing notes is the most amusing part of any girlish party. it may sound as a bad joke, but every gal in the hoax has her own 'Bob', lol. (statistic observation.) well, let's all start writing here our hidden messages to 'Bob'. lolMmm, although, I've got a feeling, that 'Bob' may dislike it..Or, au contraire, he may be in awe (haven't decided yet) -- it's a funniest show after all. lol :icon_lol:.......................* Bob, son of the bitch, call me!!! :thjajaja121:

@Souza maybe it's different but still you made me think about my "Bob" lol, obviously another user here. Different personality, maybe, but definitely a Virgo.It just stroke me the "old guy" thing. Could be a coincidence though.

@It's her.... Thanks darling ! :bearhug:***"Doctor, doctor, gimme the news! ...I've got a BAAAAAD case of loving you!"*** @It's her.... by chance... are you talking about me !? :LolLolLolLol: :thjajaja121:Um...yeeeesss...but it's also a :icon_albino: Pandemic!! :TongueOutSmiley:

You are not allowed to view links. Register or LoginOkay everyone, I do believe I've got a grip on this. It's a puzzle! Here we go:Puzzle: There are two identical crystal balls and one needs to find out which is the maximum floor in a 100 storey building from where the balls can fall before they break. In the most efficient way, what will be the maximum number of drops required to find the right floor in any possible scenario? The balls are allowed to be broken (if required) while finding the right floor.Solution: The maximum drops required will be 14 to find the right floor considering all possible scenarios.The approach should be to drop the first crystal ball from a floor and if it breaks then try dropping the second crystal ball (of course until it breaks) from the floor next to the previously tested floor until one less than that floor from where the first crystal ball broke when dropped.In the most efficient way, the maximum number of trials needed should be kept to the minimum possible. We have a maximum of 100 floors, so we need to divide these floors in such a way that the sum of the number of trials consumed by first crystal ball and that of the second crystal ball (if the first breaks) remains the minimum. For this to happen we need to reduce the difference between the previously tested floor and the next floor to test the first ball from every time by 1 as the first balls has already been dropped by those many times. Confused? Let's try to understand it this way: Suppose we drop the first ball from the Nth floor for the first time then we'll require a maximum of N drops if the first ball breaks as in this case the second ball will be tried from floor #1 to floor #(N-1). If the first ball doesn't break then we'll have to select the next floor to test the drop of the first ball from. This can't be more than (N-i) from the previously tested floor where i = 1 ... N-1 for every subsequent step in this order only. Reason being, if we test the first ball from a higher floor and if the ball breaks then we may require to test the second ball more number of times and hence the maximum attempts may exceed N in this case. Similarly, if we test the first ball from a lower floor then we'll require to test the first ball more than N times if it doesn't break at all.Obviously this N will of course be dependent upon the maximum number of floors which is 100 in our case. Putting N = 14, we will require the first ball test from floor #14, #(14 + 14 - 1 = 27), #(27 + 14 - 2 = 39), #(39 + 14 - 3 = 50), #(50 + 14 - 4 = 60), #(60 + 14 - 5 = 69), #(69 + 14 - 6 = 77), #(77 + 14 - 7 = 84), #(84 + 14 - 8 = 90), #(90 + 14 - 9 = 95), #(95 + 14 - 10 = 99), and finally from #100. The test will continue until we reach #100 OR the first ball breaks in which case the second crystal ball will be used for the floors lying between the floor where the first ball breaks and the previously tested floor.I doubt if there is any easy formula to find out this number N, but we can certainly reach this by using a heuristic approach. As we move on we consume trials at every stage and this should always be kept in mind. This is the reason why we can't keep the difference between the previously tested floor and the next floor to test from as constant for the first crystal ball drop.For N = 14, if the first ball doesn't break at all then we need to try a maximum of 12 times and if it breaks the very first time itself then we may require to try a maximum of 14 times (1 by the first ball from floor #14 and a maximum of 13 by the second ball from floor #1 ... #13). Similarly, if the first ball breaks at floor #27 then maximum attempts required will again be 14 (2 by first ... [from floor #14 and from floor #27] plus 12 by second [from floor #15 ... floor #26]). And and so on. Thus we see that in this case if the first ball breaks at any of the floors then we need a maximum of 14 attempts to figure out the correct floor and if it doesn't break at all then we'll done with a maximum of 12 attempts only.The answer is: Which floor? You just split the maximum number of floors. If 100 floors, you will drop your first ball at 50. If it breaks, you know you have to test floor 1-49, if not then you test floor 51-100. Let's say it breaks at 50, you then drop it at 25. Let's say it breaks at 25, you drop at 12, etc.Drop 1: floor 50, breaksDrop 2: floor 25, breaks notDrop 3:narrowed down to floor 26-49, lets say 38, breaksDrop 4: between 26 and 37, 32, doesn't breakDrop 5: between 33 and 37 so 35, breaksDrop 6: either 33 or 34, we pick 33 and it breaks notDrop 7: will be the last option (34). If it breaks, your answer is 33, if not your answer is 34.So the only thing you can calculate is the most efficient maximum amount of drops, which is 7, not 14. You can't possibly know which floor, because that depends on the size and the density of the balls, the height of the building and each individual floor, the weight of the balls and the material of the floor. If you throw it down on a big pile of matrasses, chances are it will never break, if you throw it on concrete it will probably break if you throw it off the first floor.

Started by *Mo* « 1 2 ... 7 8 » Dave Dave

Started by TruthBeTold « 1 2 ... 36 37 » Other Odd Things

Started by mykidsmum « 1 2 ... 35 36 » The Coroner and Autopsy Report

Started by *Mo* Pictures & Videos of Michael

Started by Melzy777 James Brown