Mathematical Recursion: Induction and Recursion

Related lectures (24)

Page 2 of 3

Covers the basics of proofs, defining sets, and applications between sets.

Explores worst-case complexity, mathematical induction, and algorithms like binary search and insertion sort.

Covers the basic properties of holomorphic maps and Taylor series expansions in complex analysis.

Explores the Cartesian product in linear algebra and the method of induction for proving propositions.

Explores Lagrange multipliers for finding extrema under constraints and various proof methods.

Explores Newtonian potential in bounded domains, discussing its conditions and properties.

Covers examples of direct and indirect proofs in mathematics.

Introduces integer numbers, well-ordering, induction principles, GCD, LCM, and Bezout's theorem.

Covers the integration of differential forms on smooth manifolds, including the concepts of closed and exact forms.

Covers Dognion's Theorem, explaining the proof of infeasible Integer Programming problems.