A devotee visits 9 temples when he visits India. All these nine temples have one thing in common - there are 100 steps in every temple. The devotee puts the Re.1 coin after climbing up every step. He does the same while climbing down every step. At each temple, the devotee offers half of his money from his pocket to god. In this way, his pocket becomes empty after he visits the 9th temple.
Can you calculate the total amount he had initially?
Two natural numbers have a sum of less than 100 and are greater than one.
John knows the product of the numbers and Jacob knows the sum of numbers.
The following conversation takes place between them:
John: 'I am not aware of those numbers.'
Jacob: 'I knew you wouldn't be. I am not aware myself.'
John: 'Now I know them!'
Jacob: 'Now I know them, too!'
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.
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.
