Course

Elementary number theory

Study the integers in depth: Bézout, congruences and the Chinese remainder theorem, Fermat and Euler, primitive roots, quadratic reciprocity, arithmetic functions, continued fractions and RSA. It is the basis of modern cryptography; Discrete mathematics is recommended first.

Recommended before this course: Discrete mathematics (4 concepts come from that course and are tagged)

37concepts
6topics
370exercises
≈ 19 hof study approx.

Start course →⏱ Exam simulator

Course path

  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6

Sources

  • Kenneth H. Rosen, Discrete Mathematics and Its Applications, 8th edition, McGraw-Hill, 2019.
  • Ralph P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction, 5th edition, Pearson, 2003.
  • Susanna S. Epp, Discrete Mathematics with Applications, 5th edition, Cengage, 2019.
  • László Lovász, József Pelikán, Katalin Vesztergombi, Discrete Mathematics: Elementary and Beyond, 1st edition, Springer, 2003.
  • David M. Burton, Elementary Number Theory, 7th edition, McGraw-Hill, 2011.
  • Ivan Niven, Herbert S. Zuckerman, Hugh L. Montgomery, An Introduction to the Theory of Numbers, 5th edition, Wiley, 1991.