USING A CARD TRICK TO TEACH DISCRETE MATHEMATICS
Shai Simonson, Tara S. Holm · PRIMUS · 2003
We present a card trick that can be used to review or teach a variety of topics in discrete mathematics. We address many subjects, including permutations, combinations, functions, graphs, depth first search, the pigeonhole principle, greedy algorithms, and concepts from number theory. Moreover, the trick motivates the use of computers in mathematical research. The ultimate solution to the card trick makes use of Hall's Distinct Representative Theorem.