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
Lec 10
Mon 11:30-12:20
Lec 10
Thu 12:30-13:20
Lec 10
Tue 13:30-14:20
Syllabus
Have the syllabus for MATH 347? Share it and everyone gets the grading, textbooks and rules.