Lecture

Induction and Recursion: Summary

Related lectures (21)

Fibonacci Numbers: Recursion and Induction

Explores Fibonacci numbers, rabbit population growth, and recursively defined functions.

Cartesian Product and Induction

Introduces Cartesian product and induction for proofs using integers and sets.

Complexity & Induction: Algorithms & Proofs

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Mathematical Induction: Basics and Applications

Introduces mathematical induction principles and applications, including inequalities, divisibility, subsets, and strong induction.

Course Overview: Teaser on Course Contents

Offers an overview of propositional and predicate logic, sets, functions, relations, algorithms, Swiss cities, sorting tables, Covid infections, poker hands, and prime numbers.

Sets and Operations: Introduction to Mathematics

Covers the basics of sets and operations in mathematics, from set properties to advanced operations.

Introduction to Analysis: Understanding Real Numbers and Proofs

Covers the basics of analysis, including real numbers, proofs, sets, and operations.

Group Actions: Theory and Examples

Explores concrete examples of group actions on sets, focusing on actions that do not change the set.

Optimization Algorithms: Greedy Approach

Explores optimization problems and greedy algorithms for efficient decision-making.

Functions: Definitions and Notations

Covers the generalities of functions, including the definition of an application between sets and the uniqueness of elements in the image set.

Recursively Defined Functions

Introduces recursively defined functions, showcasing examples like the Fibonacci numbers.

Recursively Defined Functions

Introduces recursively defined functions and demonstrates how to compute values and prove properties using mathematical induction.

Solving Recurrences

Focuses on solving recurrences in divide-and-conquer algorithms using various techniques and examples.

Complexity & Induction: Algorithms & Proofs

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

Recursively Defined Sets and Structures

Explores recursively defined sets, natural numbers, strings, functions, string concatenation, and well-formed formulae.

Sets and Proofs

Introduces sets in discrete mathematics and explores proof techniques like direct and indirect proofs.

Differential Forms Integration

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

Proofs and Logic: Introduction

Introduces logic, proofs, sets, functions, and algorithms in mathematics and computer science.

Merge Sort: Sorting Algorithm

Explains the merge sort algorithm, its correctness, and time complexity compared to other sorting algorithms.

Divide-and-Conquer: Merge Sort

Explores loop invariants, time analysis, and the Divide-and-Conquer approach with a focus on Merge Sort.