A man plots the murder of his wife. His plan is full proof. Nobody saw them leaving their house. He stabbed her with a knife while driving. She died on the spot. He threw her body in a valley. He threw the knife carefully wiping his finger prints on a random garbage bin. Then he went back to his home and no one was watching him this time as well.
After an hour, he was called by the local police department who informed him that his wife was murdered. They asked him to reach the scene of crime immediately. But as soon as he arrived at the crime scene, he was arrested by them.
How did the police know that he himself is the murderer?
A journalist was investigating a sacred cult in the jungles of Africa when he was caught by one of the person. He was confined in a cave till the leader arrived. The leader told him that he need to tell him a statement. If he thinks the statement is true, then the journalist head will be chopped off. If he thinks that the statement is false, his head will be smashed with a hammer.
What statement did the journalist make to survive?
There was a kingdom in which the king had no heir to take over his thrown. Even the queen was dead and he himself was on the verge of dying. He thought about it and then summoned all of the teenagers. He gave one seed each to all of them and asked them to grow the plant. He announced that the one with the most beautiful plant will become the king/queen of the empire after the death of the king.
After a month, all of them were called. The king looked at all of the plants but announced the girl with an empty pot as the queen of the empire. Why?
There are 20 people in an empty, square room. Each person has full sight of the entire room and everyone in it without turning his head or body, or moving in any way (other than the eyes). Where can you place an apple so that all but one person can see it?
Find out a multi-digit number that if multiplied by the number 9 or any of its multiplications products (i.e. 18, 27, 36, 45,..) will result in the multiplication factor repeated (n) number of times.
In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?