18.090 Introduction To Mathematical Reasoning Mit -

18.090 — Introduction to Mathematical Reasoning (overview & key content)

Introduction: The Hidden Threshold

For many students entering the hallowed halls of the Massachusetts Institute of Technology, there is a silent, often terrifying, academic barrier. It is not calculus—most MIT freshmen have already mastered differentiation and integration in high school. It is not linear algebra or differential equations. The true hurdle is mathematical maturity.

This is where 18.090 Introduction to Mathematical Reasoning enters the picture. Unlike MIT’s famous calculus sequence (18.01, 18.02) or the rigorous analysis class (18.100), 18.090 sits in a unique pedagogical sweet spot. It is a bridge course—a linguistic and logical boot camp designed to transform a student who computes into a mathematician who proves.

In this article, we will dissect the philosophy, curriculum, pedagogy, and enduring value of MIT’s 18.090. Whether you are a prospective MIT student, a self-learner looking for a gold-standard curriculum, or an educator designing a "transition to proof" course, this guide will explain why 18.090 is considered one of the most impactful courses in the undergraduate experience.

The 18.090 Experience: A Week in the Life

Unlike a lecture-heavy physics course, 18.090 is structured for active struggle.

How to Succeed in 18.090 (Advice from Past Students)

1. Write your proofs in complete sentences. No bullets. No "arrows." Mathematics is a language. Speak it fully.
2. Start every proof with "Proof." and end with ( \square ) (or QED). It forces structure.
3. Use the "draft method." Write a messy, scratch-work proof first. Then rewrite it cleanly. The final draft should be linear and logical, not a transcription of your discovery process.
4. Go to office hours. Proof grading is subjective. Ask the TA, "Would this sentence count as a valid step?"
5. Form a study group. Four people staring at "Prove the Cantor-Bernstein-Schröder theorem" is better than one.

4. Pedagogical Approach

The course departs from lecture-only formats. Common practices include: 18.090 introduction to mathematical reasoning mit

• In-class group proofs: Students work in small groups on a given statement, then present their reasoning.
• “Error analysis” assignments: Students are given flawed proofs and must identify and correct logical mistakes.
• Weekly problem sets: These blend computational checks (e.g., truth tables) with open-ended proof construction.
• Writing intensive: Proofs are graded for both mathematical correctness and English clarity. Ambiguous language loses points.

A distinctive MIT feature is the use of LaTeX for final projects. Students write a short paper (3–5 pages) proving a non-trivial theorem of their choice, from Cantor’s diagonal argument to the infinitude of primes in arithmetic progressions (special case).

3. Typical Syllabus Outline

While the exact syllabus evolves, a representative semester includes:

| Week | Topic | |------|-------| | 1 | Logical connectives, truth tables, tautologies | | 2 | Quantifiers, negations, converse/inverse | | 3 | Proof techniques: direct, contrapositive, contradiction | | 4 | Mathematical induction (ordinary and strong) | | 5 | Sets: union, intersection, power sets, Cartesian products | | 6 | Functions: injective, surjective, bijective, inverses | | 7 | Relations: equivalence relations, partitions | | 8 | Midterm review & exam | | 9 | Number theory: divisibility, primes, GCD, Euclidean algorithm | | 10 | Modular arithmetic and proofs | | 11 | Real numbers: least upper bound property, sequences | | 12 | Countability: finite, countably infinite, uncountable sets | | 13 | Introduction to combinatorial proofs | | 14 | Final review and project presentations |

📝 Study Strategy: How to Succeed

This course is notorious for being a "shock" to students who relied solely on memorization in calculus. Write your proofs in complete sentences

Core topics

• Logic & language of mathematics

  • Propositions, logical connectives (∧, ∨, →, ↔, ¬)
  • Truth tables, logical equivalence, implications
  • Quantifiers: ∀, ∃, order and scope, negation of quantified statements

• Proof techniques

  • Direct proof
  • Proof by contrapositive
  • Proof by contradiction
  • Proof by cases
  • Proof by exhaustion
  • Existence proofs (constructive vs nonconstructive)
  • Uniqueness proofs
  • Mathematical induction (basic, strong/complete induction)
  • Well-ordering principle and its equivalence with induction

• Sets, functions, and relations

  • Set notation, subsets, power sets, set operations
  • Functions: domain, codomain, injective, surjective, bijective; composition and inverses
  • Cardinality basics (finite, countable vs uncountable intuition)
  • Relations, equivalence relations, partitions, partial orders

• Number theory basics

  • Divisibility, greatest common divisors, Euclidean algorithm
  • Prime numbers, fundamental theorem of arithmetic
  • Congruences (modular arithmetic) and basic applications

• Combinatorics & counting

  • Basic counting rules, binomial coefficients, Pascal’s identity
  • Pigeonhole principle and simple applications
  • Introductions to permutations and combinations as proof/argument examples

• Elementary structures and examples

  • Sequences and limits (informal usage to illustrate proofs)
  • Polynomials and basic algebraic identities used in proofs
  • Examples that motivate abstraction: vector spaces, groups (introductory examples only)

• Proof-writing practice

  • Translating informal reasoning into formal proofs
  • Writing clear, logical, step-by-step arguments
  • Common pitfalls (ambiguous quantifiers, hidden assumptions, circular reasoning)

What You Will Learn

Unlike calculus, where you apply formulas, this course teaches you how to verify truth. You will learn the language of mathematics. Logic & Set Theory: Propositional logic

• Logic & Set Theory: Propositional logic, truth tables, quantifiers ($\forall, \exists$), set operations, and functions.
• Proof Techniques: Direct proof, proof by contradiction, proof by induction, and proof by contrapositive.
• Discrete Structures: Relations, equivalence relations, partitions, and cardinality.
• Introductory Analysis: Depending on the instructor, you may touch on epsilon-delta limits or properties of real numbers.