MATH228

[Wesleyan Home Page] [Wesmaps Home Page] [Availability Statistics Search] [Course Description Search] [Dept. Search]

MATH228

Discrete Mathematics MATH228 SP

Spring 97 Availability (Last Updated on Thu Apr 17 05:00:17 EDT 1997 )

Section  Limit  Enrollment  Available
  01       999      0         Open

An introduction to discrete ("combinatorial") mathematical processes. Topics will include an introduction to some of the following. Mathematical induction, with applications; set theory; number theory; combinations and permutations; probability theory (with Bayes' theorem); generating functions.

MAJOR READINGS

EXAMINATIONS AND ASSIGNMENTS

Two or three hour exams, 1 three-hour final exam; frequent homework.

ADDITIONAL REQUIREMENTS and/or COMMENTS

This course has both a strong computational, "applied" flavor and a rigorous "theoretical" component: certain theorems are proved carefully and are then invoked to achieve concrete numerical results. This course is intended to help provide a secure foundation for the study of both mathematics and computer science.

COURSE FORMAT: Discussion Lecture

REGISTRATION INFORMATION

Level: UG Credit: 1.00 Gen Ed Area & Dept: NSM MATH

Prerequisites: MATH221 or MATH223

Section 01: Chan, C; Times: .T.T... 1:10PM;; Grading Mode: A/F; Registration Preference (1 high to 6 low, 0=Excluded) Sr: 1, Jr: 1, So: 1, Fr: 1; No Major Preference Given

Last Updated on MAR-10-1997

Contact wesmaps@wesleyan.edu to submit comments or suggestions.