Discrete Methods in Mathematics (MATH 261)

Term: 2010-2011 Fall Term

Faculty

Judith L SullivanShow MyInfo popup for Judith L Sullivan

Email address is hidden, click here to email

Merilyn A Ryan SSJShow MyInfo popup for Merilyn A Ryan SSJ

Email address is hidden, click here to email

Schedule

Mon-Wed-Fri, 8:15 AM - 9:15 AM (8/30/2010 - 12/17/2010) Location: MAIN MH 309

Description

Introduction to basic techniques and modes of reasoning of combinatorial problem solving. Topics chosen from logic, graph theory and combinatorics: graphs as models, trees, graph coloring, Eulerian and Hamiltonian circuits, elementary counting principles, permutations and combinations, inclusion/exclusion principle, recurrence relations. Prerequisite: MATH-204, or 202 or permission of the Department Chair.