Presents a method for solving linear equations involving the use of inverses instead of memorizing rules. (MKR)

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…

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

The game of Yahtzee is discussed in terms of the various outcomes of turns in the game and their point values and the probabilities associated with achieving specific combinations of dice values. Several tables and methods of table construction are noted, and several challenge exercises are included. (MP)

An attempt is made to show that algebra is rarely obvious, and merely expecting children to learn rules is an oversimplification. Sections cover: (1) The Non-visual Nature of Algebra; (2) The Apparently Arbitrary Nature of Algebra; (3) The Relationship Between Symbolism, System and Question; (4) The Complex Nature of Algebra; and (5) Some…

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)

Provides a short list of integral triples for the design of problems employing unit fractions (so solutions will be positive integers). Also presents an algorithm whereby both primary and imprimitive sets of triples can be easily obtained and shows how to extend the algorithm to solve three-variate unit fraction equations. (JN)

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)

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)

Discusses computer methods for finding roots of polynomials. The program provided finds rational roots and prints the roots as rational numbers. (PK)

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)

Presents an example using a computer to illustrate concepts graphically in an introductory course on differential equations. Discusses the algorithms of the computer program displaying the solutions to an equation and the inclination field of the equation. (YP)