There is an ancient kingdom where every married woman keeps information regarding the fidelity of other men. However, what they don't know is the fidelity of their own husbands. Also, there is an ancient belief that they don't tell each other about the fidelity of their husbands.
On a certain day, the queen of the kingdom declares that she has identified at least one unfaithful man in the kingdom. She allows the wives to identify and gives them authority to kill their husbands if they are unfaithful at midnight.
A detective visits his friend John just to discover that John's neighbour Dr Jacob was murdered. Dr Jacob, who is a mathematician wrote the murderer's name in a code word "Hcqtfz". There were five suspects
1. Ajit
2. Pankaj
3. Ganpat
4. Deenu
5. Hariya
The Detective was instantly able to find the murderer.
Can you?
In case you were starting to feel confident, this one was meant for third graders in Vietnam. The answer is 66, but we don't blame you for scratching your head about how they got there.
It has five wheels, though often think four, You cannot use it without that one more, You can put things in it, you can strap things on top, You can't find it in the market, but you can still go shop. What is it?
I have one of the three numbers: 1, 2, or 3 in my mind. I speak only truth. You can ask me just one question for which I will only reply in yes or no or don't know. What question will you ask from me so that you are able to know the number?
In a classic wine shop, the list of three most popular wines are:
- The cost of 1 French wine bottle: 500$
- The cost of 1 German wine bottle: 100$
- The cost of 20 Dutch wine bottles: 100$
John entered the wine shop and he needs to buy
- All three types of wine bottles.
- Needs to buy Dutch wine bottles in multiples of 20.
- Need to buy 100 wine bottles in total.
John has only 10000$. How many wine bottles of each type, John must 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