Provides a BASIC program to compute the number of shuffles required for packs containing even numbers of cards up to 100. Lists 4 further questions on the shuffling program. (YP)

Gives a general description of reformed calculus efforts and describes experiences with two reformed calculus programs together with traditional calculus. Also provides comparisons between these three programs using teaching evaluations and student journals. (Author/MKR)

Discusses the use of computer graphics in the teaching of geometry. Describes five types of geometry: Euclidean geometry, transformation geometry, coordinate geometry, three-dimensional geometry, and geometry of convex sets. (YP)

Investigates using computer spreadsheets in math classes. Describes current spreadsheets on the market. Summarizes how the spreadsheets work and provides information to build a template to find function maximums and minimums. Lists step by step instructions. (MVL)

Described are several programs that enable the user to evaluate derivatives to order n of any elementary function by using the combination of automatic differentiation method and A Programming Language (APL). Programs calculating first- and higher-order derivatives are presented. Selected APL symbols are appended. (YP)

Presents an example of a proof to the mathematical problem of the sum of the cubes of the digits. Provides a Pascal program to search for these results. (MVL)

Discusses the use of the mathematics classroom for discovering the relationship among computers, mathematics, and real-world problems. Provides three probability problems and compares the results of three methods, actual trial, computer simulation, and mathematical solution. (YP)

Describes a five-dice game, horse. Discusses the offensive player's strategy using the ideas of probability, such as counting outcomes, mutually exclusive events, conditional probabilities, zero sum games, and the use of computer. (YP)

Describes a process of mathematical investigation involving generalized Fibonacci sequences. Provides the derivation using expressions, BASIC programs, and numerical verification. (YP)

Uses muMATH to illustrate the step-by-step process in translating mathematical theory into the symbolic manipulation setting. Shows an application of a Picard iteration which uses a computer to generate a sequence of functions which converge to a solution. (MVL)

Investigates minimizing errors in computational methods commonly used in chemistry. Provides a series of examples illustrating the propagation of errors, finite difference methods, and nonlinear regression analysis. Includes illustrations to explain these concepts. (MVL)

Gives definitions of taxicab geometry and the MacDraw format for graphing. In the world of taxicab geometry, movement through the plane is along horizontal and vertical paths. Describes specific application to conic sections, including circle, ellipse, parabola, and hyperbola. Lists five references. (YP)

Presents several examples of the iteration method using computer spreadsheets. Examples included are simple iterative sequences and the solution of equations using the Newton-Raphson formula, linear interpolation, and interval bisection. (YP)

Shows step-by-step use of spreadsheets with an example from linear programing using the Simplex method. Describes pivot choosing and partial Gauss-Jordan elimination procedures. (YP)

Provides a short BASIC program, RANVAR, which generates random variates for various theoretical probability distributions. The seven variates include: uniform, exponential, normal, binomial, Poisson, Pascal, and triangular. (MVL)