------------------------------------------------------------------------------
Math 356, Spring 2015, Syllabus
------------------------------------------------------------------------------
01  Tue 1/20   1.1-1.2   Numbers and Sequences, Sums and Products
02  Fri 1/23   1.3-1.5   Induction, Fibonacci Numbers, Divisibility

03  Tue 1/27   3.1-3.2   The Distribution of Primes
04  Fri 1/30   3.3       Greatest Common Divisors
05  Tue 2/3    3.4       The Euclidean Algorithm
06  Fri 2/6    3.5       The Fundamental Theorem of Arithmetic
07  Tue 2/10   3.7       Linear Diophantine Equations

08  Fri 2/13   4.1-4.2   Congruences
09  Tue 2/17   4.3       Chinese Remainder Theorem
10  Fri 2/20   4.4-4.5   Polynomial Congruences, Systems of Linear Congruences
11  Tue 2/24   4.6       Factoring Numbers (Pollard Rho Method)

12  Fri 2/27   Review
13  Tue 3/3    Midterm 1

14  Fri 3/6    6.1       Fermat's Little Theorem
15  Tue 3/10   6.2       Pseudoprimes
16  Fri 3/13   6.3       Euler's Theorem

17  Tue 3/24   7.1-7.2   Euler's Phi-Function, Sum and Number of Divisors
18  Fri 3/27   7.3       Perfect Numbers
19  Tue 3/31   7.4       Mobius Inversion

20  Fri 4/3    9.1-9.2   Order of Integers, Primitive Roots for Primes
21  Tue 4/7    9.3-9.4   Existence of Primitive Roots, Index Arithmetic
                         (The proof of Theorem 6.10 was not covered.)

22  Fri 4/10   Review
23  Tue 4/14   Midterm 2

24  Fri 4/17   11.1      Quadratic Residues
25  Tue 4/21   11.2-11.3 The Law of Quadratic Reciprocity
                         (The proof of this law was not covered.)

26  Fri 4/24   13.1      Pythagorean Triples
28  Fri 5/1    8.4+10.2  Encryption and Decryption with RSA and ElGamal.

The homework and midterm problems are part of the syllabus as well.

Final Exam:  Thursday May 7, 12:00-3:00 PM
------------------------------------------------------------------------------