A swan sits at the center of a perfectly circular lake. At an edge of the lake stands a ravenous monster waiting to devour the swan. The monster can not enter the water, but it will run around the circumference of the lake to try to catch the swan as soon as it reaches the shore. The monster moves at 4 times the speed of the swan, and it will always move in the direction along the shore that brings it closer to the swan the quickest. Both the swan and the the monster can change directions in an instant.
The swan knows that if it can reach the lake's shore without the monster right on top of it, it can instantly escape into the surrounding forest.
A man was gazing through the window of the 23rd floor of the building. He suddenly opened the window and jumped on the other side of the window. On landing on the floor, there was not a sheer mark of injury on him.
How can that be possible if he did not use any kind of parachute and did not land on a soft surface?
In the Chess Board picture below white army is arranged. You need to add a black army on the board such that no piece is under any threat.
Note: Army comprised of 1 king, 1 queen, 2 rooks, 2 bishops, 2 knights, and 8 pawns.
How old is your son? asked a man to his neighbour. My son is five times as old as my daughter and my wife is five times as old as my son. I am twice as old as my wife whereas my grandmother, who is celebrating her eighty-first birthday is as old as all of us put together.
A detective visits his friend John just to discover that John's neighbour Dr Jacob was murdered. Dr Jacob, who is a mathematician wrote the murderer's name in a code word "Hcqtfz". There were five suspects
1. Ajit
2. Pankaj
3. Ganpat
4. Deenu
5. Hariya
The Detective was instantly able to find the murderer.
Can you?
If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.
