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.
There are three boxes on a table. One of the box contains Gold and the other two are empty. A printed message contains in each box. One of the message is true and the other two are lies.
The first box says "The Gold is not here".
The Second box says "The Gold is not here".
The Third box says "The Gold is in the Second box".
A man started to town with a fox, a goose, and a sack of corn. He came to a stream which he had to cross in a tiny boat. He could only take one across at a time. He could not leave the fox alone with the goose or the goose alone with the corn. How did he get them all safely over the stream?
My first is in chocolate but not in ham. My second is in cake and also in jam. My third at tea time is easily found. Altogether, this is a friend who is often around. What is it?
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.
