Conjecture and Proof in Discrete Mathematics (MAT4131.01)

Steven Morics

Using concepts from combinatorial mathematics and computer science, this course is an introduction to the nature and process of doing mathematics; playing around with patterns, making conjectures, and then stating and proving theorems. The course revolves around a large collection of open-ended problems, concerning topics from graph theory, game theory, set theory, combinatorics, algorithms, geometry, logic, probability, and coding theory, and students can choose to focus on problems in which they have the most interest. Student work is compiled in a journal, and students will share conjectures and proofs with each other throughout the course. Specific proof techniques, such as induction and contradiction, will also be addressed.

Prerequisites: One college-level course in mathematics or computer science
Credits: 4
M 8:00am - 9:50am; Th 8:00am - 9:50am
Maximum Enrollment: 16
Course Frequency:
This course is categorized as Steven Morics, All courses, Four Credit, 4000, Mathematics, Monday and/or Thursday Mornings.