An algorithm for long division is presented that involves only addition and subtraction. (MP)

The calculator is used to solve certain formidable equations, which arise naturally and which may be difficult or impossible to solve by standard methods, by a method of successive approximations. (MP)

Computational algorithms from American textbooks copyrighted prior to 1900 are presented--some that convey the concept, some just for special cases, and some just for fun. Algorithms for each operation with whole numbers are presented and analyzed. (MNS)

Shows that the rules of thumb for propagating significant figures through arithmetic calculations frequently yield misleading results. Also describes two procedures for performing this propagation more reliably than the rules of thumb. However, both require considerably more calculational effort than do the rules. (JN)

Using negative digits in writing numerals and in calculation is explained. This is the second article in the series; for the first, see Vol. 1, No. 7, Nov., 1972, pp. 8-9. (DT)

Eighteen college students solved addition problems using the Hutchings Low Fatigue Addition Algorithm, which requires a written record of running sums, and the standard algorithm, which does not. Students using the Hutchings algorithm had significantly higher reaction times to a tone, indicating that the Hutchings method requires less cognitive…

It is shown that Bayesian algorithms are computationally simpler in frequency formats than in the probability formats used in previous research. Analysis of several thousand solutions to Bayesian problems showed that when information was presented in frequency formats, statistically naive participants derived up to 50% of inferences by Bayesian…

Indicates that there has been a lot of work done and that a great deal needs to be done in the future to explore the world of children's early number. Discusses the counting, the use of algorithm, practical mathematics, the use of manipulatives, individual differences and pedagogical concerns, and classroom applications. Contains 18 references.…

The use of the calculator is suggested in teaching algorithms for the four basic operations, in place of any difficult standard algorithm. (MP)

Algorithms for generating random numbers are discussed along with disadvantages. A program for a programable calculator is given that overcomes those disadvantages. (MP)

The author redefines basic numeracy as the ability to use a four-function calculator sensibly. He then defines "sensibly" and considers the place of algorithms in the scheme of mathematical calculations. (MN)

Provides several algorithms that use extended precision methods to compute large factorials exactly. The programs are written in BASIC and PASCAL. The approach used for computing N considers how large N is, how the built-in limitation on exact integer representation can be bypassed, and how long it takes to compute N. (JN)

The Euclidean algorithm for finding the greatest common divisor is presented. (MNS)