Using a card trick to teach discrete mathematics

PRIMUS

Volumn 13, Issue 3, 2003, Pages 248-269

  Simonson, Shai ^a   Holm, Tara S ^b  

^a STONEHILL COLLEGE   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algorithm; Card trick; Combinatorics; Discrete mathematics; Graph theory; Hall's Theorem

Indexed keywords

EID: 48749094363     PISSN: 10511970     EISSN: 19354053     Source Type: Journal    
DOI: 10.1080/10511970308984061     Document Type: Article

References (10)

1. Bondy, J. A. and U. S. R. Murty. 1982. Graph theory with applications. New York: North Holland Publishing.
2. Chartrand, G. and L. Lesniak. 1996. Graphs & Digraphs, Third Ed. New York: Chapman & Hall.
3. Gardner, M. 1956. Mathematics, Magic and Mystery. New York: Dover, 1956, p. 32.
4. Kierstead, D. and H. Kierstead, “Combinatorial Card Tricks,” manuscript. See http://dimacs.rutgGrs.edu/drei/1998/weekl.html.
5. Kleber, M. The Best Card Trick. In preparation.
6. Lee, W. Math Miracles. 1950. Durham NC: Seeman Printery. pp. 4951.
7. Mathematical Sciences Research Institute newseletter. The Emisarry. http://www.msri.org/ext/Emissary/EmissaryJanOl.pdf.
8. Mulcahy, C. Fitch Cheney s Five Card Trick. To appear in Math Horizons, February 2003.
9. Simonson, S. 2002. A Post-Baccalaureate Undergraduate Level Program in Computer Science. On-Site Article. Communications of the ACM 45(7): 21–24.
10. Simonson, S. “A Combinatorial Card Trick: Teaching discrete math to computer scientists should be fim.” Lecture at the Eighth International Conference on Humem Interface Technology, The University of Aiza, AizuWakamatsu City, Japan, March 2002. For http://www.stonehill.edu/compsci/Japan.htm.