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)

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)

The Euclidean algorithm for finding the greatest common divisor is presented. (MNS)

Results of this study indicated calculator algorithms can serve as an effective alternative instructional strategy where computational skill is an instructional goal. (MP)

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

A conceptually elementary and geometrically based algorithm is presented to indicate how trigonometric functions can be calculated without using calculus. (MN)

One difficulty that mathematically naive subjects encounter in solving arithmetic word problems involves the limitation on short term memory (STM) capacity. It is hypothesized that naive subjects, not having access to formal problem solving strategies, may find visualization useful in reducing strain on STM. Two experiments are reported. The…

Demonstrates how spreadsheets can be used to implement linear system solving algorithms in college mathematics classes. Lotus 1-2-3 is described, a linear system of equations is illustrated using spreadsheets, and the interplay between applications, computations, and theory is discussed. (four references) (LRW)

When problems defy solution, mathematicians can settle for "almost." This branch of mathematics (called computational complexity) encompasses both the number of parts involved in a problem and the intricacy of their interrelatedness. Current research in this area is discussed, considering various computer applications involved. (JN)

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)

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)

Describes Newton's method to locate roots of an equation using the Newton-Raphson iteration formula. Develops an adaptive method overcoming limitations of the iteration method. Provides the algorithm and computer program of the adaptive Newton-Raphson method. (YP)

Computing pi efficiently has been of great interest to mathematicians for centuries. This article presents an algorithm to solve this problem through skillful computer use. (PK)