
Contradiction and Induction
Zachary Abel teaches the second lecture of MIT's 6.1200J Mathematics for Computer Science, covering the foundational proof techniques that anchor the rest of the course. He walks through basic proof strategies before building up to two of the most powerful tools in a mathematician's kit: proof by contradiction and proof by induction. Abel works through examples on the board, showing how to structure a contradiction argument by assuming the negation of a claim and chasing it to an absurdity, then shifts to induction, demonstrating how to set up a base case and inductive step to prove statements that hold across all natural numbers. The eighty-minute session is lecture-format, chalkboard-driven, aimed at students building the proof-writing skills computer science relies on for algorithm correctness and discrete math. It is part of MIT OpenCourseWare's published course materials.