Basics of combinatorics with emphasis on problem solving. Provability, pigeonhole principle, mathematical induction. Counting techniques, generating functions, recurrence relations, Polya's counting formula, a theorem of Ramsey.

pre-rec: MATH 121, 122, and either 221 or 309 or approval of instructor.