Worksheet ab_de_pe.mws. Here my aim was to introduce Maple's Number Theory package, to introduce the terms abundant, deficient and perfect numbers... The material was developed in a single class, as above. A much fuller version - with explanatory test etc, and using procedures - but with Maple output removed, is my abun_etc.mws. An interested reader - one wishing to read about how Euclid's theorem on perfect numbers connects with the modern problem of finding record size Mersenne primes - should consult the October 1996 lecture I gave on this; it is in the Public and Other Lectures corner of my site.

Worksheet igcd_int.mws. Here my aim was to introduce the greatest common divisor (factor) of two integers, to alert that Maple does not find the gcd by factoring (which is hard to do, ... the relevance to public-key cryptography of the difficulty of the factoring problem...). Here are some fully developed, related worksheets:

gcd.mws (a fairly complete exposition - without proof - of the Euclidean algorithm). gcd_pict.mws (some graphics - nice crossword type figures - involving gcds. Anyone who knows their Number Theory, and who invested the right amount of effort, could use this as an aid to studying the beautiful result that the probability of two random integers having gcd 1 is ...). i_l_comb.mws (integer linear combinations: the extended Euclidean algorithm). a=bq+r.mws (a gcd worksheet). see_gcd_steps.mws (another gcd worksheet).

Fundamental property of primes (18KB).

(Towards) Sierpinski numbers.

Worksheet proc1.mws. Here I introduced the writing of Maple procedures (some of the above worksheets already employ procedures). The point that I try to emphasise is that procedures are like functions. I show how to access Maple's internal code for various commands (interface(verboseproc=2), etc), point out that Maple doesn't allow access to all its code (e.g., it doesn't allow access to igcd...)

pseudoprimes.mws. Here I introduce - with motivation relating to Fermat's 'little' theorem - the important notion of a pseudoprime, and consider increasing layers of improvement (without getting to a top layer, as it were) of procedures for finding examples.