Solution:

Because Monday is a weak day(week day)

Solution:

Since Jasmine and Thibault ate equal amount, they should pay the same amount. But since that's not possible, they can decide with 'rock, paper, scissor' or an equivalent measure to determine who will pay the extra dollar. Now, let's assume tha Jasmine pays $1 extra after losing

Jasmine will pay $5, Thibault will pay $4 and Noah will pay $2.

If the pizza's cost was $11, we can simply keep the same offset and divide. Jasmine is paying 6% more, Thibault is paying 15% more and Noah is paying 27% more.
Keeping the offset same both Jasmine and Thibault will pay $5 each and Noah will pay $1.

Solution:

31

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

Solution:

The man asked the king that he wanted to die of old age.

Solution:

If two widows, each having a son married the son of the other widow, and then by the consummation of marriage, both the couples had a daughter, all the aforementioned relationships will turn to be true.

Solution:

Solution is below

Solution:

Hockey Stick $49.50 & ball $0.50

Solution:

On the back, since bullet train is accelerating, therefore,the person at the back will spend less time than one in front.

Solution:

charles put the ring into the box, secure it with one of your locks, and send the box to the girl firend.
She should then attach one of his own locks and return it. When you receive it again, remove your lock and send it back with her lock. Now she can unlock his own lock and retrieve the object.

Solution:

192

Explanation:
I started with the number 192.
Adding the reversed 291 to 192 gave me 483.
Similarly,
483 + 384 = 867
867 + 768 = 1635
1635 + 5361 = 6996

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.