Book contents
- Frontmatter
- Introduction
- Dedication
- Contents
- I Classroom-tested Projects
- The Game of “Take Away”
- Pile Splitting Problem: Introducing Strong Induction
- Generalizing Pascal: The Euler Triangles
- Coloring and Counting Rectangles on the Board
- Fun and Games with Squares and Planes
- Exploring Recursion with the Josephus Problem: (Or how to play “One Potato, Two Potato” for keeps)
- Using Trains to Model Recurrence Relations
- Codon Classes
- How to change coins, M&M's, or chicken nuggets: The linear Diophantine problem of Frobenius
- Calculator Activities for a Discrete Mathematics Course
- Bulgarian solitaire
- Can you make the geodesic dome?
- Exploring Polyhedra and Discovering Euler's Formula
- Further Explorations with the Towers of Hanoi
- The Two Color Theorem
- Counting Perfect Matchings and Benzenoids
- Exploring Data Compression via Binary Trees
- A Problem in Typography
- Graph Complexity
- II Historical Projects in Discrete Mathematics and Computer Science
- III Articles Extending Discrete Mathematics Content
- IV Articles on Discrete Mathematics Pedagogy
- About the Editor
Generalizing Pascal: The Euler Triangles
from I - Classroom-tested Projects
- Frontmatter
- Introduction
- Dedication
- Contents
- I Classroom-tested Projects
- The Game of “Take Away”
- Pile Splitting Problem: Introducing Strong Induction
- Generalizing Pascal: The Euler Triangles
- Coloring and Counting Rectangles on the Board
- Fun and Games with Squares and Planes
- Exploring Recursion with the Josephus Problem: (Or how to play “One Potato, Two Potato” for keeps)
- Using Trains to Model Recurrence Relations
- Codon Classes
- How to change coins, M&M's, or chicken nuggets: The linear Diophantine problem of Frobenius
- Calculator Activities for a Discrete Mathematics Course
- Bulgarian solitaire
- Can you make the geodesic dome?
- Exploring Polyhedra and Discovering Euler's Formula
- Further Explorations with the Towers of Hanoi
- The Two Color Theorem
- Counting Perfect Matchings and Benzenoids
- Exploring Data Compression via Binary Trees
- A Problem in Typography
- Graph Complexity
- II Historical Projects in Discrete Mathematics and Computer Science
- III Articles Extending Discrete Mathematics Content
- IV Articles on Discrete Mathematics Pedagogy
- About the Editor
Summary
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9780883859742/resource/name/firstPage-9780883859742c3_p11-18_CBO.jpg)
- Type
- Chapter
- Information
- Resources for Teaching Discrete MathematicsClassroom Projects, History Modules, and Articles, pp. 11 - 18Publisher: Mathematical Association of AmericaPrint publication year: 2009