Solution:

Steps:
* Start both sand measuring glasses at the same time.
* You flip over the small sand hourglass when it finishes the first 5 hours.
* Flip over the large one when it finishes its first 7 hours.
* When the small sand hourglass runs to 10 hours, flip over the small and large sand hourglass at the same time. It means the large sand hourglass will run 3 hours again. When the large sand hourglass run to 13 hours (7 + 3 + 3), flip both the small and large sand hourglass over again to run another 3 hours.

Solution:

So let’s think this through. The rats can only avoid a collision if they all decide to move in the same direction (either clockwise or rati-clockwise). If the rats do not pick the same direction, there will definitely be a collision. Each rat has the option to either move clockwise or rati-clockwise. There is a one in two chance that an rat decides to pick a particular direction. Using simple probability calculations, we can determine the probability of no collision.

Solution:

answer is: 14

Let x be the answer we want, the number of drops required.

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. So we have determined that for a given x we must drop the first ball from x height. 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.

Taking an example, lets say 16 is my answer. That I need 16 drops to find out the answer. Lets see whether we can find out the height in 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. 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). Now if it did not break then we have left 13 drops. and we can figure out whether we can find out whether we can figure out the floor in 16 drops.

Lets take the case with 16 as the answer

1 + 15 16 if breaks at 16 checks from 1 to 15 in 15 drops
1 + 14 31 if breaks at 31 checks from 17 to 30 in 14 drops
1 + 13 45 .....
1 + 12 58
1 + 11 70
1 + 10 81
1 + 9 91
1 + 8 100 We can easily do in the end as we have enough drops to accomplish the task


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. From the above table we can see that the optimal one will be needing 0 linear trials in the last step.

So we could write it as

(1+p) + (1+(p-1))+ (1+(p-2)) + .........+ (1+0) >= 100.

Let 1+p=q which is the answer we are looking for

q (q+1)/2 >=100

Solving for 100 you get q=14.
So the answer is: 14
Drop first orb from floors 14, 27, 39, 50, 60, 69, 77, 84, 90, 95, 99, 100... (i.e. move up 14 then 13, then 12 floors, etc) until it breaks (or doesn't at 100)

Solution:

Fatty and Fatty ->
<- Fatty

Slimy ->
<- Fatty
Fatty and Fatty ->
<- Fatty
Slimy ->
<- Fatty
Fatty and Fatty ->

Solution:

Four

three placed flat on the table in a triangle(touching each other) and put the fourth one on top of them in the middle.