MTH 609
Number Theory
Division Algorithm, The greatest common divisor, Euclidean Algorithm and Diophantine Equations; Prime numbers and Fundamental Theorem of arithmetic; The theory of congruences; Linear congruences and The Chinese Remainder Theorem; Special congruences: Fermat's little theorem, Wilson's theorem; Euler's Phi-function and Euler's generalization of Fermat's little theorem; Applications: RSA cryptosystem; Legendre's symbol and its properties; Euler's criterion; Quadratic reciprocity law; Some nonlinear Diophantine equations; Representation of integers as sums of squares.
MTH 609 Requisite Information:
MTH 609 Let's You Take:
Prerequisite: (MTH 108 or MTH 141) and (MTH 210 or CPS 420)
- This course is not a prerequisite for any other courses.
Prerequisite: (MTH 108 or MTH 141) and (MTH 210 or CPS 420)
Tell us about MTH 609.
MTH 609 Reviews (0)
Bird
Total Statistics
-
-
-
Recommend
Total Statistics
-
-
-
Useful
Total Statistics
-
-
-