Solution:

As the message contains one truth, the third says that the cash is in the second bag, if it is to be true, then the first bag message will also become true. So cash cannot be in second and third bags. cash is in the first bag.

Solution:

== Mathematical Answer ==
Mathematical Answer = number of seconds in a minute * number of minute in an hour * number hour in a day * number of day in year
60 * 60 * 24 * 365 = 31536000
60 * 60 * 24 * 365.25 = 31557600 (if you want account for leap year)


== We are looking for trick answer (which is 24) ==
Every month contains only 2 second like
A) 2nd January ("second" January)
B) 22nd January (twenty"second" January)

Therefore 2 * 12 months = 24.

Solution:

Upon reaching each room, he found out that the window facing the dead body was closed. He had to open the window himself. This tells that there was somebody else with him who closed the window. If he would have committed suicide, at least one window would have been open.

Solution:

The Lady sitting in the chair has the detector attached to the back of her blouse.

Solution:

4 6 5 3 (from magician perspective)
3 5 6 4 (viewer perspective)

Detail:

From user perspective:
3 5 6 4 => 5 6 4 3 => 6 5 4 3

For magician perspective
3 4 5 6 (ascending order as)

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:

4

No Of circles in the number.

Solution:

Let m be initial number of flowers and n be the flowers offered at each temple by the man.
Initial flowers = m
After stepping into the first temple = 2m
Flowers offered at the first temple = n
Remaining flowers = 2m – n

After stepping into the second temple = 4m – 2n
Flowers offered at the second temple = n
Remaining flowers = 2m – n

After stepping into the third temple = 8m – 6n
Flowers offered at the third temple = n
Remaining flowers = 8m – 7n

Now as per the question (8m – 7n) must be equal to 0.
i.e. 8m – 7 n = 0
or 8m = 7y

Now the least numbers required to solve this equation are 7 and 8 for m and n respectively.

Thus m = 7; n = 8
Which means, the man had 7 flowers in the beginning and he offered 8 flowers at each temple.

Solution:

9 - 8 + 76 - 5 + 4 + 3 + 21 = 100


Other ways of making number 100 (withiout using number 32)
98 + 7 + 6 - 5 - 4 - 3 + 2 - 1 = 100
98 - 7 - 6 - 5 - 4 + 3 + 21 = 100
9 - 8 + 76 - 5 + 4 + 3 + 21 = 100
98 - 7 + 6 + 5 + 4 - 3 - 2 - 1 = 100
98 + 7 - 6 + 5 - 4 + 3 - 2 - 1 = 100
98 + 7 - 6 + 5 - 4 - 3 + 2 + 1 = 100
98 - 7 + 6 + 5 - 4 + 3 - 2 + 1 = 100
98 - 7 + 6 - 5 + 4 + 3 + 2 - 1 = 100
98 + 7 - 6 - 5 + 4 + 3 - 2 + 1 = 100
98 - 7 - 6 + 5 + 4 + 3 + 2 + 1 = 100
9 + 8 + 76 + 5 + 4 - 3 + 2 - 1 = 100
9 + 8 + 76 + 5 - 4 + 3 + 2 + 1 = 100

Solution:

Hhe hung herself using big Ice slabs , which are now now melted and hence puddle of water.

Solution:

I spoke with Joe.

Explanation:
There can be only two cases. Either Zoe is a liar or Joe is a liar.

First Case
Let us assume that Zoe is a liar and Joe is a truthful person.
If I asked the question from Joe, the answer will be yes. If I asked the question from Zoe, the answer will be no. Thus in this case, I must have asked from Joe.

Second Case
Let us assume that Zoe is a truthful and Joe is a liar.
If I asked the question from Joe, the answer will be yes. If I asked the question from Zoe, the answer will be no. Thus in this case as well, I must have asked from Joe only.