There are many uses for the shortest path algorithm presented which are limited only by our ability to recognize when a problem may be converted into the shortest path in a graph representation. (Author/TG)

Four different types of problems from graph theory are presented and discussed. (MK)

The following ideas are shared: (1) a low-stress subtraction algorithm that eliminates the traditional borrowing process, and (2) an approach to graphing circular functions that looks at the process of modifying simple functions as a series of shifting, sliding, and stretching adjustments, with its biggest advantage viewed as its generality. (MP)

This reprint of a Project Solo curriculum module discusses graphing by computer, gives an example of a BASIC program used to graph a second degree polynomial, and provides suggested exercises in programing. (MK)

This paper outlines the development of an activity that uses the computer's unique capabilities to provide students with a meaningful and highly motivating experience with the graphing of equations. The basic design of the game calls for the computer to display a coordinate grid on which it graphs any equations that are typed in by the student.…

The formula used by the telephone company to determine long distance charges is presented and several sample problems are included. (MP)

Presents a scenario in which two people solve a programming problem by discussing various number sequences and functions. The problem is redefined as one related to number theory and operations research. (DDR)

The objective of this presentation is to focus on the use of a hand-held graphics calculator. The specific machine referred to in this monograph is the Casio fx-7000G, chosen because of its low cost, its large viewing screen, its versatility, and its simple operation. Sections include: (1) "Basic Operations with the Casio fx-7000G"; (2) "Graphical…