You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?
A Car is crossing a bridge 2 miles long. The bridge can only hold 10000 lbs, which is the exact weight of the car. The Car makes it half way across the bridge and stops. A bird lands on the car. Does the bridge collapse? Explain.
You know three triplets: Frank John and Wayne (need to return your money). Frank always tells the truth while John and Wayne always lie. You meet one of them on the road and can ask him a three-word question.
Which question, will you ask?
There are people and strange monkeys on this island, and you can not tell who is who (Edit: until you understand what they said - see below). They speak either only the truth or only lies.
Who are the following two guys?
A: B is a lying monkey. I am human.
B: A is telling the truth.
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.
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.