Elementary Number Theory
From this page you can access a collection of materials dealing with some important areas of Elementary Number Theory. For Maynooth University students, this material is typically covered in parts of Elementary Number Theory (MT311s). These resources are not a replacement for the material covered in your lectures and assignments, rather you should use them as extra support to aid your understanding of any material you may have difficulties with.
Miscellaneous and General Materials
- Notes on Number Theory (MIT)
- Video on the Divisibility Properties of Integers (MathDoctorBob)
- Notes on Introduction to Elementary Number Theory - Primes & Composite Numbers, Finding Primes, Factorization, Extended Euclidean Algorithm (Albert Y. C. Lai)
- Videos on Elementary Number Theory - Wilson's Theorem, Example of Euclidean Algorithm, Fermat's Little Theorem, Diophantine Equations, Prime Number Theorem (Socratica Studios)
- Videos on Elementary Number Theory - Divisibiliy, LCM, GCD, Euclidean Algorithm, Diophantine Equations, Primes, Euler's Phi Function (Bill Shillito)
- Videos on Prime Numbers, Divisibility, LCM, Linear Combinations & GCD, Relatively Prime Numbers, Euler's Phi Function (Jones Math Ed)
- Video on Modulo, Legendre Symbol (scalenescott)
- Extensive Notes & Examples on a range of topics in Number Theory (Millersville University)
- Extensive Notes & Examples on a range of topics in Number Theory (Art of Problem Solving)
- Video on Infinitely Many Primes (Numberphile)
- Video on The Fundamental Theorem of Arithmetic (Khan Academy)
- Video on Proof by Induction (Example 1 of 3) (Patrick JMT)
Euclidean Algorithm, Linear Diophantine Equations, Modular Arithmetic and Linear Congruences etc.
The Chinese Remainder Theorem