Week
|
Topics Covered
|
Reading
|
Assignments
|
1
|
Divisibility in Z , Division algorithm , Euclidean algorithm
|
Mod I pp1-7
|
Exers in mod
|
2
|
Extended Euclidean algorithm , Prime #s and Prime #theorem , Euler phi function
|
Mod I pp 8-14
|
" "
|
3
|
Basic abstract algebra , Mod n arithmetic , Ring of integers mod n, Chinese remainder theorem
|
Mod II pp1-7
|
" "
|
4
|
Finite groups , Euler's and Fermat's theorems , Square and multiply algorithm
|
Mod II pp 8-14
|
" "
|
5
|
Finite cyclic groups , Cyclic mod n units
|
Mod III
|
" "
|
6
|
Midterm
|
|
|
7
|
Introduction to quadratic residues
|
Mod IV pp1-7
|
" "
|
8
|
Quadratic residues and the Legendre symbol, Gauss Reciprocity theorem for the Legendre symbol
|
Mod IV pp 8-15
|
" "
|
9
|
Quadratic residues and the Jacobi symbol , Gauss Reciprocity theorem for the Jacobi symbol
|
Mod IV pp 16-28
|
" "
|
10
|
Polynomial rings , Division algorithm for polynomials , Quotient rings and fields
|
Mod V
|
" "
|
11
|
Finite fields , Characteristic of a finite field , Vector spaces and finite fields
|
Mod VI pp 1-6
|
" "
|
12
|
Minimal polynomials , Uniqueness of finite fields
|
Mod VI pp 7-12
|
" "
|
13
|
" "
|
" "
|
" "
|
14
|
Mobius inversion and the existence of finite fields
|
Mod VI pp 13-20
|
" "
|