The Euclidean Discus Toss is an active and tactile learning activity that models the extended Euclidean algorithm with a frisbee relay. The extended Euclidean algorithm involves both iterative and recursive programming and is regularly taught throughout the mathematics and computer science curricula. The Euclidean Discus Toss invites students to…

Every educator knows the sinking feeling of a lesson gone wrong. As teachers look around the room and realize that many of their students are just not getting it, they often feel like failures. However, the struggle students experience as they persevere through high-quality challenging tasks is not a sign of failure, but rather a key aspect of…

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)

Develops a general computer algorithm to obtain a magic square having a number of rows that is a multiple of four. Presents a BASIC program and sample runs. (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)

Presents an example from the combinatorial theory of partially ordered sets. Discusses algorithms of on-line antichain partitioning problems, a topic in discrete optimization. (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)

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)

This paper describes the BUD project which surveyed childrens' conceptions of division, and of fractions and decimals. The lack of connection between counting skills and conceptual understanding is discussed. The expectations for new algorithms and the basic idea in planning the BUD project are summarized. Some previous studies on counting, the…