A boy was at a carnival and went to a booth where a man said to the boy, "If I write your exact weight on this piece of paper then you have to give me $50, but if I cannot, I will pay you $50." The boy looked around and saw no scale so he agrees, thinking no matter what the carny writes he'll just say he weighs more or less. In the end the boy ended up paying the man $50. How did the man win the bet?
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.
An ant is travelling on a 1-meter-long rope at 1 cm/second but also the entire rope is being stretched by an extra 1 meter/second. Is it possible for the ant to reach at the end of the rope?
As we know that white starts the game of chess. Can you find the scenario shown in the picture below is possible when all the white pieces are at the original place while the black pawn is not as in the below picture?
You need to remove four matchsticks from the picture below and still need to maintain the following as in the original image.
1. 1st row contains 12 matchsticks
2. 2nd row contains 12 matchsticks
3. 1st column contains 12 matchsticks
4. 2nd column contains 12 matchsticks
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.