Solution:

72(18*4)

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:

Take 10 number of cards in a new deck and change their face direction. For example- You create a new deck of 10 cards and out of 10, 3 faces up in the new deck. So remaining 7 faces up are in the old deck. But hey! while creating the new deck you reversed the face direction of new cards. So actually the 3 cards which were facing up are actually face down in the new deck while 7 faces up.

Solution:

Daughter.

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.

Solution:

Yes, some people are going get really tiny pieces but you were allowed for that right. Also, there is another way of doing it. Can you think of it?

Solution:

This puzzle has no answer if you are considering this figure in a 2d domain. However if you follow it on a three-dimensional plane, you can do it like shown in the figure given.

Solution:

First fill the 8 liters jug complete - 4, 8, 0
Fill the 5 liters jug with 8 liters jug - 4, 3, 5
Pour back the beer from 5 liters jug to 12 liters jug - 9, 3, 0
Pour the 3 liters from 8 liters jug to 5 liters jug - 9, 0, 3
Fill the 8 liters jug completely from 12 liters jug - 1, 8, 3
Fill the 5 liters jug from the 8 liters jug - 1, 6, 5
Pour the entire 5 liters jug back in 12 liters jug - 6, 6, 0

You have successfully split the beer into two equal parts.

Solution:

One of the cop will move clockwise while the other will move anti-clockwise every day. In such a manner, they will catch the thief in minimum seven days.

Solution:

There is no reason whatever why the customer's original deposit of Rs.100 should equal the total of the balances left after each withdrawal.
The total of withdrawals in the left-hand colum may equal Rs.100, but is is purely coincidence that the total of the right-hand column is close to Rs.100.
Let us show another example, but starting with Rs.200 in the bank:
Withdrawals Balance left
Rs.50 Rs.150
Rs.25 Rs.125
Rs.10 Rs.115
Rs.8 Rs.107
Rs.5 Rs.102
Rs.2 Rs.100
Rs.100 Rs.699
Moral of this story? Don't Total Balances

Solution:

-3 -1 1

Explanation:
-3 * 1 * -1 = 3(prime)
-1 - (-3) = 1 -(-1) = 2