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

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)

The use of flow charts in the teaching of college mathematics enhances students' understanding of mathematical processes. Used appropriately in elementary and secondary schools they could also nurture understanding of algorithms. (SD)

The theory of unary and binary operations are discussed and illustrated with examples from school mathematics. Presentations of selected inverse operations are made and attention is drawn to certain "typical" problems that occur during instruction and learning of these concepts. (MP)

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)

The discrete mathematics topics of trees and computational complexity are implemented in a simple reliability program which illustrates the process advantages of the PASCAL programing language. The discussion focuses on the impact that reliability research can provide in assessment of the risks found in complex technological ventures. (Author/JJK)

This document contains two units that examine integral transforms and series expansions. In the first module, the user is expected to learn how to use the unified method presented to obtain Laplace transforms, Fourier transforms, complex Fourier series, real Fourier series, and half-range sine series for given piecewise continuous functions. In…

A tool to aid elementary calculus students in the computation of unusual limits is reviewed. (MP)

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)

Presented is a method where a quadratic equation is solved and from its roots the eigenvalues and corresponding eigenvectors are determined immediately. Included are the proposition, the procedure, and comments. (KR)

Described is computational geometry which used concepts and results from classical geometry, topology, combinatorics, as well as standard algorithmic techniques such as sorting and searching, graph manipulations, and linear programing. Also included are special techniques and paradigms. (KR)

Applied mathematics is seen often to involve the solution of single equations or systems of equations. A particular technique for solving equations in the context of functions on the real line is examined. This technique includes an iterative process, which is viewed as an algorithm that can be implemented readily on inexpensive and widely…

Presented is a way to provide students with a review and an appreciation of the versatility of pointers in data structures by improvising with binary trees. Examples are described using the Pascal programing language. (KR)

This article, which is organized around a single, well-known algorithm for root extraction, presents a way of incorporating dynamical systems into the teaching of mathematics. Included are sample exercises using complex numbers and the computer where students have the opportunity to do some analysis on this algorithm. (KR)

Presented is a scheduling algorithm that uses all the busses at each step for any rectangular array. Included are two lemmas, proofs, a theorem, the solution, and variations on this problem. (KR)