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.
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?
A girl rode into a tourist spot out of the city on Thursday. She loved the place and decided to stay for a few days. She stayed for four days and then she left for back home on Thursday.
In a competitive exam, each correct answer could win you 10 points and each wrong answer could lose you 5 points. You sat in the exam and answered all the 20 questions, which were given in the exam.
When you checked the result, you scored 125 marks on the test.
Can you calculate how many answers given by you were wrong?
A frog is at the bottom of a 30-meter well. Each day he summons enough energy for one 3-meter leap up the well. Exhausted, he then hangs there for the rest of the day. At night, while he is asleep, he slips 2 meters backwards. How many days does it take him to escape from the well?
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