In the figure, you can see nine stars. What you have to do is connect all of them by using just four line and without lifting your hand i.e. in a continuous flow.
Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?
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?
In order to complete the racing competition, the Mexico racetrack has to submit its top and the most famous three horses to win the competition. Due to an electrical storm, all the records are cleared and no one knows which horse holds the record. They all look identical and it becomes even more difficult to differentiate the horses. There are 25 horses in the Mexico racetrack. But there can be only five horses at a time on the track. What will the least number of races that can be conducted to find out the three fastest horses?
A girl was sitting in her hotel room when she heard a knock on the door. She opened the door and found that a man was standing outside.
The man said, "Oh! I am really sorry, I thought this was my room."
He then walked through the corridor to the elevator. The girl did not know the man. She closed her door and called security asking them to apprehend the man.
What made her suspicious of that man? He might have been genuinely mistaken.
There is a square piece of paper with a hole that is denoted by the circle on the top right side in the given picture. You have to cut the paper in a manner that it forms two and only two separate pieces of paper and then rearrange the pieces in a manner that the holes come in the centre of the paper.
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