Solution:

The main idea for getting the solution for this puzzle is that the pirate should know that he will be getting the treasure for the acceptance of the proposal. And if he gets to know that the treasure he is getting is less than the others then he will not accept the proposal. If the last one who is left is the pirate 1 then he will be the one who will be getting all the golden coins.


If pirate 1 would be the only one left, he would get all the golden coins. If only pirates 1 and 2 would be left, pirate 2 would die for sure, since pirate 1 is bloodthirsty and will reject all proposals of pirate 2 (since he will get all coins anyway). So:
| Pirate 1 | Pirate 2
----------------+------------+------------
Number of coins | 1000 | 0
----------------+------------+------------
Pirate agrees | No | Yes
When also pirate 3 would still be alive, he needs the agreement of one of the other two. Pirate 2 will agree with every proposal since, as we have seen, he would die if he did not. Therefore, pirate 3 should propose to keep everything for himself.
| Pirate 1 | Pirate 2 | Pirate 3
----------------+------------+------------+------------
Number of coins | 0 | 0 | 1000
----------------+------------+------------+------------
Pirate agrees | No | Yes | Yes
When we have four pirates, pirate 4 should make two other pirates agree with his proposal. Therefore, he proposes to give one coin to pirate 1, one coin to pirate 2, and the rest to himself. Pirates 1 and 2 will accept the proposal, since they are greedy, and if they would not accept, they would get less.
| Pirate 1 | Pirate 2 | Pirate 3 | Pirate 4
----------------+------------+------------+------------+------------
Number of coins | 1 | 1 | 0 | 998
----------------+------------+------------+------------+------------
Pirate agrees | Yes | Yes | No | Yes
However, as we know, there are five pirates. If pirate 5 gives both pirate 1 (or 2) and pirate 3 one coin more than in the previous case, they are willing to accept the proposal. Then a majority (three out of five) of the pirates will support the proposal, and pirate 5 can keep the rest of the treasure to himself.
| Pirate 1 | Pirate 2 | Pirate 3 | Pirate 4 | Pirate 5
----------------+------------+------------+------------+------------+------------
Number of coins | 2 | 0 | 1 | 0 | 997
----------------+------------+------------+------------+------------+------------
Pirate agrees | Yes | No | Yes | No | Yes
Conclusion: Pirate 5 should propose to give two coins to pirate 1 (or 2), one coin to pirate 3, and the remaining 997 coins to himself.

Solution:

Since every bacterium divides into two in two minutes and we know the fact that the dish was half filled with bacteria at 3 pm, after exactly 2 minutes, all will divide into two and will fill the petri dish. Thus, the petri dish will become full at 3:02 pm.

Solution:

A) Yes

Explanation"
There are two scenarios.

Scenario-1: Millie is married
Millie is looking at Stones(not married)

Scenario-2: Millie is not married
Terry(married) is looking at Millie

Solution:

If you take a look closely, you will acknowledge the fact that every symbol in the given figure is somehow associated with the surrounding one’s position. The upside-down spade is used to the left of a right-side-up heart every time.

Solution:

At each draw, the number of strawberry candies are either decreasing by 2 or not decreasing at all. In the case of orange candies, at each draw, they are either increasing by 1 or decreasing by 1.

Thus on an assumed outset with at least one candy in the jar to begin with, if the number of strawberry candies are 0 or are even in numbers, they will finish off leaving an orange candy at the end. If otherwise, the remaining candy will be a strawberry one.

Solution:

Jamie is a window cleaner who was tired after cleaning the windows on the 45th floor and thus leaped inside the building.

Solution:

Tuesday

We know that Christanio Ronaldo tells the truth on only a single day of the week. If the statement on day 1 is untrue, this means that he tells the truth on Monday or Tuesday. If the statement on day 3 is untrue, this means that he tells the truth on Wednesday or Friday. Since Christanio Ronaldo tells the truth on only one day, these statements cannot both be untrue. So, exactly one of these statements must be true, and the statement on day 2 must be untrue.
Assume that the statement on day 1 is true. Then the statement on day 3 must be untrue, from which follows that Christanio Ronaldo tells the truth on Wednesday or Friday. So, day 1 is a Wednesday or a Friday. Therefore, day 2 is a Thursday or a Saturday. However, this would imply that the statement on day 2 is true, which is impossible. From this we can conclude that the statement on day 1 must be untrue.

This means that Christanio Ronaldo told the truth on day 3 and that this day is a Monday or a Tuesday. So day 2 is a Sunday or a Monday. Because the statement on day 2 must be untrue, we can conclude that day 2 is a Monday.

So day 3 is a Tuesday. Therefore, the day on which Christanio Ronaldo tells the truth is Tuesday.

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:

The attached picture gives away the solution. If you can find another solution, do send us yours.

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:

Let us assume that all of them are standing on the X shore and they have to travel to the Y shore.

X = mother, first daughter, second daughter, father, first son, second son, maid and dog
Y = None

Maid and dog go first and maid returns back
X = mother, first daughter, second daughter, father, first son, second son and maid
Y = dog

Maid and first son go and maid returns with dog
X = mother, first daughter, second daughter, father, second son, maid and dog
Y = first son

Father and second son go and father returns back
X = mother, first daughter, second daughter, father, maid and dog
Y = first son and second son

Mother and father go and mother comes back
X = mother, first daughter, second daughter, maid and dog
Y = father, first son and second son

Maid and Dog go and Father returns back
X = mother, first daughter, second daughter and father
Y = first son, second son, maid and dog

Father and Mother go and mother comes back
X = mother, first daughter and second daughter
Y = father, first son, second son, maid and dog

Mother and first daughter go and maid comes back with dog
X = second daughter, maid and dog
Y = mother, first daughter, father, first son and second son

Maid and second daughter go and maid comes back
X = Maid and dog
Y = mother, first daughter, second daughter, father, first son and second son

Maid and dog go
X= none
Y = mother, first daughter, second daughter, father, first son, second son, maid and dog

Thus everyone has reached the other end.