Describes examples of rational representation as a guide for translating terminology and information encountered in manuals for computers. Discusses four limitations of the representation. (YP)

Discusses arithmetic during long-multiplications and long-division. Provides examples in decimal reciprocals for the numbers 1 through 20; connection with divisibility tests; repeating patterns; and a common fallacy on repeating decimals. (YP)

Discusses how to express an n factorial as a product of powers of primes. Provides two examples and answers. Presents four related suggestions. (YP)

The sequence 1, 1, 2, 3, 5, 8, 13, 21, ..., known as Fibonacci sequence, has a long history and special importance in mathematics. This sequence came about as a solution to the famous rabbits' problem posed by Fibonacci in his landmark book, "Liber abaci" (1202). If the "n"th term of Fibonacci sequence is denoted by [f][subscript n], then it may…

In this paper, the author gives a further simple generalization of a power series evaluation of an integral using Taylor series to derive the result. The author encourages readers to consider numerical methods to evaluate the integrals and sums. Such methods are suitable for use in courses in advanced calculus and numerical analysis.

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

If larger and larger samples are successively drawn from a population and a running average calculated after each sample has been drawn, the sequence of averages will converge to the mean, [mu], of the population. This remarkable fact, known as the law of large numbers, holds true if samples are drawn from a population of discrete or continuous…

Discusses the mathematical properties of magic squares. Includes a computer program that will test magic square criteria. (PK)