Ideal for students desiring additional experience with proofs before tackling advanced subjects like 18.701 (Algebra I), 18.100 (Real Analysis), or 18.901 (Introduction to Topology) catalog.mit.edu.
Injective (one-to-one), surjective (onto), bijective, and inverse functions. Equivalence relations (reflexive, symmetric, transitive) and partitions. 18.090 introduction to mathematical reasoning mit
Many MIT students find that transitioning to 18.090 is where they actually start "loving" math because they stop memorizing formulas and start understanding the underlying structures. It's often the class that helps students decide if they want to double-major in Course 18 (Mathematics) 18.0x - MIT Mathematics Many MIT students find that transitioning to 18
You might wonder why a computer scientist or engineer needs to spend an entire semester learning how to prove things that seem intuitively obvious. Then (n = 2k+1) for some integer (k)
When starting out, try to separate your "scratch work" from your "proof."
Solution outline (proof by contrapositive): Assume (n) is odd. Then (n = 2k+1) for some integer (k). Thus (n^2 = (2k+1)^2 = 4k^2+4k+1 = 2(2k^2+2k) + 1), which is odd. Therefore, if (n^2) is even, (n) cannot be odd, so (n) is even. ∎
Mastering the precise application of the universal quantifier ∀for all ("for all") and the existential quantifier ∃there exists ("there exists"). Implications: Deconstructing "If