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)

A comparison of four methods of finding the maturity value of the principal is presented. The four methods are: table, period-by-period iterative calculation, formula, and Binomial Theorem. (MP)

Growth functions involved in mathematical models for biological development are discussed using the algebra of polynomials and matrices. (SD)

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)

Several algorithms for solving initial value differential equation problems using the definitions of derivative and integral and a computer are discussed. (MN)

Use of the computer programs provided here in APL programming language can help students understand computational algorithms. (SD)

Chio's method of evaluating determinants by successive reduction of size is explained. (MN)

In a thesis written for the Doctor of Arts in Mathematics, the connection between Euclid's algorithm and continued fractions is developed and extended to n dimensions. Applications to computer sciences are noted. (SD)

Suggests a moving pictorial tool to help teach principles in the bubble sort algorithm. Develops such a tool applied to an unsorted list of numbers and describes a method to derive the run time of the algorithm. The method can be modified to run the times of various other algorithms. (JN)