Proof by Smallest Counterexample

preview_player
Показать описание
In this video, we introduce the method of Proof by Smallest Counterexample, which comes from the Well-Ordering Principle. We use this to show that the Well-Ordering and Induction Principles are logically equivalent. We use this to prove the Fundamental Theorem of Arithmetic.

Рекомендации по теме