Overview:

Discrete Mathematics introduces the university student in mathematics and computer science to the beginnings of higher mathematics. This course is intended to provide a transition for the advancing student of mathematics student from computational subjects to abstract and rigorous thinking. We also provide the computer science student with a background to the mathematics of computing. Topics include

We explore the theory and applications of our topics, including computer algorithm efficiency and the odds in games of chance. Students will write rigorous proofs and use modern technology to further investigate the topics. Click here to view a sample syllabus

Discrete Mathematics introduces the university student in mathematics and computer science to the beginnings of higher mathematics. This course is intended to provide a transition for the advancing student of mathematics student from computational subjects to abstract and rigorous thinking. We also provide the computer science student with a background to the mathematics of computing. Topics include

- The basics of logic and reasoning
- Proofs
- Sets, relations and functions
- Number theory, modular arithmetic
- Counting and discrete probability
- Graph theory

We explore the theory and applications of our topics, including computer algorithm efficiency and the odds in games of chance. Students will write rigorous proofs and use modern technology to further investigate the topics. Click here to view a sample syllabus