A man plots the murder of his wife. His plan is full proof. Nobody saw them leaving their house. He stabbed her with a knife while driving. She died on the spot. He threw her body in a valley. He threw the knife carefully wiping his finger prints on a random garbage bin. Then he went back to his home and no one was watching him this time as well.
After an hour, he was called by the local police department who informed him that his wife was murdered. They asked him to reach the scene of crime immediately. But as soon as he arrived at the crime scene, he was arrested by them.
How did the police know that he himself is the murderer?
A convention is held where all the big logicians are summoned. The master places a band on everyone's forehead. Now all of them can see others bands but can't see his own. Then they are told that there are different colours of bands. All the logicians sit in circle and they are further explained that a bell will ring at regular intervals. The moment when a logician knew the colour of band on his forehead, he will leave at the next bell. If anyone leaves at the wrong bell, he will be disqualified.
The master assures the logicians that the puzzle will not be impossible for anyone of them. How will the logicians manage ?
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.