MATH 251(F,S) Discrete Mathematics (Q)
As a complement to calculus, which is the study of continuous processes, this course focuses on the discrete, including finite sets and structures, their properties and applications. Topics will include basic set theory, infinity, graph theory, logic, counting, recursion, and functions. The course serves as an introduction not only to these and other topics but also to the methods and styles of mathematical proof.
Format: lecture/discussion. Evaluation will be based primarily on homework, classwork, and exams.
Prerequisites: Mathematics 104 or Mathematics 103 with Computer Science 134 or one year of high school calculus with permission of instructor. No enrollment limit (expected: 20).
Hour: MORGAN
Second Semester: GARRITY
Not offered 2007-2008
MATH 251T Introduction to Mathematical Proof and Argumentation (Q)
The fundamental focus of this tutorial is for students to acquire the ability to create and clearly express mathematical arguments through an exploration of topics from discrete
mathematics. Students will learn various mathematical proof techniques while discovering
such areas as logic, number theory, infinity, geometry, graph theory, and probability. Our
goal is not only to gain an understanding and appreciation of interesting and important areas
of mathematics but also to develop and critically analyze original mathematical ideas and
argumentation. Note: this course fulfills the same requirements as does Mathematics 251 but
credit will not be given for both Mathematics 251T and Mathematics 251.
Format: tutorial. Evaluation will be based primarily on performance on written work, oral
presentations, and examinations.
Prerequisites: Mathematics 104 or Mathematics 103 with Computer Science 134 or one year
of high school calculus with permission of instructor. Enrollment limit: 10 (expected: 10).
PACELLI