LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES
Contradiction and Induction
SOURCE: YOUTUBE · NO TRACKING UNTIL YOU PRESS PLAY · TROUBLE PLAYING? WATCH AT THE SOURCE ↗

Contradiction and Induction

80 MIN · EN · STATUS: [ STREAMING ]
RATE THIS
MIT · Mathematics for Computer Science · LECTURE 2

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.

At a glance

Lecture facts

Runtime compared with the other 507 Mathematics lectures
Runtime1 h 20 m
Compared with MathematicsLonger than 76%
This series

Mathematics for Computer Science

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 2 of 221 h 19 m before this · 29 h 3 m in total

More from this course

12 LECTURES
Predicates, Sets, and Proofs

Predicates, Sets, and Proofs

MIT · 79 MIN
State Machines

State Machines

MIT · 81 MIN
Lecture 5: Sums

Lecture 5: Sums

MIT · 82 MIN
Lecture 6: Asymptotics

Lecture 6: Asymptotics

MIT · 78 MIN
Divisibility

Divisibility

MIT · 79 MIN
Modular Arithmetic

Modular Arithmetic

MIT · 80 MIN
Lecture 10: Cryptography

Lecture 10: Cryptography

MIT · 81 MIN
Graphs and Coloring

Graphs and Coloring

MIT · 81 MIN
Lecture 12: Matching

Lecture 12: Matching

MIT · 82 MIN
Lecture 13: Connectivity and Trees

Lecture 13: Connectivity and Trees

MIT · 82 MIN
Digraphs and DAGs

Digraphs and DAGs

MIT · 79 MIN
Relations and Counting

Relations and Counting

MIT · 79 MIN