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)

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

Describes examples of rational representation as a guide for translating terminology and information encountered in manuals for computers. Discusses four limitations of the representation. (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)

Raises and responds to questions about what and how to teach mathematics with the availability of calculators to all students. Discusses whether students need basic facts, mechanical skills, and knowledge of computational algorithms. Argues that students need to develop number sense and analytical skills using simple, symbolic, and graphing…

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 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)

Investigates children's behaviors and conceptual achievements in the transition from informal calculation strategies to a written division algorithm. Describes five different strategies observed in the solution of division problems. Discusses the implications of the children's behavior. (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)

Algorithmic and investigative approaches to mathematics are compared and discussed. Their mutually contradictory spirit is explored. Examples of the application of each method to a mathematics problem are presented. (CW)

Prior studies indicate that, given time to develop their own algorithms, primary students will process multidigit addition or subtraction problems from left to right. Gives evidence to support that idea, describes methods of getting students to invent their own algorithms, and discusses advantages of child-invented procedures. (21 references) (MDH)

Presents a study that analyzed errors made by randomly chosen fourth grade students (25 of 57) while using the division algorithm and investigated the effect of remediation on identified systematic errors. Results affirm that error pattern diagnosis and directed remediation lead to new learning and long-term retention. (MDH)