ConceptTheory & Algos
Proof by induction
A proof technique used to establish that a statement holds for all natural numbers by showing a base case and an inductive step.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
6Each in their own terms, from the easiest level.
Tom Leighton
Vicky Neale
A proof method useful for proving statements indexed by the natural numbers.Erik Demaine & Srini Devadas
A mathematical proof technique used to prove a statement for all natural numbers by showing it holds for a base case and that if it holds for one case, it holds for the next.Ben Polak
A method of mathematical proof that establishes a statement for a base case and then shows that if it holds for a case N, it must also hold for the case N+1.Eric Grimson
A proof method showing a base case holds and that if a property holds for n, it holds for n+1.Marten van Dijk
A proof technique establishing a statement for all natural numbers by showing a base case and an inductive step.
Lectures that assume it
1Connections
15The lectures that define it or assume it, and the concepts next to it.