Lesson 13 of 16 · about 15 min
Strong induction
Sometimes the next domino is knocked over by one several steps back, not the one just before it. Strong induction lets you assume every smaller case at once. You'll prove that stamps can make any big enough amount, that every number splits into primes, and write both proofs as recursive code.
🔓 Unlock this lesson
This lesson is part of the DoingCamp Pass. Members get every lesson in every course, with all the interactive visuals, coding exercises and challenges.
In this lesson you'll learn:
- Strong induction
- Well-ordering principle
Free to try in F05 Logic & Proofs:
The first 3 lessons of every course are free, no account needed.