Difference between revisions of "Math 450: Combinatorics"
From MathWiki
(→Title) |
(→Minimal learning outcomes) |
||
| Line 21: | Line 21: | ||
=== Minimal learning outcomes === | === Minimal learning outcomes === | ||
| − | + | Permutations and combinations basics, including the Pigeonhole Principle, binomial coefficients and the Binomial Theorem, Stirling's Approximation, Inclusion/exclusion, Generating functions and recurrence relations (rational functions), Groups, permutations and counting problems -- Polya's Theorem | |
<div style="-moz-column-count:2; column-count:2;"> | <div style="-moz-column-count:2; column-count:2;"> | ||
Revision as of 08:45, 1 November 2010
Contents
Catalog Information
Title
Combinatorics.
(Credit Hours:Lecture Hours:Lab Hours)
(3:3:0)
Offered
Su
Prerequisite
Description
Permutations, combinations, recurrence relations, applications.
Desired Learning Outcomes
Prerequisites
Minimal learning outcomes
Permutations and combinations basics, including the Pigeonhole Principle, binomial coefficients and the Binomial Theorem, Stirling's Approximation, Inclusion/exclusion, Generating functions and recurrence relations (rational functions), Groups, permutations and counting problems -- Polya's Theorem
Textbooks
Possible textbooks for this course include (but are not limited to):
- Richard A. Brualdi, Introductory Combinatorics (5th Edition), Prentice Hall, 2010.
