Skip to main content
Oregon State
Mathematics
4 credits

Oregon State MTH 231: Elements of Discrete Mathematics

MTH 231 is the math department's discrete mathematics course (logic, set theory, induction, counting, relations, and graph theory), required for Corvallis CS majors and a common path for students who need the discrete foundation from the math side rather than CS 225.

Fennie is independent and not affiliated with Oregon State University. This is an unofficial study guide.

What makes it hard

It's most students' first proof-based math, and the grading shift is the shock: points follow the validity of the argument, not the plausibility of the conclusion. Induction and counting are the classic twin walls. One demands a rigid structure most students have never written, the other hides multiple problem types behind identical-looking sentences.

What you'll cover

  • Propositional and predicate logic
  • Set theory and functions
  • Mathematical induction
  • Counting and combinatorics
  • Relations
  • Graph theory basics

The MTH 231 study guide

How to study for Oregon State MTH 231, step by step.

  1. 1

    Write arguments, not answers

    MTH 231 grades the reasoning chain, so practice producing it: every problem gets a justification, even the ones you can eyeball. The habit is the curriculum.

  2. 2

    Make induction a fill-in-the-blank form

    Base case, hypothesis, step: the skeleton never changes, so practice it until only the content varies. Twenty induction proofs in, the format is free points instead of a wall.

  3. 3

    Sort counting problems by type first

    Permutation or combination, repetition or not: written classification before any arithmetic. The unit's errors are misidentifications wearing calculation costumes.

  4. 4

    Translate logic both directions daily

    English to symbols and symbols back to English, a few statements per day. Quantifier fluency is quietly load-bearing for every later unit and every CS course after.

Today

Today's MTH 231 plan

Preview
65 min

What a Fennie Daily Plan looks like for MTH 231. Yours is built from your own syllabus and adapts every day to your deadlines and progress.

0 / 4 done~65m remaining
Keep this plan free

First plan free, no card required. Fennie is independent and unaffiliated with your school.

FAQ

Is MTH 231 hard at Oregon State?

It's a mode-switch course: the arithmetic is easy and the rigor is new. Students who write proofs weekly and get them checked do well; students who study by reading worked solutions discover at the first midterm that recognition isn't production.

Do I take MTH 231 or CS 225?

Depends on your program: Corvallis CS plans typically route through MTH 231, while the Ecampus postbacc uses CS 225. The content overlaps heavily, so check your degree audit rather than choosing by reputation.

Why does computer science require discrete math?

It's the reasoning substrate of the field: algorithm correctness, complexity arguments, logic in circuits and queries, graphs everywhere. Every theory-flavored CS course after this one quietly assumes these tools are loaded.

More Oregon State courses