Mr. Buttons was all set to go to the village of Buttonland to meet his friend. So, he packed his bags and left for the village at 5 in the morning. Upon travelling on a road for miles, he came across a point where the road diverged into two. He was confused on which road to take. He gazed around and he saw two owls sitting on a branch. He thought he could ask for directions for the village from the two owls. So he went to the tree. There he saw a sign which read, "One owl always lies, and one is always truthful. They both fly away if you ask them more than 1 question."
Mr. Buttons was caught in the dilemma of what to ask? And from which owl to ask, since he only had one question. What should Mr. Buttons ask?
A 3 digit number is such that it's unit digit is equal to the product of the other two digits which are prime. Also, the difference between it's reverse and itself is 396.
13 decks of cards have been mixed. What is the minimum number of cards that must be taken out from the above-mixed cards to guarantee at least one 'four of a kind?
Three friends decide to distribute the soda cans they had among them. When all of them had drunk four cans each, the total number of cans that remained was equal to the cans each one of them had after they had divided the cans.
Can you calculate the total number of cans before distribution?
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.
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
