Skip to main content
CMU
Mathematical Sciences
12 credits

CMU 21-127: Concepts of Mathematics

21-127 is CMU's introduction to mathematical proof — logic, sets, functions, induction, number theory, and combinatorics — required early for CS and math majors as the gateway to everything proof-based, including 15-251. For most students it's the first course where the answer is an argument.

Fennie is independent and not affiliated with Carnegie Mellon University. This is an unofficial study guide.

Build my 21-127 study plan

What makes it hard

Proof-writing is graded on precision of language, and answers with 'the right idea' but loose writing lose most of their points — a recalibration most students get on the first homework. Induction is the classic wall, and the course's pace assumes you internalize each proof technique within a week of meeting it.

What you'll cover

  • Logic and quantifiers
  • Sets, relations, and functions
  • Proof techniques
  • Induction in all forms
  • Number theory basics
  • Combinatorics and counting

The 21-127 study guide

How to study for CMU 21-127, step by step.

  1. 1

    Learn the proof templates as templates

    Direct, contrapositive, contradiction, induction — each has a required shape with required sentences. Drill the scaffolding first; mathematical creativity is what you do inside it, not instead of it.

  2. 2

    Write complete proofs, never sketches

    The gap between 'I see why' and a precise argument is where 127 points die. Write every practice proof in full and compare line by line against solutions to calibrate the rigor bar.

  3. 3

    Give induction extra repetitions

    It underwrites half the course and 15-251 after it, and most first attempts misuse the hypothesis. Practice until stating it precisely and invoking it honestly is reflexive.

  4. 4

    Make quantifiers physical

    For-all versus there-exists errors quietly invalidate proofs all semester. Practice negating quantified statements and translating between English and notation until it's mechanical.

  5. 5

    Start homework early — proofs need incubation

    The argument that won't come Tuesday surfaces Thursday, but only if you've read the problem by Tuesday. Deadline-night proof-writing submits your worst thinking on every problem.

  6. 6

    Build the rigor habit with Fennie

    Upload your 21-127 syllabus and Fennie's Daily Plan schedules daily proof practice with early homework starts by design, plus quizzes generated from the actual course definitions and theorems. Free to start.

    Start my 21-127 plan free

How Fennie helps with 21-127

Fennie's Daily Plans schedule the daily proof reps 21-127 demands, with homework paced from release so arguments get incubation time. Chat examines your proof's structure — what the hypothesis actually grants, where the quantifiers slip — building the precision the grading rewards, against your course's own definitions.

FAQ

Is 21-127 hard?

It's a genuine gear-shift: the first course graded on argument precision, where right ideas in loose language lose points. The first homework recalibrates almost everyone. Students who practice writing complete proofs daily adapt within weeks; it's a learnable skill, not a talent filter.

Why do CS majors need 21-127?

It's the proof foundation that 15-251, 15-210's analysis, and all of theoretical CS assume. The induction fluency in particular gets used constantly — recursive correctness arguments are induction proofs wearing a different shirt.

How do I get better at proofs in 21-127?

Volume plus calibration: write full proofs for many problems, then diff your writing against solutions line by line to see exactly where rigor leaked. Office hours feedback early in the semester is the fastest calibration available — use it before the first exam, not after.

Pass 21-127 with a plan, not a cram

Upload your 21-127 materials and Fennie generates a Daily Plan paced to your deadline — plus chat, flashcards, and quizzes built from the actual course content.

Get started free

More CMU courses