Elementary Number Theory I
Math 365 - Fall 2014

---

Exams

Midterm 1 - November 3, Monday (%30)

Midterm 2 - December 8, Monday (%30)

Final - January 5, Monday (%40)

---

Textbook

David M. Burton - Elementary Number Theory (Available in Reserve)

---

Tentative Course Outline

The Division Algorithm, The Greatest Common Divisor.

The Euclidean Algorithm, The Diophantine Equation ax+by=c.

The Fundamental Theorem of Arithmetic, Primes and Their Distribution.

Basic Properties of Congruences, Special Divisibility Tests.

Linear Congruences, Chinese Remainder Theorem.

Fermat's and Wilson's Theorems.

Number-Theoretic Functions tau and sigma.

The Mobius Inversion Formula

The Greatest Integer Function

Euler's phi-Function, Euler's Theorem.

Properties of phi-Function, An Application to Cryptography

Primitive Roots.

The Quadratic Reciprocity Law.

---

Course Policy

Attendance will be taken and if your attendance is less than %60, you will not be able to take the final exam and you will get NA grade.

If you do not collect 20 points (out of 200) in the midterms, then you will not be able to take the final exam and receive NA.

Only one make-up examination will be offered. The excuse for not attending an examination must be proved with documents. The make-up examination will take place shortly after the final exam.