The Lonely Card
You mix a packet of twelve cards with cuts and two-card turnovers, secretly turn one card over, and mix some more. When the cards are laid out, your card is the only one facing the other way.
Watch the lectureLecture 08 · The Lonely Card: the selection stands alone
Try it
Mix the packet as much as you like, choose a card, then mix again. You make every choice; the cards follow the real rules.
Why it works
The packet was never random. It was prepared facing down, up, down, up, and so on to the bottom. Because twelve is even, the bottom card (up) and the top card (down) alternate too, so the pattern runs right round the circle.
A cut only chooses a new starting point on that circle, so the faces still alternate. Turning the top two together cannot break the pattern either: those two cards face opposite ways, and after the turn they still do. Every legal move keeps the background alternating.
Your single flip is the one disturbance. Picture a reference packet that gets exactly the same cuts and turns, but not your flip. The two packets always hold the same cards in the same order, and they disagree at exactly one card: yours. A cut moves both copies alike. A turnover flips both copies of the two cards it touches, so cards that agreed still agree, and your card still disagrees. Its face may change many times; its disagreement never goes away.
The finish reverses positions 2, 4, 6, and so on. That turns any alternating packet into a uniform one, all down or all up. The reference becomes uniform, and the real packet differs from it only at your card.
Legal mixing keeps the background alternating and carries your one flip along with your card; the finish makes the background uniform, so only your card disagrees.
Step through the six-card example from the course, with the reference packet shown faintly beneath the real one. Then try the variations: two different cards flipped, or one card flipped twice. If you have just played, you can replay your own run.
Challenge: which states can you reach?
Four cards labelled 1 to 4 start in order, all face down. Using only C (cut one card to the bottom) and T (turn the top two over together), reach the target exactly, with every face matching. If you think it cannot be done, prove it.
A route proves a target can be reached. To prove one cannot, give every card a signature. For the card at position i with label ℓ and face bit f (down 0, up 1), add them up and keep only odd or even: q = (i + ℓ + f) mod 2.
At the start every signature is 0. C moves every card to a position of the other parity (four is even, so the wrap from position 1 to 4 does too), so all four signatures flip together. T moves each of the two cards to the other parity and flips its face; the two changes cancel. So the four signatures always agree. Two cards in a target whose signatures differ are a certificate that no route exists.
Perform it yourself
Set-up
- Take any twelve different cards. From the top, arrange them face down, face up, face down, face up, and so on, so the twelfth card is face up.
- Keep a second small packet nearby for demonstrating the turnover. The preparation is openly part of the experiment; there is no shuffle at the start.
Performance
- Hand over the packet and teach the two moves. A straight cut: move any group from the top to the bottom without changing its order. A turnover: take the top two together, turn them over as a little packet, and put them back on top.
- Demonstrate the turnover with the spare packet. Turn the two together, not separately: the lower card becomes the upper one, and both faces reverse. Two individual flips are a different move and break the trick.
- Let them cut and turn as often as they like, choosing a new cut size each time. Turn away.
- Ask them to look at the top card. If it is face down, they peek privately and put it back face down, then turn that one card over in its place. If it is already face up, they remember it and turn it face down. Either way, that is the one deliberate reversal; it must not be turned back.
- They continue with cuts and two-card turnovers, as many as they like, and finish with a straight cut.
- Deal the packet into a row of twelve, left to right. Leave the first card as it is, reverse the second, leave the third, reverse the fourth, and so on through the twelfth. Reverse means change its direction: face up becomes face down and face down becomes face up.
- Eleven cards face one way; one faces the other. Ask for the name of the chosen card, then turn the lone card over if it is face down.
If more than one card stands out, two cards were reversed, or a pair was flipped one card at a time. Say so openly, reset the preparation, and start again. The method isolates one disturbance only when exactly one is introduced.
Going deeper
An alternating background as an error detector
Write face down as 0 and face up as 1. The reference reads 010101 and the real packet, after the flip of C, reads 011101. The number of positions where two strings differ is their Hamming distance; here it is one. The two possible backgrounds, 010101 and 101010, are at distance six from each other, so one changed card cannot make the packet look like both.
The finish is a fixed mask: flip where the mask 010101 has a 1. Applied to either background it gives 000000 or 111111. Applied to 011101 it gives 001000. The mask does not search for the error; it makes the background easy to read, and the minority shows the change.
With two different cards flipped, six cards finish four-to-two, and both changed cards stand out. With three, a pattern like 000111 could have come from either background, and nothing in the cards can say which. In general, for an even packet of N cards, the background is recoverable when fewer than N/2 cards have been flipped. Flipping the same card twice cancels: if the extra flips are A, C, A, E, C, only E is left. And flipping every card turns one background into the other, which no finish can detect without knowing the starting phase.
All the states the spectator can reach
Four labelled cards can lie in 4! × 2⁴ = 384 ways. Starting from 1, 2, 3, 4 all face down, a complete search with C and T reaches exactly 48 of them, and the signature test admits exactly 48 candidates: two face patterns for each of the 24 orders. Because the search found all 48, the test is both necessary and sufficient for four cards.
Diaconis and Graham prove the general statement for every even packet: every order of the cards can be reached, and the common-signature condition is the only restriction on the faces, giving 2 × N! reachable states. The four-card search illustrates that theorem; it does not prove it.
Sources
Colm Mulcahy, Mathematical Card Magic, Chapter 9, pp. 211–212: The Lonely Card, with the alternating even packet and a single selected disturbance. It builds on Bob Hummer’s ideas about cards facing both ways.
Persi Diaconis and Ron Graham, Magical Mathematics, Chapter 1, p. 11 (alternating patterns) and pp. 12–14 (the exact reachable-state theorem). Allowing more mixing after the selection is justified here by the reference-packet argument; the four-card graph is a teaching illustration from the course.