The Miller-Rabin test is a useful probabilistic method for finding large primes. In this paper, we explain the method in detail and give three variations on this test. These variations were originally developed as student projects to supplement a course in error correcting codes and cryptography.

The evolution of Archimedes' method is traced from its geometrical beginning as a means to approximate pi to its modern version as an analytical technique for evaluating inverse circular and hyperbolic functions. It is felt the web of old and new algorithms provides considerable instructional material, and ideas are offered. (MP)

Suggests a moving pictorial tool to help teach principles in the bubble sort algorithm. Develops such a tool applied to an unsorted list of numbers and describes a method to derive the run time of the algorithm. The method can be modified to run the times of various other algorithms. (JN)

Discusses how to express an n factorial as a product of powers of primes. Provides two examples and answers. Presents four related suggestions. (YP)