Âé¶¹Ö±²¥

Skip to main content

MATH 215 Discrete Mathematics

This course covers a variety of important topics in math and computer science. Topics include: logic and proof, sets and functions, induction and recursion, elementary number theory, counting and probability, and basic theory of directed graphs.

Prerequisites

Special information

Note: Students whose prerequisites are not identified by the system should contact the Math and Statistics department for an override at MATH@metrostate.edu.
4 Undergraduate credits

Effective August 1, 1998 to present

Meets graduation requirements for

Learning outcomes

General

  • Use the language of symbolic logic and predicate calculus to describe, and make deductions about, simple statements.
  • Create direct proofs, proofs by contradiction and proofs by mathematical induction.
  • Apply fundamental combinatorics principles including permutations and combinations to discrete probability problems.
  • Apply recursive definitions and algorithms.
  • Interpret numbers written in different number systems and convert from one number system to another.
  • Use fundamental concepts of elementary number theory including divisibility, modular arithmetic and the Euclidean algorithm.
  • Understand functions, relations and graphs.

Spring 2026

Section Title Instructor books eservices
01 Discrete Mathematics Samuel, Delia D
02 Discrete Mathematics Hepola, Brandon D
50 Discrete Mathematics Naughton, Gerry
51 Discrete Mathematics Horan, Sean T
52 Discrete Mathematics Horan, Sean T

Summer 2026

Section Title Instructor books eservices
01 Discrete Mathematics Samuel, Delia D
02 Discrete Mathematics Roddin, Daniel William
50 Discrete Mathematics Naughton, Gerry

Fall 2026

Section Title Instructor books eservices
01 Discrete Mathematics Green, Michael D
02 Discrete Mathematics Green, Michael D
03 Discrete Mathematics Moniri, Mojtaba
50 Discrete Mathematics Naughton, Gerry
51 Discrete Mathematics Horan, Sean T