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

A program for drawing a line segment is developed. (MNS)

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 review of the literature and annotated bibliography summarizes the available research relating to teaching programming to high school students. It is noted that, while the process of programming a computer could be broken down into five steps--problem definition, algorithm design, code writing, debugging, and documentation--current research…

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)

One college writing teacher engaged his class in the revision of a computer program to check grammar, focusing on improvement of the algorithms for identifying inappropriate uses of the passive voice. Process and problems of constructing new algorithms, effects on student writing, and other algorithm applications are discussed. (MSE)

The first aim in school might be to help children become more aware of the algorithmic processes they use; then, ensure that they can devise algorithms and define them. Many examples of how these aims can be met are given, including the use of calculators and computers. (MNS)

In one school, algorithmic development has been infused in the mathematics curriculum. An example of what occurs in mathematics classes since the teachers began using the computer is given, with two students' conjectures included as well as the algebraic justification. (MNS)

Presents an easy method for constructing magic squares from three-by-three to general squares. Provides a computer program generating odd-order magic squares. Six references are listed. (YP)

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)

P-adic or g-adic sets are sets of elements formed by linear combinations of powers of p, a prime number, or g, a counting number, where the coefficients are whole numbers less than p or g. Discusses exercises illustrating basic numerical operations for p-adic and g-adic sets. Provides BASIC computer programs to verify the solutions. (MDH)

Describes the Plane Geometry System computer software developed at the Educational Computer Systems laboratory in Sofia, Bulgaria. The system enables students to use the concept of "algorithm" to correspond to the process of "deductive proof" in the development of plane geometry. Provides an example of the software's capability…