Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Mathematical Recursion: Induction and Recursion
Description
This lecture covers the principle of mathematical induction, where a proposition is proven true for all positive integers by showing the basis step and the inductive step. Examples demonstrate the theorem n < 2n, with the well-ordering axiom supporting the validity of mathematical induction.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.