Solution:

Bette

Solution:

74658

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

Solution:

Remove the same 2 matchsticks from each figure and move figure towards left 45 degrees, It forms the letters V W X Y.

Solution:

I am Spice

Explanation:
Spice is hot if you remove first two alphabets then it will become "ice", which is really cold.

Solution:

We now have a square of 3x3 size, 2 squares of 2x2 size and 5 squares of 1x1 size.

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:

16-days

In 15-days, he will climb 15-inch and when he climbs 5 inch more, he will be out of the well :-)

Solution:

The Winchester brothers - sam and dean

Solution:

17 mins

The initial solution most people will think of is to use the fastest person as an usher to guide everyone across. How long would that take? 10 + 1 + 7 + 1 + 2 = 21 mins. Is that it? No. That would make this question too simple even as a warm up question.

Let’s brainstorm a little further. To reduce the amount of time, we should find a way for 10 and 7 to go together. If they cross together, then we need one of them to come back to get the others. That would not be ideal. How do we get around that? Maybe we can have 1 waiting on the other side to bring the torch back. Ahaa, we are getting closer. The fastest way to get 1 across and be back is to use 2 to usher 1 across. So let’s put all this together.

1 and 2 go cross
2 comes back
7 and 10 go across
1 comes back
1 and 2 go across (done)

Total time = 2 + 2 + 10 + 1 + 2 = 17 mins

Solution:

You must put labels on the tablets as A and B before using. In that case, if you pour tablets together, you will get 3A, 2A 1B, 1A 2B or 3B. If they are from the same bottles you can take one from another bottle and save the remaining two for another day. If you get two from same and one from other, you can draw one from another bottle and you will have two pairs of which you can eat one and save the other.

Solution:

mother

We know from (3) that the youngest person was not the victim, from (4) that the youngest person was not the helper and from (6) that the youngest person was not the killer. The youngest person can only have been the witness therefore. If we make up a chart there are now three possible combinations:

Oldest person (father) H H M

Next to oldest (mother) V M H

Next to youngest (son) M V V

Youngest (daughter) W W W

(H = Helper ; V = Victim ; M = Murderer ; W = Witness)

We can work out from (5) that the father was the oldest, from (2) that the youngest person must have been the daughter. Therefore the next to the youngest must have been the son and the next to the oldest, the mother.