EulerFold

No video available

Please refer to the materials section for this topic.

Divisibility and the integers

Learning Objectives

  • Well-ordering principle
  • Mathematical induction and strong induction
  • Division algorithm
  • Greatest common divisor and least common multiple

Weekly Outcome

By the end of this module you will be able to prove core integer theorems, implement Euclidean algorithms, and reason rigorously in Z/nZ.