Mar 28, 2024  
2013-2014 Undergraduate 
    
2013-2014 Undergraduate [ARCHIVED BULLETIN]

Add to Portfolio (opens a new window)

MATH 351 - Introduction to Combinatorics

(3)
An introduction to enumerative combinatorics. Topics include permutations, combinations, Stirling numbers, integer partitions, distribution problems, combinatorial proof, recurrence relations, generating functions, Fibonacci numbers, rook theory, and the principle of inclusion-exclusion. Prerequisite(s): MATH 231 ;or MATH 251  ;or MATH 252 . Offered fall semester in even years.



Add to Portfolio (opens a new window)