ConceptMathematics
Mathematical induction
A proof technique used to establish that a statement is true 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.
Logical implication4Natural numbers3Algebraic operations1Conjectures1Implication1Limit1Statements1Well-ordering property1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
5Each in their own terms, from the easiest level.
Vicky Neale
A proof technique that establishes a statement for all natural numbers by showing it holds for zero and that if it holds for a number, it holds for its successor.Casey Rodriguez
A theorem stating that if a statement is true for 1 and its truth for m implies its truth for m plus 1, then it is true for all natural numbers.Ankur Moitra
A proof technique that establishes a statement for all natural numbers by proving a base case and an inductive step.Herbert Gross
A technique used to prove something when one already has a pretty good suspicion as to what the right answer is.
Lectures that assume it
34The first 12 are shown.
- Cantor's Theory of Cardinality (Size)
- Sums and Asymptotics
- Course Overview, Interval Scheduling
- Mathematical Induction
- Strong Induction
- Graph Theory and Coloring
- Matching Problems
- Backward Induction: Chess, Strategies, and Credible Threats
- Divide and Conquer Recurrences
- Natural Numbers and Induction
- Dijkstra's Shortest Path Algorithm: Graph Theory and Optimization
- Convergent Sequences of Real Numbers
Connections
47The lectures that define it or assume it, and the concepts next to it.
Concepts8
- Logical implication
- Natural numbers
- Implication
- Strong induction
- Associativity of addition
- Binomial theorem
Show 2 moreShow fewer
Lectures39
- Sets, Set Operations and Mathematical Induction
- Principle of Induction
- Inclusion-Exclusion
- Foundations of University Mathematics: From Calculation to Proof
- Mathematical Induction
- Cantor's Theory of Cardinality (Size)
Show 33 moreShow fewer
- Sums and Asymptotics
- Course Overview, Interval Scheduling
- Mathematical Induction
- Strong Induction
- Graph Theory and Coloring
- Matching Problems
- Backward Induction: Chess, Strategies, and Credible Threats
- Divide and Conquer Recurrences
- Natural Numbers and Induction
- Dijkstra's Shortest Path Algorithm: Graph Theory and Optimization
- Convergent Sequences of Real Numbers
- Limsup, Liminf, and the Bolzano-Weierstrass Theorem
- Absolute Convergence and the Comparison Test for Series
- Binomial Theorem and Sets
- Equality II
- Nash Equilibrium
- The Complex Numbers
- The Continuity of Sine and Cosine and the Many Discontinuities of Dirichlet's Function
- Theory of Generalization
- Poisson Brackets, Angular Momentum & Conserved Quantities
- Graph Theory II: Minimum Spanning Trees
- Many Versus Infinite
- Binary Relations, Partitions & Equivalence Relations
- Correctness Proofs of Distributed Systems with Isabelle
- Quantum Field Theory: Lecture 08
- Number Theory I
- Bellman-Ford
- Graph Theory III
- Conditional Probability
- Rationalizability
- Synchronous Distributed Algorithms: Symmetry-Breaking and Shortest-Paths Spanning Trees
- Voltage Dividers, Equivalent Resistance, and Touchscreens
- Structure of Neural Networks for Deep Learning