Around the Clock. New Twists on Fitch Cheney's Five-Card Trick

Fitch Cheney's five-card trick is one of the purest two-person effects in card magic, and it has attracted mathematicians for more than seventy five years. This article retells the effect and its classic method, surveys how far it can be pushed, and presents several new results that matter to performers. We give a version of Cheney's method that needs no fixed first suit and no fixed ``lowest card'': shifting every card one step in rank and one step in suit shifts the display in the same way. A heckler who may swap two neighboring cards of the display defeats every method with a full deck. We show that a 29-card deck is the largest for which such a swap can be corrected, and that the corresponding maximum is 14 cards if any two cards may be swapped. We give simple methods that achieve both bounds. Finally, we make Berlekamp's arithmetic method for the 124-card deck independent of where the numbering starts. We also describe a pocket version with eight cards.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-02
DOI
https://doi.org/10.48550/arxiv.2611.02424
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Around the Clock. New Twists on Fitch Cheney's Five-Card Trick

Yaakov Malinovsky, Doron Levy
arXiv (Cornell University)
Advanced Combinatorial Mathematics
preprint

Around the Clock. New Twists on Fitch Cheney's Five-Card Trick

Yaakov Malinovsky, Doron Levy
preprint en

Abstract

Fitch Cheney's five-card trick is one of the purest two-person effects in card magic, and it has attracted mathematicians for more than seventy five years. This article retells the effect and its classic method, surveys how far it can be pushed, and presents several new results that matter to performers. We give a version of Cheney's method that needs no fixed first suit and no fixed ``lowest card'': shifting every card one step in rank and one step in suit shifts the display in the same way. A heckler who may swap two neighboring cards of the display defeats every method with a full deck. We show that a 29-card deck is the largest for which such a swap can be corrected, and that the corresponding maximum is 14 cards if any two cards may be swapped. We give simple methods that achieve both bounds. Finally, we make Berlekamp's arithmetic method for the 124-card deck independent of where the numbering starts. We also describe a pocket version with eight cards.

arXiv (Cornell University)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon