Solution:

A thermometer

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:

It can be down as shown below.

Solution:

The 100th statement for sure is incorrect because it says that at least 100 of the statements are incorrect.

Suppose if that is correct, then 100 statements cannot be true.
This suggests that the 100th statement is incorrect and that the first statement is true.

Similarly 99 statements cannot be true because if they were true, then two statements would become correct i.e. the 1st and the 99th.
But the 99th statement says that at least 99 are incorrect.
This suggests that the 99th statement is incorrect and that 2ndone is true.

If we keep analyzing is the same way till the end, we will find out that only the first fifty statements are true and all the remaining ones are incorrect.

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:

60 minutes

Explanation:
Roy will be able to consume all the five tablets in an hour.

Tablet 1 will be taken in 0 min.
Tablet 2 will be taken in 15 min.
Tablet 3 will be taken in 30 min.
Tablet 4 will be taken in 45 min.
Tablet 5 will be taken in 60 min.

Solution:

Anybody will prefer the shop in the eastern market for sure. There are two reasons for it:
Firstly, since there are only two barbers in the town, the one running the shop in eastern market must have gotten his hair done by the one running the shop in the northern market and vice versa. Thus, if the barber in the eastern market has a shabby haircut, it must be due to the incompatibility.
Secondly, the neat and clean shop can be due to the scarcity of customers as well. While the untidy place refers to the fact that so many customers get their hair done in that shop.

Thus any one will opt for the barber shop in the eastern market.

Solution:

16-days

In 15-days, he will climb 15-inch and when he climbs 5 inch more, he will be out of the well :-)

Solution:

All Digits [0-9] follow the following pattern: There is one occurrence of all digits in every 10 numbers Example. Digit-9 occurred one time between 10 and 19 in 9, between 20 and 29 in 29
However, for tens(91,92,93...99) and hundreds (900,901.... 999), the occurrence is much more. Since we have included 1000, Therefor 1 is the most occurred digit.
Note: Despite three '0s' in 1000, 0 is not most occurred digit as they don't have tens and hundreds like other digits.

Solution:

Karate Kid (car + at + tea + kid)

Solution:

5 leopard and one sheep

since all animal are rational , once 1st leopard eats the sheep all the rest of leopard would know about this.