18.090 Introduction To Mathematical Reasoning Mit [patched] Review

This course is the bridge from computational calculus to rigorous proof-based mathematics. It covers logic, sets, functions, proof techniques (induction, contradiction), and basic number theory/analysis.

📝 Study Strategy: How to Succeed

This course is notorious for being a "shock" to students who relied solely on memorization in calculus. 18.090 introduction to mathematical reasoning mit

: Proving "If not Q, then not P" to establish "If P, then Q". Proof by Contradiction This course is the bridge from computational calculus

Mathematical Induction

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). Textbook chapters on proof methods (e

Course focus and learning outcomes

Resources to study (types)

• Textbook chapters on proof methods (e.g., “How to Prove It” by Velleman)
• Problem sets focused on short proof exercises + graded write-ups
• Lecture notes and worked examples emphasizing common proof patterns
• Peer review of written proofs or instructor feedback