Solution:

74658

* 8 + 6 =14
* 5 - 4 = 1
* 7 = 2*4 - 1
* 4 + 6 = 10
* 7+4+6+5+8 = 30

Solution:

Both 3 and 4th

Explanation:
- The water in tank1 will get filled up to the connectivity of tank1 and the tank2 and then it will start flowing to tank2.
- The water in tank2 will get filled up to the connectivity of tank2 and the -tank3 and then it will start flowing to tank3.
- The water in tank3 will get filled up to the connectivity of tank2 and the tank3 and then it will start flowing to tank3.
- As the outlet of tank3 and inlet of tank4 are not at the same level, water will continue to fill tank3 till the inlet of tank4.
- Now both the tank3 and tank4 fill simultaneously until both fill together.

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:

Fifteen minutes can easily be measure using these two hour glasses.

Step 1: He will start both the hourglass.

Step 2: The moment the eleven minute hourglass is empty, he will invert it.

Step 3: When the thirteen minutes hourglass is empty, he will invert the eleven minute hourglass.
In step 3, we will have counted thirteen minutes. Since we inverted the eleven minute hourglass in step 2, it started from fresh and was inverted just for two minutes (13-11=2). In this manner when it is reversed when the thirteen minute hourglass is finished, it will have two minutes of sand left. This time when the sand finishes, he will have measured fifteen minutes. (13+2=15)

Solution:

2 minutes (duration between 9:59 and 10:01)

Solution:

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

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:

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:

Step 5 is invalid, because we are dividing by (x-y), and since x=y, we are thus dividing by 0. This is an invalid mathematical operation (division by 0), and so by not following basic mathematical rules

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:

3/7

Explanation:
If a 31day month starts on a Friday, Saturday or Sunday it will have five Sunday, if not it will have 4 Sunday.