The Discrete Mathematics Project
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Dominic Peressini; University of Colorado at Boulder|
|Archived resources from the collaboration of the UC Boulder School of Education and Department of Applied Mathematics. Activities sketch goals, abstracts, brief problem statements, instructor suggestions, suggestions for curriculum integration and further investigation, and alignment with NCTM Standards and Colorado Model Content Standards. Activities are organized into Election Theory (fair sharing, group-ranking, weighted voting, consensual weighted voting, approval voting), Fair Division (apportionment, fair division, estate division, allocation), Graph Theory (Euler paths, Euler circuits, Hamiltonian circuits, map coloring, shortest routes, trees), Counting Techniques (odds of poker hands, counting methods, permutations, combinations, Venn diagrams, odds of winning the lottery), Discrete Probability (Markov chains, conditional probability, event independence and dependence, transition matrices, stable state vectors), Matrix Models (game theory, digraphs, Leontief Input/Output Model for Economies), and the Mathematics of Iteration/Recursion (recurrence relations, queuing theory, recursion and Fibonacci sequence). Also, a glossary of terms in discrete math, a bibliography, and collections of links.|
|Levels:||High School (9-12), College|
|Resource Types:||Lesson Plans and Activities, Link Listings, Departments, Bibliographies, Dictionaries, Glossaries, Thesauri|
|Math Topics:||Discrete Math, Combinatorics, Graph Theory|
© 1994- Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.