Two Lost Cards in a Deck

Below you can read the steps of a magic trick, as well as a video of its live performance. Your goal is to figure out how the trick is done, then perform it for your friends and challenge them to figure out the trick themselves.

  1. Take out from your pocket a deck of cards, which is visibly shuffled.
  2. Ask your first assistant to cut the deck, then take the top card from the bottom pile of cards and memorize it.
  3. Ask your second assistant to take the next card from the bottom pile and memorize it.
  4. Ask your first assistant to return his card back on the top of the bottom pile, then ask your second assistant to do the same.
  5. Place the two piles of cards on top of each other and cut the deck multiple times.
  6. Split the deck into two piles of cards, dealing consecutively one card on the left, then one card on the right, and so on, until you run out of cards.
  7. Take one of the two piles of cards, look at it, and guess correctly what cards were chosen by your assistants.

How does the magic trick work? Below you can see a live performance of the magic trick from Penn and Teller’s show Fool Us.

The secret of the trick is to memorize the group of cards which are located in even positions and the group of cards which are located in odd positions in the original deck. An easy way for doing this is to split the cards into two groups, such that the cards in the first group are only spades and diamonds, and the cards in the second group are only clubs and hearts.

When the two assistants pick their cards and then return them back into the deck, the order of the cards is reversed. When you split the original deck into two piles (even after cutting it several times), each of the piles will contain a card which should not be there. For example, the group of spades and diamonds will contain one clubs card, and the group of clubs and hearts will contain one diamonds card. These two cards are the ones which were picked by the assistants.

Under Water

The diving bell that Slylock Fox and Max Mouse are using has snapped its chain. A rescue team can reach Slylock and Max within 20 minutes, but there are only 15 minutes of air left. What will Slylock do?

He will use the lug wrench to remove the sunken car’s tires and release their air into the diving bell.

Handshakes at a Party

100 guests go to a party and some of them shake hands with each other. Show that there are two guests who handshake the same number of people.

Each of the people at the party has shaken hands between 0 and 99 times. However, if someone has shaken hands 0 times (with nobody), it is impossible that another one has shaken hands 99 times (with everybody). Therefore there are at most 98 different options for the number of handshakes at the party, and thus two of the guests have shaken hands the same number of times.

Old Man’s Killer

An eighty-year-old person was living alone in his house. On a sunny Friday morning, while delivering some letters in the mailbox, the postman felt suspicious and decided to look through the window of the house. That’s when he saw the old man lying dead on the floor in a puddle of blood. When the police arrived, they found three bottles of milk, the Tuesday’s newspaper, and some gifts in front of the house. The lock of the door was broken, and they already suspected a person. Whom and why?

SOLUTION

The police suspected the newspaper boy. Since there were 3 bottles of milk, the old man must have been dead for a few days already. However, the last newspaper left in front of his house is from Tuesday. Probably the newspaper boy, knowing that the old man is dead, decided that there is no point to go to his door and deliver newspapers anymore.

King Arthur and the Knights

King Arthur and his eleven honorable knights must sit on a round-table. In how many ways can you arrange the group, if no honorable knight can sit between two older honorable knights?

The answer is 1024 ways, up to rotation around the table. To see this, note that the youngest honorable knight must sit right next to King Arthur – there are two possible places for him. Then, the second-youngest knight must sit right next to this group of two. Once again, there are two possible places for him. Continuing like this, we see that for all honorable knights, except for the oldest one, there are two possible spots on the table. Multiplying two to the power of ten out, we get 1024.

A Beetle and Four Spiders

A beetle is located in the center of a square carpet. The edges of the carpet are colored in red, green, blue, and yellow. Four spiders of the same colors are on the carpet’s corners. Each spider can only move on the edge with its matching color. Can the beetle escape the carpet and flee without encountering the spiders if it is 1.5 times slower than them?

No, the spiders will always be able to contain the beetle within the carpet. We draw two perpendicular lines passing through the beetle which are parallel to the diagonals of the square. The spiders’ strategy is to follow the four points where these lines intersect with the boundary of the square. When a spider’s corresponding intersection point moves to an edge of a different color, the spider waits in the corner. In order to accomplish this strategy, the speeds of the spiders need to be at least √2~1.4 times higher than the speed of the beetle.