Presents a technique for the numerical inversion of Laplace Transforms and several examples employing this technique. Limitations of the method in terms of available computer word length and the effects of these limitations on approximate inverse functions are also discussed. (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)

Presents a theorem and its converse to generate all of the primitive Pythagorean quadruples. Provides a BASIC program generating them. (YP)

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)

Presents two methods for replacing a series by one converging more rapidly: regrouping the terms of a series and manipulations of power series. Describes a general algorithm for approximating the natural logarithm of any number. (YP)

The "word problem" is stated for a given collection. Facts regarding Dehn's Algorithm, definition of Thue systems, a rewriting system, lemmas and corollaries are provided. The situation is examined where the monoid presented by a finite Thue system is a group. (DC)

Possible ways of mechanization for counting using a binary system are discussed. Shows a binary representation of the numbers and geometric models having eight triples of lamps. Provides three problem sets. (YP)

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.…

Provides four examples for testing the validity of logical arguments by using the method of truth trees. (YP)

Outlines various subtraction methods, such as the decomposition method, equal-addends method, and low-stress algorithm. Describes a subtraction method by addition of complements. Discusses the advantages and disadvantages of the method. (YP)

Explains an algorithm which details procedures for solving a broad class of genetics problems common to pre-college biology. Several flow charts (developed from the algorithm) are given with sample questions and suggestions for student use. Conclusions are based on the authors' research (which includes student interviews and textbook analyses).…

Presents algorithms for the simulation and motion display of the three basic kinematic devices: (1) four bar linkages; (2) the slider crank; and (3) the inverted slider crank mechanisms. The algorithms were implemented on a Commodore-VIC 20 microcomputer system with 6500 bytes of available memory. (Author/JN)