Pronounced as one letter,
And written with three,
Two letters there are,
And two only in me.
I am double, I am single,
I am black blue and grey,
I am read from both ends,
And the same either way.
Two boys wish to cross a river. The only way to get to the other side is by boat, but that boat can only take one boy at a time. The boat cannot return on its own, there are no ropes or similar tricks, yet both boys manage to cross using the boat.
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.
