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?
Only one colour, but not one size,
Stuck at the bottom, yet easily flies.
Present in sun, but not in rain,
Doing no harm, and feeling no pain.
What is it?
John was writing his first book. After saving the document, he locked his laptop with a password and mentioned some phrases for the hint box.
A friend of his tried opening his laptop but found out that it was password protected. Following is the hint that appeared.
1 mobile 3 books 2 roars 1 night 4 balls 2 lighters 1 ghost 1 hat 3 watches.
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.
There are three boxes on a table. One of the box contains Gold and the other two are empty. A printed message contains in each box. One of the message is true and the other two are lies.
The first box says "The Gold is not here".
The Second box says "The Gold is not here".
The Third box says "The Gold is in the Second box".
In the image below, you can see two glasses and two matchsticks.You need to move four matchsticks in such a manner that the crosses come inside the glasses. Note: you cannot move the crossed.
You are provided with a grid (as shown in the picture). Can you fill the squares with numbers 1-8 in a manner that none of the two consecutive numbers are placed next to each other in any direction (vertically, horizontally or diagonally?)
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