Presents recently developed generalizations to the sieve of Eratosthenes, showing the principles underlying these improvements, which increase its efficiency without changing too much of its simplicity. Offers several possibilities to propose good investigations for students to explore, find patterns, and make generalizations. (JRH)

A method for solving inequalities of degree greater than one is described. (MK)

Presents a method for solving linear equations involving the use of inverses instead of memorizing rules. (MKR)

Circuits are described, with discussion on how to help students find the algorithms to solve a variety of problems involving circuits. (MNS)

A generalized method of synthetic division where the divisor polynomial may be of any degree equal to or larger than 1, and the dividend polynomial may be of equal or larger degree than the divisor polynomial and a generalization of the familiar remainder theorem, are presented. (Author/MK)

Describes a calculator exercise that can help students develop a better visual and numeric feel for Newton's method. (KHR)

Presents alternative equation-solving procedures that emphasize an examination of the steps or operations necessary to perform a calculation, followed by the inversion of those steps. The approach is especially attractive to students with limited mathematical skills. (Author/MKR)

Attempts to describe a notion parallel to number sense, called symbol sense, incorporating the following components: making friends with symbols, reading through symbols, engineering symbolic expressions, equivalent expressions for non-equivalent meanings, choice of symbols, flexible manipulation skills, symbols in retrospect, and symbols in…

The article presents a general test for divisibility that includes composite numbers and shows that such a test can be used to determine divisibility by several numbers simultaneously. (MK)

An algorithm for multiplying natural numbers is described. The algorithm provides a chance for some unusual drill and might serve as an enrichment topic. (MK)

Described is a simple algorithm that can be used for the input, arithmetic manipulation, and output of large integers in their exact representations. Three BASIC programs are included that apply this method to the problem of multiplication of large integers, computation of factorials, and the generation of palindromic integers. (MNS)

Suggests and illustrates ways in which systematic consideration of selected unary operations can be facilitated by using electronic calculators. Emphasis is placed upon unary operations suitable for exploration and investigation at the pre-algebra level, using calculation algorithms as a basis for generating examples and non-examples to develop…

The following ideas are shared: (1) a low-stress subtraction algorithm that eliminates the traditional borrowing process, and (2) an approach to graphing circular functions that looks at the process of modifying simple functions as a series of shifting, sliding, and stretching adjustments, with its biggest advantage viewed as its generality. (MP)

Demonstrates that an elementary understanding of computer programing and the development and illustration of the structure of computer program analysis will be valuable assets in the understanding and teaching of mathematics and may be used as modeling devices to simulate the stages of learning. (Author)

The first section promotes use of student notebooks in mathematics instruction as incentives for pupils to do daily work. Part two looks at a geometric interpretation of the Euclidean algorithm. The final section examines an open box problem that is thought to appear in virtually every elementary calculus book. (MP)