ConceptMathematics
Strong induction
A form of mathematical induction where the inductive step assumes the statement is true for all values up to n, rather than just for n.
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
3Each in their own terms, from the easiest level.
Vicky Neale
A form of mathematical induction where the inductive step assumes the statement is true for all cases smaller than the current one, rather than just the immediately preceding case.Tom Leighton
An induction proof method where we assume the statement holds for all smaller values up to n to prove it for n + 1.Francis Su
An equivalent form of induction where you assume all statements up to are true to prove .
Connections
13The lectures that define it or assume it, and the concepts next to it.