Provides an algorithm for determining the median and quartiles of discrete data sets. Describes the graphical equivalent of the numerical method. (JM)

Described are ways that errors of magnitude can be unwittingly caused when using various supercalculator algorithms to solve linear systems of equations that are represented by nearly singular matrices. Precautionary measures for the unwary student are included. (JJK)

Shows that the rules of thumb for propagating significant figures through arithmetic calculations frequently yield misleading results. Also describes two procedures for performing this propagation more reliably than the rules of thumb. However, both require considerably more calculational effort than do the rules. (JN)

Provides several algorithms that use extended precision methods to compute large factorials exactly. The programs are written in BASIC and PASCAL. The approach used for computing N considers how large N is, how the built-in limitation on exact integer representation can be bypassed, and how long it takes to compute N. (JN)

Presents an example of mathematics from an algorithmic point of view, with emphasis on the design and verification of this algorithm. The program involves finding roots for algebraic equations using the half-interval search algorithm. The program listing is included. (JN)

Two mathematical topics are interpreted from the viewpoints of traditional (performing algorithms) and contemporary (creating algorithms and thinking in terms of them for solving problems and developing theory) algorithmic mathematics. The two topics are Horner's method for evaluating polynomials and Gauss's method for solving systems of linear…

Discusses the use of manipulative materials to model operations and algorithms. Indicates that they clarify the several interpretations of each operation, establish a basis for correct mathematical language, and show why algorithms work. (JN)

A history of perfect numbers is presented, which briefly covers the 27 values known at this time. (MP)

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)

Suggestions for teaching the concept of division by zero are given. (MK)

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

Problems with apportioning seats within the House of Representatives every 10 years are discussed. The history of the problem and the nature of the politics involved are reviewed, and the current method in use is detailed along with its flaws. A call for a more sensible system is made. (MP)

Three short essays provide teaching suggestions for lessons on base two, order of operations, and ratios used to motivate a number of mathematical ideas. (MK)

Develops a division algorithm in terms of familiar manipulations of concrete objects and presents it with a series of questions for diagnosis of students' understanding of the algorithm in terms of the concrete model utilized. Also offers general guidelines for using concrete illustrations to explain algorithms and other mathematical principles.…

Reports on the findings of the Algorithms working group at the Ware, England, conference. Examines methods of introducing the algorithmic approach to mathematics via computer programing and using problems arising from content areas. Considers programing language and presents support for programming in mathematics curricula. (JM)