MA 403 Discrete Mathematics
General counting methods are discussed in detail including: partition of integers, Fibonacci numbers, Triangle numbers, Catalan numbers, Bernoulli numbers, generating functions, recurrence relations, and the inclusion-exclusion principles. Graph theory and its many applications are considered and various types of circuits are described. The combinatorial results will be used to study graphs. Trees and tree searching are examined, and numerous network algorithms are considered.
Prerequisite
MA 272 or consent of instructor
Offered
Fall Odd Years
Notes