Solution:

Falling Asleep

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:

12 steps:

Steps 11 Liter jug 6 Liter Jug
1. 11 -
2. 5 6
3. 5 0
4. 0 5
5. 11 5
6. 10 6
7. 10 0
8. 4 6
9. 4 0
10. 0 4
11. 11 4
12. 9 6 ==> i found 9 liter in 11liter jug(as required)

Solution:

The best thing for you will be to shoot your first shot in air.

If you try to shoot at Jack and hits him by chance, Leo always hits on the target and you are dead.

If you choose to shoot at Leo and hits him by chance, then there is a fifty percent chance that Jack will hit you.

If you shoot in air, the next turn is of Jack and he knows that Leo is a better shooter which means that he will shoot at him. If he misses, he is definitely dead as Leo will shoot on him coz he shot at him. The next turn will be yours and you stand a 1/3rd chance of hitting him. Also if, he is able to hit Leo. The next chance is yours again and you can try the 1/3rd probability of hitting over Jack.

This is the best situation that you can face. At every other possible way, you will face a worse situation for sure.

Solution:

C7 => B8
Exchange pawn for a knight

Check-Mate

GameOver

Solution:

Just 2

Day One: You make your first cut at the 1/7th mark and give that to the worker.
Day Two: You cut 2/7ths and pay that to the worker and receive the original 1/7th in change.
Day three: You give the worker the 1/7th you received as change on the previous day.
Day four: You give the worker 4/7ths and he returns his 1/7th cut and his 2/7th cut as change.
Day Five: You give the worker back the 1/7th cut of gold.
Day Six: You give the worker the 2/7th cut and receive the 1/7th cut back in change.
Day Seven: You pay the worker his final 1/7th.

Solution:

99 matches.

The number of matches will always sum up to one less than the number of players in a knock out tournament. You may calculate it in any manner. Thus 99 matches were played.

Solution:

This can be done if you draw a five pointed star and place the balls on the corners and intersection points. See the figure to understand better.

Solution:

8/(1−1/5)

Solution:

There are two things to keep in mind:
Firstly there is at least one red hat. (There can be two or three as well).
Secondly the competition is fair for everyone.

Thus if there is only one red hat, that person will see two green hats on other heads and will be able to deduce his own color as red. However the other students will see one red and one green hat and can never be sure. In such manner, the competition will prove to be partial for one student.

Suppose if there are two red hats. Then the students who are wearing red hats will see one red and one green hat on others. Now they must have deduced that there can’t be just one red hat. Thus they will know that they are also wearing a red hat. But the one who is wearing a green hat will see two red hats and can never be sure of his own color. In this case as well, the competition will not be fair.

Thus the only possible and fair means is if all of them are wearing a red hat. The one who is able to deduce the situation first, will raise his hand and will tell the correct answer.

Solution:

Fifteen Minutes.

After frying for five minutes, you can take out one steak and put the third one inside while turning the other one inside. After five more minutes, one steak is fried from both sides and you can take it out. Now put in the steak that we removed and turn the other one inside. After five more minutes, they both will also be fried from both sides.