Solution:

2 hours.

In one hour, Anmol eats 27 pastries, Aakriti eats 12, and Divya eats 21. A total of 60 pastries. Therefore 120 pastries would take 120 ÷ 60 = 2 hours.

Solution:

3,3,8

Lets break it down. The product of their ages is 72. So what are the possible choices?

2, 2, 18 sum(2, 2, 18) = 22
2, 4, 9 sum(2, 4, 9) = 15
2, 6, 6 sum(2, 6, 6) = 14
2, 3, 12 sum(2, 3, 12) = 17
3, 4, 6 sum(3, 4, 6) = 13
3, 3, 8 sum(3, 3, 8 ) = 14
1, 8, 9 sum(1,8,9) = 18
1, 3, 24 sum(1, 3, 24) = 28
1, 4, 18 sum(1, 4, 18) = 23
1, 2, 36 sum(1, 2, 36) = 39
1, 6, 12 sum(1, 6, 12) = 19

The sum of their ages is the same as your birth date. That could be anything from 1 to 31 but the fact that Torres was unable to find out the ages, it means there are two or more combinations with the same sum. From the choices above, only two of them are possible now.

2, 6, 6 sum(2, 6, 6) = 14
3, 3, 8 sum(3, 3, 8 ) = 14

Since the eldest kid is taking piano lessons, we can eliminate combination 1 since there are two eldest ones. The answer is 3, 3 and 8.

Solution:

Flyball should pay Lavy $11 instead of accepting his counter offer as in that case the club will end up paying almost double the amount.

Solution:

If you see the picture, they formed a pentagonal shape and achieved the required.

Solution:

99 matches.

The number of matches will always sum up to one less than the number of players in a knock out tournament. You may calculate it in any manner. Thus 99 matches were played.

Solution:

Step one: First you will have to make 3 trips of 1,000 apples 333 miles. Then you will be left with 2,001 apples and 667 miles to go.

Step two: Next you will have to take 2 trips of 1,000 apples 500 miles. In this manner you will be left with 1,000 apples and 167 miles to go (you have to leave an apple behind).

Step three: At last, you will have to travel the last 167 miles with one load of 1,000 apples and you will be left with 833 apples when you reach the town

Solution:

The first step that they will take will be a leap of logic. What it means is that they will deduce that every color must appear twice at least. Why? Because the master logician has assured them that the puzzle will not be impossible for anyone of them. And if a color appears only once in the circle, the person wearing it will have no clue about that color which will not be fair for him.

Then the logicians will follow the same and look for all the colors of hats in the circle. If one of them sees a color just once, he can safely assume that he is also wearing the hat of the same color as by leap of logic, no color can appear just once. Thus when the bell is rung, he will leave.

In the similar fashion, if anyone sees another color just once, he can determine that he is wearing the hat of the same color and will leave when the bell rings or will be disqualified and sent home. Unvaryingly, if a color is seen twice, they will be eliminated after the first bell. Hence, there must be at least three hats of any of the remaining color.

Assume that you are sitting in the circle and you don’t see a color once but see it twice. Then if they were the only two hats of the same color, the logicians must have left at the first bell already. But they did not. Which means that there are three hats of that color and you are wearing one. Thus you will leave after the second bell.

Solution:

The women is a of short stature. She can't reach the upper elevator buttons, but can push is with his umbrella.

Solution:

The Lady sitting in the chair has the detector attached to the back of her blouse.

Solution:

Michelangelo juggles the diamonds across while crossing the bridge.

Solution:

They were playing tennis.

Tiger Phil
30 - 30
40 - 30 (Phil hit a bad shot)
Game won - 30 (Tiger hit an awesome shot)