Tulane University 2006-2007 Catalog
Course:
MATH 320 Combinatorics (3)
Staff. Prerequisites: MATH 121, 122, and either 221 or 309 or approval of instructor. Basics of combinatorics with emphasis on problem solving. Provability, pigeonhole principle, mathematical induction. Counting techniques, generating functions, recurrence relations, Polya's counting formula, a theorem of Ramsey.
|
|
The information contained is provided by third parties, and SmartCatalog, its officers and employees disclaim any warranties regarding the accuracy, reliability, completeness or timeliness of any information on this web site, and may not be held liable for any losses caused by reliance on such information.
|