Find a 9-digit number, which you will gradually round off starting with units, then tenth, hundred etc., until you get to the last numeral, which you do not round off. The rounding alternates (up, down, up ...). After rounding off 8 times, the final number is 500000000. The original number is commensurable by 6 and 7, all the numbers from 1 to 9 are used, and after rounding four times the sum of the not-rounded numerals equals 24.
If you paint a brown house white it will become a white house. If the stoplight changes from red to green, then the light is green. So, if you throw a white shirt into the Red Sea, what will it become?
I ask Joseph to pick any 5 cards out of a deck with no Jokers.
He can inspect then shuffle the deck before picking any five cards. He picks out 5 cards then hands them to me (Jack can't see any of this). I look at the cards and I pick 1 card out and give it back to Joseph. I then arrange the other four cards in a special way, and give those 4 cards all face down, and in a neat pile, to Jack.
Jack looks at the 4 cards i gave him, and says out loud which card Joseph is holding (suit and number). How?
The solution uses pure logic, not sleight of hand. All Jack needs to know is the order of the cards and what is on their face, nothing more.
I came first on earth but second on the heaven.
I also came twice in a week but found just once in a year.
I stay away from months but you can find me in February.
A man always keeps a spare tyre in his car. To make full use of all the five tyres, he changes the tyres in a manner that for a distance of 1, 00,000 km, each of them runs the same distance.
Can you calculate the distance travelled by each tyre on that journey?
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?
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