| Line 8: | Line 8: | ||
== Interesting pages in the [[:Category:MA375|MA375 category]] == | == Interesting pages in the [[:Category:MA375|MA375 category]] == | ||
| + | *A tutorial on [[counting_subsets_of_sets|Counting Partitions or Subsets]], by [[Math_squad|Math Squad]] member [[user:somussma|Steve Mussmann]] | ||
| + | **[[Counting_subsets_of_sets_examples|examples of counting problems]] | ||
| + | **[[Counting_subsets_of_sets_problems|practice problems]] | ||
*[[P_%3D_NP_MA375Fall2008walther|Is N=NP?]] | *[[P_%3D_NP_MA375Fall2008walther|Is N=NP?]] | ||
*[[2008/08/26_MA375Fall2008walther|The principle of induction and why there is no Nobel prize in math]] | *[[2008/08/26_MA375Fall2008walther|The principle of induction and why there is no Nobel prize in math]] | ||
Revision as of 17:05, 18 March 2013
Contents
MA375: Discrete Mathematics
Peer Legacy
Share advice with future students regarding MA375 on this page.
Interesting pages in the MA375 category
- A tutorial on Counting Partitions or Subsets, by Math Squad member Steve Mussmann
- Is N=NP?
- The principle of induction and why there is no Nobel prize in math
- Special Sequences of Numbers
- Mystery of Probability
- Games and Mathematics
- The Use of Graph Theory
- Explaining a Clay Problem
- Coloring Problems
- Greedy Methods
- Cantor Sets and Continua
- What really IS a real number
Semester/Instructor specific pages
- Sprinf 2012, Prof. Walther
- Spring 2010, Prof. Walther
- Spring 2009, Prof. Walther
- Fall 2008, Prof. Walther
