How can you throw a ball as hard as you can and have it come back to you even if it doesn't hit anything there is nothing attached to it and no one else catches or throws it.
A pack of cards has 40 cards. You are blindfolded. Out of 40, 25 cards are facing down while 15 are facing up. You have been asked to divide this pack of cards into two decks - so that each deck contains an equal number of face-up cards. Remember, you are blindfolded.
I am thinking of a five-digit number such that:
The first and last digits are the same, their submission is an even number and multiplication is an odd number and is equal to the fourth number. Subtract five from it and we obtain the second number. Then divide into exact halves and we get the 3rd number.
You have to fill the below given grid in a manner that every row and column contains the digits 1 to 6. Also, make sure that the squares that are connected with each other must contains the same digit.
You are driving down the road in your car on a wild, stormy night, when you pass by a bus stop and you see three people waiting for the bus
An old lady looks as if she is about to die.
An old friend who once saved your life.
The perfect partner you have been dreaming about.
Knowing that there can only be one passenger in your car, whom would you choose?
In an Art Gallary, When the clock hit 11 am, Artist hung the painting number 30. When it struck 4 pm, he hung painting number 240 and when it struck 7:30 pm, he hung painting number 315.
Can you determine, which painting number will he hang when the time is 9:20 pm?
There were two grandmothers and their two granddaughters.
There were two husbands and their two wives.
There were two fathers and their two daughters.
There were two mothers and their two sons.
There were two maidens and their two mothers.
There were two sisters and their two brothers.
Yet there are only six, who are buried here,
All are born legitimate and relationships clear.
How can this happen?
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
