Course Information

Syllabus

Homework Assignments

FAQ

Quotes

Quiz Solutions

Final Exam Info

MATH 25 - FALL 1998
TENTATIVE SYLLABUS

This is a tentative syllabus for the entire term. I reserve the right to change this syllabus at any time and without warning. For a more current version of the happenings in class see the weekly homework assignments page.

Date Section Topics
9/25 -- Introduction
9/28 1.1 Properties of the integers
1.2 Summations and products
9/30 1.3 Mathematical induction
10/2 1.4 Binomial coefficients and the binomial theorem
1.5 Divisibility and the division algorithm
10/5 1.6 Representations of integers
10/7 1.7 Computer operations
1.8 Complexity of operations
10/9 -- No Class
10/12 1.8 Complexity of operations
1.9 Prime numbers
10/14 -- The Prime Number Theorem
2.1 Greatest common divisors
10/16 2.2 The Euclidean Algorithm
10/19 2.3 The Fundamental Theorem of Arithmetic
10/21 2.4 Fermat numbers and factorization methods
10/23 2.5 Linear Diophantine equations
10/26 3.1 Intoduction to congruences
10/28 3.2 Linear congruences
10/30* 3.3 The Chinese Remainder Theorem
11/2 4.1 Divisibility tests
11/4 4.2 Perpetual calendar
4.3 Round-robin tournaments
11/6 5.1 Wilson's Theorem and Fermat's Little Theorem
11/9 5.2 Pseudoprimes
11/11 5.3 Euler's Theorem
11/13 6.1 Euler's phi-function
11/16 6.2 More arithmetic functions
6.3 Perfect numbers
11/18 6.3 Mersenne primes
7.1 Character ciphers
11/20 7.1 More character ciphers
7.3 Exponentiation ciphers
11/23 7.3 More exponentiation chiphers
7.4 Public-key cryptography
11/25 -- No Class
11/30 -- Catch up and welcome back
12/2 -- Review


*NOTE: Special time 8:00 a.m. (ugh!)

back to top