Resources for teaching discrete mathematics classroom projects, history modules, and articles (Mathematical Association of America, 2009)
Includes bibliographical references
pt. 1. Classroom-tested projects. The game of "Take Away" / Mark MacLean -- Pile splitting problem: introducing strong induction / Bill Marion -- Generalizing Pascal: the Euler Triangles / Sandy Norman and Betty Travis -- Coloring and counting rectangles on the board / Michael A. Jones and Mika Munakata -- Fun and games with squares and planes / Maureen T. Carroll and Steven T. Dougherty -- Exploring recursion with the Josephus Problem: (or how to play "One Potato, Two Potato" for keeps) / Douglas E. Ensley and James E. Hamblin -- Using trains to model recurrence relations / Benjamin Sinwell -- Codon classes / Brian Hopkins -- How to change coins, M&M's, or chicken nuggets: the linear Diophantine problem of Frobenius / Matthias Beck -- Calculator activities for a discrete mathematics course / Jean M. Horn and Toni T. Robertson -- Bulgarian solitaire / Suzanne Dorée -- Can you make the geodesic dome? / Andrew Felt and Linda Lesniak --
- Exploring polyhedra and discovering Euler's Formula / Leah Wrenn Berman and Gordon Williams -- Further explorations with the Towers of Hanoi / John Stadler -- The two color theorem / David Hunter -- Counting perfect matchings and benzenoids / Fred J. Rispoli -- Exploring data compression via binary trees / Mark Daniel Ward -- A problem in typography / Larry E. Thomas -- Graph complexity / Michael Orrison -- pt. 2. Historical projects in discrete mathematics and computer science. Introduction / Janet Barnett ... [et al.] -- Binary arithmetic: from Leibniz to von Neumann / Jerry M. Lodder -- Arithmetic backwards from Shannon to the Chinese abacus / Jerry M. Lodder -- Pascal's treatise on the arithmetical triangle: mathematical induction, combinations, the binomial theorem and Fermat's theorem / David Pengelley -- Early writings on graph theory: Euler circuits and the Königsberg bridge problem / Janet Heine Barnett -- Counting triangulations of a convex polygon / Desh Ranjan --
- Early writings on graph theory: Hamiltonian circuits and the Icosian Game / Janet Heine Barnett -- Are all infinities created equal? / Guram Bezhanishvili -- Early writings on graph theory: topological connections / Janet Heine Barnett -- A study of logic and programming via Turing machines / Jerry M. Lodder -- Church's thesis / Guram Bezhanishvili -- Two-way deterministic finite automata / Hing Leung -- pt. 3. Articles extending discrete mathematics content. A rabbi, three sums, and three problems / Shai Simonson -- Storing graphs in computer memory / Larry E. Thomas -- Inclusion-exclusion and the topology of partially ordered sets / Eric Gottlieb -- pt. 4. Articles on discrete mathematics pedagogy. Guided group discovery in a discrete mathematics course for mathematics majors / Mary E. Flahive -- The use of logic in teaching proof / Susanna S. Epp