Number Theory Full Course - A to Z
Offered By: Academic Lesson via YouTube
Course Description
Overview
Syllabus
) Introduction to number theory.
) The principle of mathematical induction.
) Basic representation theorem.
) The division algorithm.
) The divisibility.
) The euclidean algorithm.
) Linear Diophantine Equations.
) The fundamental theorem of arithemetic.
) Permutations and combinations.
) Fermat's Little theorem.
) Wilson's Theorem.
) Computer Programming.
) Basic properties of congruences.
) Residue Systems.
) Linear Congruences.
) Fermat's little theorem and wilson's theorem .
) The Chinese remainder theorem.
) The Eular Phi Function Part 1.
) The Eular Phi Function Part 2.
) Multiplicative function.
) The mobious inversion formula .
) Order of Elements.
) Primitive roots modolo.
) The prime counting function.
) The Eular's criterion.
) The Legendre symbol.
) Quadratic Reciprocity part 1.
) Quadratic Reciprocity part 2.
) Application of quadratic reciprocity .
) Consicutive Residues.
) Consicutive triples of Residues part 1.
) Consicutive triples of Residues part 2.
) Sums of two squares.
) Sums of four squares.
) Gauss circle problem.
) Dirichlet's devisor problem.
) Infinity Conclusion.
Taught by
Academic Lesson
Related Courses
Introduction to Mathematical ThinkingStanford University via Coursera Effective Thinking Through Mathematics
The University of Texas at Austin via edX Cryptography
University of Maryland, College Park via Coursera Математика для всех
Moscow Institute of Physics and Technology via Coursera Number Theory and Cryptography
University of California, San Diego via Coursera