The calculator is used to solve certain formidable equations, which arise naturally and which may be difficult or impossible to solve by standard methods, by a method of successive approximations. (MP)

Presents new least-squares algorithms that update a fit after each point is entered so trends can be detected promptly as an experiment proceeds. (MLH)

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

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

Discusses a numerical technique called the method of adjoints, turning a linear two-point boundary value problem into an initial value problem. Described are steps for using the method in linear or nonlinear systems. Applies the technique to solve a simple pendulum problem. Lists 15 references. (YP)

Studies the relationship between Eulerian and Lagrangian coordinate systems with the help of computer plots of variables such as density and particle displacement. Gives examples which illustrate the differences in the shape of a traveling wave as seen by observers in the two systems. (Author/GA)

The development of a simple computer algorithm designed for use by the individual educator or researcher in maintaining and searching reprint files is reported. Called BIBLIO, the system is inexpensive and easy to operate and maintain without sacrificing flexibility and utility. (LBH)

Presents the historical development of perceptions and applications of the exponential law, tracing it from its ancient origins until the year 1900. Shows that many concepts such as mean life and half life and their relationships to differential equations were known long before their application to nuclear radioactivity. (GA)

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)

This article develops an algorithm to find all solutions to the problem, making all sums of a hexagram's nine lines the same. It shows how to exploit the geometric structure of the hexagram and its group of automorphisms. (YP)

Discusses how to express an n factorial as a product of powers of primes. Provides two examples and answers. Presents four related suggestions. (YP)

Shows a series of Euclidean equations using the Euclidean algorithm to get the greatest common divisor of two integers. Describes the use of the equations to generate a series of circles. Discusses computer generation of Euclidean circles and provides a BASIC program. (YP)

This report explains the mathematical origin of the Annual Percentage Rate (APR) approximation often used in elementary Business Mathematics courses. (MP)

The rule of 78 is used by banks and loan companies to compute the amounts due when installment loans are paid early. Describes an unexpected case of negative amortization when the rule is applied. Presents an actual problem and discusses the case. (YP)

The Fibonacci Sequence describes a vast array of phenomena from nature. Computer scientists have discovered and used many algorithms which can be classified as applications of Fibonacci's sequence. In this article, several of these applications are considered. (PK)