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.
Can you make the number 24 by utilizing the numbers 1, 3, 4 and 6? You must use one number only one time and you can use mathematical operation symbols anytime anywhere.
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.
John can eat 27 chocolates in an hour, Jacob can eat 2 chocolates in 10 minutes, and Jolly can eat 7 chocolates in 20 minutes. How long will it take them to share and eat a box of 120 chocolates whilst playing Chess?
You are in a room that has three switches and a closed door. The switches control three light bulbs on the other side of the door. Once you open the door, you may never touch the switches again. How can you definitively tell which switch is connected to each of the light bulbs?
In 2011, people playing Foldit, an online puzzle game about protein folding, resolved the structure of an enzyme that causes an Aids-like disease in monkeys. Researchers had been working on the problem for 13 years. The gamers solved it in three weeks.
