Solution:

In this picture, he saw another man. If you try to look near the right end of the picture, you will find a fan. Go down for the phone that is plugged on charge. Go further down and you will find a man's face. An eye is particularly visible. The man was hiding behind the bed when the husband arrived in her room. This made him believe that his wife was cheating on him.

Solution:

There are six unique answers

Ans1:
7 x 4 = 28
36 / 4 = 9
1 + 4 = 5

Ans2:
9 x 4 = 36
28 / 4 = 7
1 + 4 = 5

Ans3:
3 x 8 = 24
56 / 8 = 7
1 + 8 = 9

Ans4:
7 x 8 = 56
24 / 8 = 3
1 + 8 = 9

Ans5:
4 x 8 = 32
56 / 8 = 7
1 + 8 = 9

Ans6:
7 x 8 = 56
32 / 8 = 4
1 + 8 = 9

Solution:

30,450 miles.

Explanation:
For each 5 miles driven using this rotation, each tire will lose (2/29000)+(2/21000) of its tread.So, suppose we drive 5*N miles like this. Then, each tire will lose 2*N*((1/29000)+(1/21000)) of its tread. We wish to determine N so that the latter expression gets to be 1, representing all of each tire's tread. That happens when N=6090, which is when 5*N (the total miles driven) is 30,450.

Solution:

See the figure for the answer. Wasn't it a bit tricky?

Solution:

Since each one of them gave one answer wrong, this means that each one of them gave two answers right.

Let us assume that Student A gave a wrong answer to the first question. This will mean that Student B also gave a wrong answer for the first. This will conclude that the rest of the two answers given by them are correct. However, the answers are different and thus it is not possible.

Thus both Student A and Student B must be right with the first question and the answer to the first is two.

If you keep applying the same logic, you will come to a conclusion that following are the correct answers:
Q1. Two
Q2. Three
Q3. Two

Solution:

I am Spice

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

Solution:

Think deeply about the door number 56, people will visit it for every divisor it has. So 56 has 1 & 56, 2 & 28, 4 & 14, 7 & 8. So on pass 1, the 1st person will open the door; pass 2, 2nd one will close it; pass 4, open; pass 7, close; pass 8, open; pass 14, close; pass 28, open; pass 56, close.
Thus we can say that the door will just end up back in its original state for each pair of divisor. But what about the cases in which the pair of divisor has analogous number for example door number 16? 16 has the divisors 1 & 16, 2 & 8, 4&4. But 4 is recurrent because 16 is a perfect square, so you will only visit door number 16, on pass 1, 2, 4, 8 and 16… leaving it open at the end. So only perfect square doors will remain open at the end.

Solution:

I will be thrown at lions. Now if Akbar threw him at lions, Birbal’s statement will stand true and he will have to bury him alive. But if he bury him, the statement will emerge as false. Thus he had no choice left

Solution:

All Digits [0-9] follow the following pattern: There is one occurrence of all digits in every 10 numbers Example. Digit-9 occurred one time between 10 and 19 in 9, between 20 and 29 in 29
However, for tens(91,92,93...99) and hundreds (900,901.... 999), the occurrence is much more. Since we have included 1000, Therefor 1 is the most occurred digit.
Note: Despite three '0s' in 1000, 0 is not most occurred digit as they don't have tens and hundreds like other digits.

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:

The young lady was presented with a bill which belonged to the elderly woman. She had asked the waiter to collect the bill from her daughter.