Outline People Reading Grading Academics Homepage

MA 410 '07 Syllabus

Course Outline*

Lecture Topic(s) Notes Book(s)
1. Jan 10 Introduction; Fibonacci
FINT §37
Mon, Jan 15 M. L. King holiday
2. Jan 17 Mathematical induction; the binomial theorem

FINT §36
3. Jan 22 Inductive definition of addition, multiplication, exponentiation; divisibility and division with remainder
Class notes; FINT §5
4. Jan 24 Euclid's algorithm

FINT §5
5. Jan 29 Extended Euclidean algorithm; diophantine linear equations
FINT §6; class notes
6. Jan 31 Continued fractions; Euclid's lemma (Claim 7.1)
FINT §7
7. Feb 5 Fundamental theorem of arithmetic

FINT §7
8. Feb 7
Theorems on primes: Euclid, Chebyshev, Dirichlet, Hadamard/de la Vallee Poussin, Green-Tao
Conjectures on primes: Goldbach, twin, Mersenne, Fermat
sequences of equidistant primes; Barkley Rosser, Lowell Schoenfeld. Approximate formulas of some functions of prime numbers. Illinois J. Math. vol. 6, pp. 64--94 (1962).
list of Mersenne primes, factors of Fermat numbers
FINT §12-15
9. Feb 12 Catch-up; review for first exam

10. Feb 14 First ``St. Valentine's Day'' Exam Counts 17.5%
11. Feb 19 Return of first exam; equivalence relations, congruence relations

Class notes
12. Feb 21 Congruences
FINT §8
Wed, Feb 21, 5pm Last day to drop the course
13. Feb 26 Congruences continued


14. Feb 28 The Chinese remainder theorem

FINT §11
Mar 5-9, 2007 Spring Break, no class
15. Mar 12 The little Fermat theorem; pseudoprimes; Fermat primality test;
Carmichael numbers
FINT §9, §16
16. Mar 14 Carmichael numbers; Miller-Rabin test

FINT §19
17. Mar 19 Euler's phi function; sums of divisors

FINT §20
18. Mar 21 Public key cryptography; the RSA

FINT §17, §18
19. Mar 26 Catch-up; review for exam

20. Mar 28 Second exam Counts 17.5%
21. Apr 2 Return of second exam; primitive roots

FINT §21
22. Apr 4 Index calculus: order of an integer modulo n and existence of primitive roots modulo p

FINT §22
23. Apr 9 Diffie-Hellman key exchange; el-Gamal public key crypto system; digital signatures
Class notes
FINT §22
24. Apr 11 Quadratic residuosity

FINT §23
25. Apr 16 The quadratic reciprocity law

FINT §24, §25
26. Apr 18 Pythagorean triples

FINT §3
27. Apr 23 Fermat's last theorem for n=4

FINT §28
28. Apr 25 Catch-up; final exam review; teaching evaluation


Wed, May 2, 9am-11am, Harrelson 272: Final exam (counts 25%)
* This is a projected list and subject to amendment.

Instruction Personnel

For instructor, office hours, telephone numbers, email and physical address see the homepages of Erich Kaltofen.

Textbook and Online Notes

We will use the books: I will cover some topics that are not in the book, and will use Shoup's book can be downloaded in pdf format for free. I had considered only using Shoup's book and am interested what you think about that idea. In any case, the syllabus above refers to chapters in these books. For topics in neither book, handouts will be provided.

On-line information: All information on courses that I teach (except individual grades) is now accessible via html browsers, which includes this syllabus. My web page listing all my courses' is at

You can also find information on courses that I have taught in the past, and examinations that I have given.

Grading and General Information

Grading will be done with plus/minus refinement.

There will be four homework assignments of approximately equal weight, two mid-semester examinations during the semester, and final examination. Depending on time constraints, I may only grade a selection of homework problems.

I will check who attends class. You will forfeit 10% of your grade if you miss 3 or more classes without a valid justification. I you miss a class because you are sick, etc., please let me know. I may require you to document your reason.

If you need assistance in any way, please let me know (see also the University's policy).

Academic Standards

Examinations:The three examinations will be closed book and closed class notes. However, you will be able to bring note sheets of paper with pertinent information to the examinations (1 for first exam and 2 for second exam and 3 for the final exam).

Collaboration on homeworks: I expect every student to be his/her own writer. Therefore the only thing you can discuss with anyone is how you might go about solving a particular problem. You may use freely information that you retrieve from public (electronic) libraries or texts, but you must properly reference your source.

Late submissions: All programs must be submitted on time. The following penalties are given for (unexcused) late submissions:

Alleged cheating incidents: I will not decide any penalty myself, but refer all such cases to the proper judiciary procedures.

©2007 Erich Kaltofen. Permission to use provided that copyright notice is not removed.