You find yourself in a strange place guarded by two guards.One of the guard always say truth while other always lies.You don't know the identity of the two.You can ask only one question to go out from there. What should you ask?
A person was killed at a house party. When the police arrive, there are six people present in the house who are the friends of the victim. The name of the friends is Rohit, Aman, Nick, Gagan, and Randy.
Near the dead body, they find a few numbers written with blood by the victim on the floor. The numbers are 8, 5, 4, and 11.
The police arrests one of the friends for the murder. Whom did they arrest and why?
Three people enter a room and have a green or blue hat placed on their heads. They cannot see their own hat but can see the other hats.
The colour of each hat is purely random. They could all be green, blue, or any combination of green and blue.
They need to guess their own hat colour by writing it on a piece of paper, or they can write 'pass'.
They cannot communicate with each other in any way once the game starts. But they can have a strategy meeting before the game.
If at least one of them guesses correctly they win $10,000 each, but if anyone guesses incorrectly they all get nothing.
What is the best strategy?
John bought 150 chocolates but he misplaced some of them. His Father asked him how many chocolates were misplaced.
He gave the following answer to him:
If you count in pairs, one remains
If you count in threes, two remain
If you count in fours, three remain
If you count in fives, four remain
If you count in sixes, five remain
If you count in sevens, no chocolate remains.
Can you analyze the statements and tell us how many chocolates were lost?
In the picture that is attached with this question, you can find a square which comprises of four little squares inside it. Consider this square to be made with matchsticks. You have to remove two matchsticks such that only two squares remain instead of five.How will you do it ?
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