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

Facts are given about the ninth-century Arab mathematician Al-Khwarizmi, from whose name the word algorithm is derived. His influence on algebra and arithmetic are discussed. (MNS)

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

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)

A history of perfect numbers is presented, which briefly covers the 27 values known at this time. (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)

Computational algorithms appearing in early American arithmetic text are discussed. (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)

A class's struggle with the computer solution of a nontrivial problem is related. The use of algorithms allowed a trial-and-error approach.