Suppose we lay down two cups in front of you. One of the cups is filled with tea and the other one with coffee. Now we ask you to take a spoonful of tea and mix it with the coffee. At this moment, the coffee cup has a mixture of tea and coffee. You have to take that mixture (spoonful) and add it back to the tea.
Can you now tell if the cup of coffee has more tea or the cup of tea has more coffee?
A man has eighty-one cows ( numbered 1,2,3...81 as such). The beauty is that cow no. 1 gives 1ltr of milk, cow no. 2 gives 2ltrs of milk and so on. The man wants to equally distribute the cows among his nine sons so that each one of them gets the same quantity of milk.
In a town, there are over 100 flats.
Flat-1 is named first flat.
Flat-2 is named second flat.
Flat-3 is named third flat.
A visitors 'Victor' decides to walk through all the flats, he finds all the flats except flat-62.
Victor later founds that the local of the town have given it another name.
Three cars are driving on a track that forms a perfect circle and is wide enough that multiple cars can pass anytime. The car that is leading in the race right now is driving at 55 MPH and the car that is trailing at the last is going at 45 MPH. The car that is in the middle is somewhere between these two speeds.
Right now, you can assume that there is a distance of x miles between the leading car and the middle car and x miles between the middle car and the last car and also, x is not equal to 0 or 1.
The cars maintain their speed till the leading car catches up with the last car and then every car stops. In this scenario, do you think of any point when the distance between any two pairs will again be x miles i.e. the pairs will be x distance apart at the same time ?
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?
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