Week 04: Euclidean Algorithm, Lame's Theorem and Fundamental theorem of Arithmetic
Rosen, K.H. (2011). Elementary number theory & its applications. (6th ed.). Boston: Addison-Wesley.
Page No. 102-120
Course Material
- Week 01: Introduction to number theory, Revision of integers and related concepts
- Week 02: The function [ x ], Divisibility, The division algorithm
- Week 03: Prime numbers, Eculid's Theorem and Greatest common divisor
- Week 04: Euclidean Algorithm, Lame's Theorem and Fundamental theorem of Arithmetic
- Week 05: Fermat's numbers and factorizing methods
- Week 06: Linear Diophantine equations and their solutions
- Week 07: Introduction to congruences and residue classes
- Week 08: Linear congruences, congruences with prime moduli and The Chinese remainder theorem
- Week 09: Polynomial congruences, system of linear congruences
- Week 10: Mid Term
- Week 11: Wilson's theorem and Fermat's little theorem
- Week 12: Euler's theorem, Euler's function and Mobious function
- Week 13: Primitive roots, primitive roots for primes
- Week 14: Universal exponents
- Week 15: Quadratic residue, Legendre symbol
- Week 16: Law of quadratic reciprocity, Jacobi symbol
- Week 17: Nonlinear Diophantine equations and Fermat's last theorem
- Week 18: Final Term Exams
- Chapters 18
- Department Mathematics
- Teacher
Dr. Iram Iqbal
