How would you prove that a theorem or a formula is true for *all* natural numbers? Try it for n=0, n=1, n=2, etc? It seems to be a lot of work, or even completely impossible, as there are infinitely many natural numbers!

Don't worry, there is a solution to this problem. This solution is called "proof by induction" and this is the subject of this short (and free) course. The Induction Principle is often compared to the "domino effect", which will be illustrated in the course. (This is also the reason for our course image.)

In this course you will learn how induction proofs work, when to apply them (and when not), and how to conduct them. You will get an illustration of this method on a variety of examples: some formulas, some inequalities, some statements about divisibility of natural numbers. You will also get some information about other courses where you can see some theory, and more advanced proofs based on the same principle.

Sadly, there is no possibility of asking question in free courses, but you can ask me questions about this subject via the QA function in my other course:"Precalculus 1: Basis notions", where the topic of proofs by induction is covered, both theoretically (Peano's axioms) and practically, with several examples.