A bridge is about to collapse. There are four people P, Q, R and S on one of the sides. Before the bridge collapses, they want to cross it. Now since the bridge is too weak, it can only stand the weight of two people at a time. Also, it is night time and nothing is visible. They have just one torch with them.
Now P takes one minute to cross the bridge, Q takes two minutes to cross, R takes five minutes to cross and S takes ten minutes to cross.
The bridge will collapse in seventeen minutes. How will they be able to cross the bridge before it collapses?
A hen, a dog, and a cat are stolen. Three suspects are arrested named Robin, Steve, and Tim. The police are sure that all of them stole one of the animals but they don't know who stole which animal.
Sherlock Holmes is appointed to identify and is provided with the following statements from the investigation.
Robin - Tim stole the hen
Steve - Tim stole the dog
Tim - Both Robin and Steve are lying. I neither stole a hen nor a dog.
Sherlock is somehow able to deduce that the man who stole the cat is telling a lie and the man who stole the hen is telling truth.
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 is a jar in which there are two types of candies.
20 blueberries and 16 strawberries. You perform the following steps:
1) You take out two candies.
2) If the two candies are of the same flavour, you add a blueberry one otherwise, you add the strawberry one.
You repeat these two steps till there is just one candy remaining in the jar. Which flavoured candy will be left?
An infinite number of mathematicians are standing behind a bar. The first asks the barman for half a pint of beer, the second for a quarter pint, the third an eighth, and so on. How many pints of beer will the barman need to fulfill all mathematicians' wishes?
You visit a home for specially-abled children on the occasion of Christmas where you meet with 50 children. You have a box of chocolates containing 50 chocolates exactly.
What if you were asked to one chocolate to each child in a manner that one chocolate still remains in the box? Is it possible?
