Solution:

3 hours

Explanation :
(1/4 + 1/6 - 1/12) ^ (-1)
= (1/3)^(-1) = 3

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:

888 + 88 + 8 + 8 + 8 = 1000

Solution:

The teacher will use a simple trick to form a perfect impression. He will ask all his students to raise their hands on each of the question that is asked. But the only catch will be that those who knows the answer correctly will raise their right hand and others will raise their left hand.

In this way, the principal will see all the hands being raised for each question even though all won't be knowing the correct answer. The teacher will ask only those who know the answer and they will always be correct. So the principal will be impressed to full extent.

Solution:

She is near the trunk of the tree as shown below.

Solution:

10,15,9,20,12

Explanation:
The score obtained on the first throw is 10.
The score obtained on the second throw is 15.
The score obtained on the third throw is 9.
The score obtained on the fourth throw is 20.
The score obtained on the fifth throw is 12.

Solution:

The stranger said that he thought the room was his. If so, he must have had the keys to the room and thus he must not have knocked.

Solution:

10 prisoners must sample the wine. Bonus points if you worked out a way to ensure than no more than 8 prisoners die.

Number all bottles using binary digits. Assign each prisoner to one of the binary flags. Prisoners must take a sip from each bottle where their binary flag is set.

Here is how you would find one poisoned bottle out of eight total bottles of wine.

Bottle 1 Bottle 2 Bottle 3 Bottle 4 Bottle 5 Bottle 6 Bottle 7 Bottle 8
Prisoner A X X X X
Prisoner B X X X X
Prisoner C X X X X
In the above example, if all prisoners die, bottle 8 is bad. If none die, bottle 1 is bad. If A & B dies, bottle 4 is bad.

With ten people there are 1024 unique combination so you could test up to 1024 bottles of wine.

Each of the ten prisoners will take a small sip from about 500 bottles. Each sip should take no longer than 30 seconds and should be a very small amount. Small sips not only leave more wine for guests. Small sips also avoid death by alcohol poisoning. As long as each prisoner is administered about a milliliter from each bottle, they will only consume the equivalent of about one bottle of wine each.

Each prisoner will have at least a fifty percent chance of living. There is only one binary combination where all prisoners must sip from the wine. If there are ten prisoners then there are ten more combination where all but one prisoner must sip from the wine. By avoiding these two types of combination you can ensure no more than 8 prisoners die.

One viewer felt that this solution was in flagrant contempt of restaurant etiquette. The emperor paid for this wine, so there should be no need to prove to the guests that wine is the same as the label. I am not even sure if ancient wine even came with labels affixed. However, it is true that after leaving the wine open for a day, that this medieval wine will taste more like vinegar than it ever did. C'est la vie.

Solution:

Ganpat had a black suit and a brown suit.
Harish had a brown suit and a pink suit.
Manoj had a white suit and a black suit.
Tarun had a pink suit and a white suit.

Solution:

192 021

If you look at it as two-digit numbers you'll see:10 11 12 13 14 15 16 17 18 19 20 21

Solution:

== Mathematical Answer ==
Mathematical Answer = number of seconds in a minute * number of minute in an hour * number hour in a day * number of day in year
60 * 60 * 24 * 365 = 31536000
60 * 60 * 24 * 365.25 = 31557600 (if you want account for leap year)


== We are looking for trick answer (which is 24) ==
Every month contains only 2 second like
A) 2nd January ("second" January)
B) 22nd January (twenty"second" January)

Therefore 2 * 12 months = 24.