You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?
How many people must be gathered together in a room, before you can be certain that there is a greater than 50/50 chance that at least two of them have the same birthday?
Only one colour, but not one size,
Stuck at the bottom, yet easily flies.
Present in sun, but not in rain,
Doing no harm, and feeling no pain.
What is it?
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?