Lecture
Strong Induction: Proof Method and Application
Related lectures (27)
Cartesian Product and Induction
Introduces Cartesian product and induction for proofs using integers and sets.
Proofs and Logic: Introduction
Introduces logic, proofs, sets, functions, and algorithms in mathematics and computer science.
Proofs: Logic, Mathematics & Algorithms
Explores proof concepts, techniques, and applications in logic, mathematics, and algorithms.
Complexity & Induction: Algorithms & Proofs
Explores worst-case complexity, mathematical induction, and algorithms like binary search and insertion sort.
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
Elementary Algebra: Numeric Sets
Explores elementary algebra concepts related to numeric sets and prime numbers, including unique factorization and properties.
Fundamental Groups
Explores fundamental groups, homotopy classes, and coverings in connected manifolds.
The Topological Künneth Theorem
Explores the topological Künneth Theorem, emphasizing commutativity and homotopy equivalence in chain complexes.
Integers: Elementary Concepts
Covers fundamental concepts related to integers, including properties of well-ordered sets and the principle of induction.
Dimension theory of rings
Covers the dimension theory of rings, including additivity of dimension and height, Krull's Hauptidealsatz, and the height of general complete intersections.