MATH 029. Discrete Mathematics
An introduction to noncontinuous mathematics. The key theme is how induction, iteration, and recursion can help one discover, compute, and prove solutions to various problems-often problems of interest in computer science, social science, or management. Topics will include mathematical induction and other methods of proof, recurrence relations, counting, and graph theory. Additional topics may include algorithms, and probability. There is a strong emphasis on good mathematical writing, especially proofs. While it does not use any calculus, MATH 029 is a more sophisticated course than MATH 015 or MATH 025 ; thus success in a calculus course demonstrates the mathematical maturity needed for MATH 29.
Prerequisite: Strong knowledge of at least precalculus, as evidenced by taking another mathematics course numbered 15 or above, or through our placement examinations (see "Placement Procedure " section). Familiarity with some computer language is helpful but not necessary.
Natural sciences and engineering.
Eligible for COGS
Fall 2017. Drellich.
Spring 2018. Drellich, Bergstrand.
Fall 2018. Davis.
Spring 2019. Staff.
Fall 2019. Staff.
Spring 2020. Staff.
Catalog chapter: Mathematics and Statistics
Department website: http://www.swarthmore.edu/mathematics-statistics