Introductory Combinatorics.

Catalog description

Semester course; 3 lecture hours. 3 credits. Prerequisite: MATH 201 with a minimum grade of C. An introduction to basic combinatorial concepts such as combinations, permutations, binomial coefficients, Fibonacci numbers and Pascal’s triangle; basic theorems such as the pigeonhole principle and Newton’s binomial theorem; algorithms such as bubble sort and quicksort; and discussion of basic applications such as chessboard problems, combinatorial games, magic squares and Latin squares.