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)

A distinction is made between an algorithm and the justification for the algorithm. Examples of both are given for the operations with whole numbers. (DT)

A history of perfect numbers is presented, which briefly covers the 27 values known at this time. (MP)

The major portion of the article establishes the basis for the stated rule - to divide by a fraction, turn it upside down and multiply. With this background, three justifications for the rule are given. Several possible errors in students' use of the rule are noted. (LS)

A rationale is given for the Russian-peasant algorithm for multiplication indicating why it works as well as how it works. (DT)

In this first of two articles, computational algorithms for multiplication and division which encourage use of one operation at a time are proposed. (DT)

After briefly presenting possible origins for the use of the decimal system for counting and the duodecimal (base twelve) system for many measures, a notational scheme using six positive'' digits and six negative'' digits is presented. Examples and algorithms using this set of digits for operations with whole numbers, fractions, and in…

The Russian-peasant algorithm for multiplication is described and then extended to developing an algorithm for renaming base ten numbers in other number bases. (DT)

Argues that the type of calculator that is used in mathematics instruction is very important. Suggests that four-function calculators fail to give correct values of mathematical expressions far more often than do scientific calculators. (PK)

In a thesis written for the Doctor of Arts in Mathematics, the connection between Euclid's algorithm and continued fractions is developed and extended to n dimensions. Applications to computer sciences are noted. (SD)