Solution:

Move the coins as given in the figure and you will get the required result.

Solution:

NONE, holes are empty.

Solution:

Ms. Britney did it.

We will take up every person and analyze the statements over all of them one by one.

Case 1: Ms. Britney did it, then
Statement 1 => true
Statement 2 => false (as Rihanna did not do it)
Statement 3 => false (as Ms. Britney is lying)
Statement 4 => false (as Ms. Gwyneth is lying)
Our first guess itself was right but let us confirm our analysis by analyzing the statements over others.

Case 2: Ms. Rihanna did it, then
Statement 1 => false (as Ms. Britney did not do it)
Statement 2 => true
Statement 3 => true (as Ms. Britney is not lying)
As per the conditions, three statements had to be wrong but here, we have two statements right which clearly contradict the condition.

Case 3: Ms. Gwyneth did it, then
Statement 1 => false (as Ms. Britney did not do it)
Statement 2 => false (as Ms. Rihanna did not do it)
Statement 3 => false (as Ms. Britney is lying)
Statement 4 => false (as Ms. Gwyneth is lying)
She did not do it as all the statements are false.

Case 4: Ms. Yoon did it, then
Statement 1 => false (as Ms. Britney did not do it)
Statement 2 => false (as Ms. Rihanna did not do it)
Statement 3 => false (as Ms. Britney is lying)
Statement 4 => false (as Ms. Gwyneth is lying)
All four statements are false in her case as well thus she did not do it.

Therefore we have proved that Ms. Britney did it.

Solution:

So that the following plan can be followed, let us number the coins from 1 to 12. For the first weighing let us put on the left pan coins 1,2,3,4 and on the right pan coins 5,6,7,8.

There are two possibilities. Either they balance, or they don't. If they balance, then the different coin is in the group 9,10,11,12. So for our second one possibility is to weigh 9,10,11 against 1,2,3

(1) They balance, in which case you know 12 is the different coin, and you just weigh it against any other to determine whether it is heavy or light.
(2) 9,10,11 is heavy. In this case, you know that the different coin is 9, 10, or 11, and that that coin is heavy. Simply weigh 9 against 10; if they balance, 11 is the heavy coin. If not, the heavier one is the heavy coin.
(3) 9,10,11 is light. Proceed as in the step above, but the coin you're looking for is the light one.

That was the easy part.

What if the first weighing 1,2,3,4 vs 5,6,7,8 does not balance? Then any one of these coins could be the different coin. Now, in order to proceed, we must keep track of which side is heavy for each of the following weighings.

Suppose that 5,6,7,8 is the heavy side. We now weigh 1,5,6 against 2,7,8. If they balance, then the different coin is either 3 or 4. Weigh 4 against 9, a known good coin. If they balance then the different coin is 3, otherwise it is 4. The direction of the tilts can tell us whwther the offending coin is heavier or lighter.

Now, if 1,5,6 vs 2,7,8 does not balance, and 2,7,8 is the heavy side, then either 7 or 8 is a different, heavy coin, or 1 is a different, light coin.

For the third weighing, weigh 7 against 8. Whichever side is heavy is the different coin. If they balance, then 1 is the different coin. Should the weighing of 1,5, 6 vs 2,7,8 show 1,5,6 to be the heavy side, then either 5 or 6 is a different heavy coin or 2 is a light different coin. Weigh 5 against 6. The heavier one is the different coin. If they balance, then 2 is a different light coin.

Solution:

The girl was born on 29 February. Thus her birthday came once in four years only while her sister was born on a normal day and celebrated her birthday every year. Thus the girl had a chance of depositing money only 10 times in 4 years through which she collected $2500 while her sister took $50 from the piggy bank every year making the total amount to be $2000. Thus when the piggy bank was opened, it had just $500.

Solution:

7, 4, 6, 5, 8

Solution:

Karate Kid (car + at + tea + kid)

Solution:

The woman told him to take out one nut each from the rest of the wheels and use them.

Solution:

This statement is true but only in a specific case i.e. if both of the siblings continue to live till the day the younger is as old as the elder one was during the time of their birth.

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:

31

Explanation:
Ramanujan lighting the candles in binary.
11110 =30
11111 =31