This is a series of short notes, which goes from
"Elementary Number Theory" to "Congruences modulo higher powers
of primes," threaded by a theme of properties of binomial
coefficients.
This starts with the "Origins of Algebra" (1650 bc) through
"Recent Developments" (application to program correctness). The
historical facts provide interesting vantages for students, especially
those in the lower division interested in computing. The page
contains related links for further investigation.
This has very basic exercises, such as adding vectors or
matrices, which the student can do for practice.
Student answers are checked, giving feedback.
This has postscript materials, with some interesting flair.
One note is "Everything You'll Ever Need to Know about Determinants,"
designed to give geometric intuition. Besides the usual topics, this
has interesting applications, such "Introduction to Markov Chains."
Problems sets and exams are included.
This is a sequence of four short lessons on perfect numbers and
Mersenne primes. It begins with Euclid's method and ends with the
largest known Mersenne prime.
The Prime Page, by Chris Caldwell at University of Tennessee at Martin.
This could be a fun place to send students into number theory.
The Largest Known Primes has fascinating materials, including
the latest (1997) largest prime (by G. Spence and G. Woltman):
22976221 - 1.
The Finding Primes and Proving Primality page includes
"Quick Tests" that would be among introductory materials.
This is a book, accessible with just html (+ graphics), which
introduces fundamental iterative methods, notably Jacobi, Gauss-Seidel,
[Bi]Conjugate gradient, and Chebyshev. The chapters include
notes on preconditioning, decomposition, and other related subjects.
They describe how to obtain the NetLib software system, BLAS, for
operating on vectors and matrices. Their glossary provides a
convenient way for students to look up terms.