Analysis of (n=92) university students' construction of visual representations (Venn diagrams) of eight set expressions found competent and error-prone students constructed and used procedures to complete set translation tasks, and two-thirds of observed errors arose from consistent implementation of ill-formed procedures. (Author/MKR)

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)

Provides four examples for testing the validity of logical arguments by using the method of truth trees. (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)

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)

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)

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)

The objectives of this research were to review existing computer-assisted instruction systems for propositional calculus proofs or elementary logic and to develop an instructional computer program that guides students in the valid construction of propositional calculus proofs. The system is unique in that it provides assistance at each step of the…

This monograph is aimed at helping the reader understand the built-in logic of various calculator operating systems. It is an outgrowth of workshop contacts with in-service and pre-service teachers of mathematics and is in response to their request for a book on the subject of calculator logic systems and calculator algorithms. The mathematical…