Mathematics

MATH 260 Combinatorics

Combinatorial mathematics, including summation methods, binomial coefficients, combinatorial sequences (Fibonacci, Stirling, Eulerian, harmonic, Bernoulli numbers), generating functions and their uses, Bernoulli processes and other topics in discrete probability. Oriented toward problem solving applications. Applications to statistical physics and computer science.

Requirements

Enrollment is restricted to graduate students.

Credits

5

Instructor

The Staff