By using all numbers, i.e. 123456789 and subtraction/addition, operators number 100 can be formed in many ways.
Example: 98 + 7 + 6 - 5 - 4 - 3 + 2 - 1 = 100
But if we add a condition use of the number 32 is a must. Then there are limited solutions.
One of such solution is: 9 - 8 + 76 + 54 - 32 + 1 = 100
Before the start of the car race, John and Jacob have the same amount of fuel in their car. With this fuel, John can drive for 4 hours while Jacob can drive five hours.
After a time they realize that the amount of fuel left in John's car is 1/4th of the fuel in Jacob's.
A crime was committed at baker street. Ibrahim Dakota who was shot in the stomach was the main suspect. Sherlock questioned the suspect. The conversation started as:
Sherlock: What's your story, Ibrahim?
Ibrahim: I was walking around baker street and suddenly a man from the back shot me. I ran as fast as I could to save my life".
Sherlock: That is enough (and ask the police to arrest him).
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?
Akbar summoned Birbal out of anger.
He told him that he will have to face death.
He asked him to make a statement and if the statement is true he will be buried alive and if the statement is false, he will be thrown at lions.
After hearing Birbal’s statement, Akbar could do nothing but smile.
He gave him 5 gold bars and let him go.
The captain of a ship was telling this interesting story: "We travelled the sea far and wide. At one time, two of my sailors were standing on opposite sides of the ship. One was looking west and the other one east. And at the same time, they could see each other clearly." How can that be possible?
In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki