MATH 347

Combinatorics

Lec 10, Lec 10 and Lec 10 selected

The course covers the principle of inclusion and exclusion; generating functions; recurrence relations; rings and modular arithmetic; finite state machines; group and coding theory; Pólya’s method of enumeration; finite field and combinatorial design; graph theory.

Sections

Lecture, pick one

Syllabus

Have the syllabus for MATH 347? Share it and everyone gets the grading, textbooks and rules.
Termly is not affiliated with St. Francis Xavier University.Buy me a coffee