Describes eight increasingly sophisticated and efficient sorting algorithms including linear insertion, binary insertion, shellsort, bubble exchange, shakersort, quick sort, straight selection, and tree selection. Provides challenges for the reader and the student to program these efficiently. (JM)

Provides a short list of integral triples for the design of problems employing unit fractions (so solutions will be positive integers). Also presents an algorithm whereby both primary and imprimitive sets of triples can be easily obtained and shows how to extend the algorithm to solve three-variate unit fraction equations. (JN)

P-adic or g-adic sets are sets of elements formed by linear combinations of powers of p, a prime number, or g, a counting number, where the coefficients are whole numbers less than p or g. Discusses exercises illustrating basic numerical operations for p-adic and g-adic sets. Provides BASIC computer programs to verify the solutions. (MDH)

Described is a study that used LOGO to improve the proportional reasoning ability of students enrolled in mathematics classes for students poorly prepared for college-level mathematics. Included are the methodology, procedures for using logo, and a discussion of the results. (KR)