A dying old man wants to divide his entire land between his only two sons. Since his only wish is to treat them as equal as both of them have been too good to him, he wants to divide his land equally between them. The problem is that the land is significantly irregular in shape and thus there is no choice of cutting them into two equal halves.
Can you help him divide the land in a manner that both of his sons will be happy?
Suppose we lay down two cups in front of you. One of the cups is filled with tea and the other one with coffee. Now we ask you to take a spoonful of tea and mix it with the coffee. At this moment, the coffee cup has a mixture of tea and coffee. You have to take that mixture (spoonful) and add it back to the tea.
Can you now tell if the cup of coffee has more tea or the cup of tea has more coffee?
I am thinking of a five-digit number such that:
The first and last digits are the same, their submission is an even number and multiplication is an odd number and is equal to the fourth number. Subtract five from it and we obtain the second number. Then divide into exact halves and we get the 3rd number.
Vin Diesel is pulling a theft and has planned to run away with all the cash kept in the safe. But the only way to open the safe is the 13 character password. He has a set of five clues given to him by a trustworthy source.
Exactly two of the below statements are false.
The password is contained within this sentence.
The password is not in this hint.
The password is within only one of these statements.
At least one of the above statements is a lie.
Rose, Lily and Jasmine decided to buy flowers for their moms on Mother's Day. One of them bought lilies, the other roses, and the third one jasmines.
'It's funny!' said the girl with roses, 'we bought roses, jasmines and lilies, but none of us bought the flowers matching her name'.
'You're right!', said Lily.
What kind of flowers did each of the girls buy?
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