basic topics are: gcd's, uniqueness of prime factorization of integers, modular arithmetic and fermats little theorem, modular tests for solvability of equations, fermats theorem on sums of two squares, existence of infinitey many primes, refined versions of that result mod various bases.
slightly more advanced topics include gauss's theory of quadratic reciprocity
for studying sqaures in modular arithmetic.actually this reminds me that one of the first texts on elementary number theory was one of the books of euclid, which is available free online.the first result is that given two integers, the smallest number that is alinear combination of the two of them equals the largest number that divides both of them evenly.
in euclids language divides is "measures", which makes it clear why the result is true. i.e. notice that the set of all linear combinations of two numbers is a set of equally spaced points on the line, since the difference of any two such numbers is another.
hence the smallest one of these meaures all of them. this is called the gcd.
heres a free link for euclid, see books 7-9 especially:
http://aleph0.clarku.edu/~djoyce/java/elements/toc.html