A test for divisibility by any prime number is discussed and its proof is given. (MP)

An algorithm is given for computing the cube root of any real number on a calculator. (DT)

Two algorithms are developed for finding the square roots of numbers. One is based on the rule that x square is the sum of the first x odd numbers; the other is algebraic. (MP)

After a brief discussion of Pascal's triangle and description of four methods of hand construction, the author provides FORTRAN and BASIC programs for computer construction based on recursive definition. (SD)

A method for generating Pythagorean triples is presented and demonstrated with several examples. Its relationship to another method is shown and several interesting related facts are proven. (LS)

Common mistakes pupils make when adding fractions are categorized and analyzed. (MP)

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)

When two methods of transforming numbers from one base to another were taught sequentially, the first interfered with learning of the second. (SD)

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)

Patterns for a set of Napiers Bones and for a denominate number slide rule are provided, with instructions on how to use each of the calculating instruments. (DT)