A continuation of the introduction to combinatorics begun in MTH 2250. Topics include the principles of counting patterns by means of generating functions, recurrence relations, and Polya’s Theory; the existence of patterns by means of the pigeonhole principle and its generalizations; and the optimization of patterns by means of the minimax principle.
