Four people need to cross a rickety bridge at night. Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. The bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge. Times for each person: 1 min, 2 mins, 7 mins and 10 mins. What is the shortest time needed for all four of them to cross the bridge?
There is a straight highway. Four different villages lie on that highway. The distance between them is different. The third village is 60km away from the first village; the fourth is 40 km away from the second; the third is 10 km near to the fourth that it is to the second.
Can you calculate the distance between the fourth and the first village ?
One evening there was a murder in the home of a married couple, their son and daughter. One of these four people murdered one of the others. One of the members of the family witnessed the crime.
The other one helped the murderer.
These are the things we know for sure:
1. The witness and the one who helped the murderer were not of the same sex.
2. The oldest person and the witness were not of the same sex.
3. The youngest person and the victim were not of the same sex.
4. The one who helped the murderer was older than the victim.
5. The father was the oldest member of the family.
6. The murderer was not the youngest member of the family.
John is pretty weird. He likes toffees but hates chocolates. He loves books but never reads. He likes to build his troops in an online game but does not proceed with the war. He likes to go swimming but is afraid of water.
Seeking this behaviour, can you tell whether he likes balloons and parties?
While preparing the table for dinner, wife came up with an idea to tease his mathematician husband. She asked her husband to pick nine toothpicks and make ten without breaking any toothpick.
The husband was also smart and did it within seconds. How ?
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