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)

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)

Discrete mathematics and finite mathematics differ in a number of ways. First, finite mathematics has a longer history and is therefore more stable in terms of course content. Finite mathematics courses emphasize certain particular mathematical tools which are useful in solving the problems of business and the social sciences. Discrete mathematics…

Develops a division algorithm in terms of familiar manipulations of concrete objects and presents it with a series of questions for diagnosis of students' understanding of the algorithm in terms of the concrete model utilized. Also offers general guidelines for using concrete illustrations to explain algorithms and other mathematical principles.…

Shows how to model Newton's method for approximating roots on a spreadsheet. (MKR)

The ideas and techniques involved in learning about fractions were investigated with students in grades 1-12, in the first 3 years of colleges, in community college mathematics courses, and in graduate school. Also included were some high school mathematics teachers, some mathematicians, and some retired persons. Part I provides the rationale and…

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)

This paper presents a theoretical framework for investigating the role of algorithms in mathematical thinking using a combined ontological-psychological outlook. The intent is to demonstrate that the processes of learning and of problem solving incorporate an elaborate interplay between operational and structural conceptualizations of the same…

Seventh-grade students were tested to uncover arithmetic errors. Answers and intermediate steps were analyzed and models to represent students' behavior were developed. Certain errors were common across students. Others were tied to the format of the test item. Some superficial understandings of mathematical concepts were exposed. (Author/DC)

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)

Following a short introduction on the rationale and purpose for using algorithmic structures in the teaching of algebra, two topics from elementary algebra are presented in relation to control structures from computer programing, specifically: the multiplication of polynomials defined in terms of nested loops, and the distributive property…

Presents an algorithm to estimate pi by approximating a unit circle with a sequence of inscribed regular polygons. Demonstrates the application of the algorithm with a hand-held calculator and an Apple computer. Provides a program to calculate pi in Pascal programing language. (12 references) (MDH)

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)

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)