The Euclidean algorithm for finding the greatest common divisor is presented. (MNS)

Describes the development of a method of generating problems that are easy to present in classroom settings because all the important points to be graphed are single-digit integers. Uses an algorithm that generates intersection problems that fit the criteria. A proof of the algorithm is included. (DDR)

The author presents two examples of lattice multiplication followed by a computer algorithm to perform this multiplication. The algorithm is given in psuedocode but could easily be given in Pascal. (PK)

Presented are the mathematical explanation of the algorithm for representing rational numbers in base two, paper-and-pencil methods for producing the representation, some patterns in these representations, and pseudocode for computer programs to explore these patterns. (MNS)

Presents several types of functions which fit a given set of data and create opportunities for classroom discussion comparing different kinds of functions and identifying some of the potential hazards associated with extrapolation from best-fit functions. (DDR)