Proposes to modify the procedure proposed by Abelson and diSessa to produce a polygonal path with vertices that lie exactly on an ellipse. Provides a detailed proof. Implements a limiting process to produce the best possible approximation to any ellipse for any given screen resolution. (CW)

Provides an introduction to the mathematics and art of the complex plane. Includes two computer programs written in GW BASIC to facilitate a reader's initial investigation. Identifies additional software resources. Stresses the appeal to future scientists, mathematicians, and artists. (CW)

Illustrates the exploration of random and chance events with a microcomputer. Demonstrates this principle using turtle graphics, coin flips, and die rolls in a student exercise involving distance and direction on a number line. Includes the necessary LOGO programming statements to use this method. (CW)