Solution:

The clock has the letter B instead of the number 8.

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:

1/3

Explanation
Assuming T1 is the Toy for brother1, T2 is the toy for brother2 and T3 is the toy for brother3.

Following are the possible cases for toys distribution:

Boy1 Boy2 Boy3
T1 T2 T3
T1 T3 T2
T2 T1 T3
T2 T3 T1 .... (A)
T3 T1 T2 .... (B)
T3 T2 T1

In both steps (A) & (B), no one gets the correct toy.
Therefore probability that none brother can get the own toy is 2/6 = 1/3

Solution:

LOTTO

Explanation:
Just flip the two rows 1 and 2 vertically, you will find the word "Lotto".

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:

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:

45 minutes

Explanation :
All you have to do is burn the first rope from both the ends and the second rope from one end only simultaneously. The first rope will burn in 30 minutes (half of an hour since we burned from both sides) while the other rope would have burnt half. At this moment, light the second rope from the other end as well. Where, the second rope would have taken half an hour more to burn completely, it will take just 15 minutes as we have lit it from the other end too.

Thus you have successfully calculated 30+15 = 45 minutes with the help of the two given ropes.

Solution:

19

Explanation:
The children can purchase 19 chocolates in return.

Out of 77 wrappers, 75 will be used to buy 15 chocolates and two will be left spare.
The 15 chocolates will create 15 empty wrappers that can be exchanged to get three chocolates.
Three chocolates will return three wrappers which will help them buy another chocolate.
Now the wrapper from this chocolate and the two spare that were left earlier will get them another chocolate.
15 + 3 + 1 = 19

Solution:

31

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

Solution:

The two numbers are 4 and 13 whose product is 52 and sum is 17.

Solution:

The guard and the prisoner cross the river
The guard comes back
The guard and the girl cross the river.
The guard and the prisoner comes back.
The mother and the girl cross the river.
Mother comes back
The mother and the father cross the river
Father comes back
The guard and the prisoner cross the river
Mother comes back
The father and the mother cross the river
Father comes back
The father and the boy cross the river
The guard and the prisoner comes back
The guard and the boy cross the river
The guard comes back
The guard and the prisoner cross the river.