Solution:

Scrambled eggs

Solution:

The first step that they will take will be a leap of logic. What it means is that they will deduce that every color must appear twice at least. Why? Because the master logician has assured them that the puzzle will not be impossible for anyone of them. And if a color appears only once in the circle, the person wearing it will have no clue about that color which will not be fair for him.

Then the logicians will follow the same and look for all the colors of hats in the circle. If one of them sees a color just once, he can safely assume that he is also wearing the hat of the same color as by leap of logic, no color can appear just once. Thus when the bell is rung, he will leave.

In the similar fashion, if anyone sees another color just once, he can determine that he is wearing the hat of the same color and will leave when the bell rings or will be disqualified and sent home. Unvaryingly, if a color is seen twice, they will be eliminated after the first bell. Hence, there must be at least three hats of any of the remaining color.

Assume that you are sitting in the circle and you don’t see a color once but see it twice. Then if they were the only two hats of the same color, the logicians must have left at the first bell already. But they did not. Which means that there are three hats of that color and you are wearing one. Thus you will leave after the second bell.

Solution:

If we have to measure precisely, it is impossible. Because we are asked to measure odd number of liters whereas all the jars we have can contain only even liters of water.

* Tricky question asked in ias/infosys/infoedge/ibibo interview

Solution:

Firstly: Policeman should take the thug across the river thames and escort the boat back with him. (Thug across, everyone else on this side)
Then, Policeman will take one cat along, leave it there, and on the way back, bring back the thug (since thug cannot be left with anyone without policeman's supervision).
Then Mrs. Mother will take the second cat on the other side. Drop it there and bring the boat back. For the 4th trip, Mrs. Mother And Mr. Father Will travel to the other side, and Mrs. Mother will stay there, and MR. Father will bring the boat back. (Now Mrs. Mother and 2 cats are on the other side.)
5th trip, the policeman takes the thug across. Both of them stay there and Mrs. Mother will come back. Then for the next trip, Mr. Father and Mrs. Mother will go on the boat, and Mrs. Mother will stay there, and Mr. Father will return back.
Then for the 7th trip, Mr. Father will travel with one dog. On the return, the policeman and the thug will return. Then in the next trip, the Policeman will take the second dog. (Now Mrs. Mother and her two cats; Mr. Father and his two dogs and the Policeman is here).
Now finally the policeman takes the boat on the other side and brings back the thug.
Tough one, right ?

Solution:

Never

Explanation:
In the question, the distance of x miles is given at a particular moment. The middle car is running at that time at 50 MPH. The distance will keep increasing with time as three are running at different speeds. It will increase by x miles every hour till a certain point of time and then it will start decreasing till the fastest car meets the slowest again.

As per question, all the cars stop then. Thus, the distance will never be x miles again.

Solution:

100

Series of number that do not contain albhabet 'T'

Solution:

13 numbers

Explanation:
Since we are looking to find odd reminder which implies that the remainder will be either 1 or 3
Therefore number must follow below two conditions:
A) We can list number 5n + 1 or 5n + 3. (where n = 0,1,2,3.....)
B) The number must end in 1 or 3.

List of such numbers less than 100 are:
1, 3, 11, 13, 21, 23, 31, 33, 41, 43, 51, 53, 61, 63, 71, 73, 81, 83, 91, 93

Let's remove the nonprime ones which are 1, 21, 33, 51, 63, 81 and 91

So, I will be left with 13 numbers which fit the bill.
3, 11, 13, 23, 31, 41, 43, 53, 61, 71, 73, 83 and 93

Solution:

Numbers of the first cube:
1, 2, 4, 0, 5 and 6.

Numbers on the second cube:
3, 1, 2, 7, 8 and 0.

Now you can pick any date and you will be able to show it using these cubes. Remember that you can always use 6 as 9 by inverting it.

This problem has another solution and we leave it for you to deduce.

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:

You will ask, I have a number in my mind that i.e. either 2 or 3. Is the number that I have in my mind smaller or equal to the number that you are thinking of?

If Alan replies with no, he is thinking of the number 1.
If Alan replies with yes, he is thinking of the number 3.
If Alan replies with don't know, he is thinking of the number 2.

Solution:

1

Explanation:
4 + 9 = 1
The trick to solve is to assume the first number as the time in AM and the second number is the number of hours you have to add to it. You'll find the time in PM when you do that.

For example
7 AM + 7 hours = 14:00 or 2 PM

4 AM + 9 hours = 13:00 or 1 PM.