Number Theory

About this course

Divisibility, primes, GCD, Euclidean algorithm, modular arithmetic, Fermat's little theorem, RSA cryptography.

• 20 lessons
• 2 h
• intermediate

What you'll learn

• Outline the main topics covered in the course
• Explain why number theory is important in computer science and cryptography
• Define divisibility and related terms
• Prove basic divisibility properties
• State and apply the division algorithm
• Interpret quotient and remainder

Finishing the course

• 80 knowledge-check questions along the way, so you know the ideas stuck before you move on.
• Watching is free and needs no account. Sign in to save your progress. Pass each lesson's quiz (60%+) to earn the certificate. Each certificate has its own public verification link to share, marked quiz-verified.

Created by