Describes a pattern which emerged from an examination of the digits of the squares of numbers. Provides eight examples having the pattern at the units or tens digit of the number. (YP)

The problem of getting a correct result when a fraction is reduced by cancelling a digit which appears in both the numerator and the denominator is extended from the base ten situation to any number base. (DT)

Algorithms are developed and presented for the addition and multiplication of positive rational numbers using only their repeating decimal representation. (MN)

A rationale is given for the Russian-peasant algorithm for multiplication indicating why it works as well as how it works. (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 concept of prime factorization is discussed and two rules are developed: one for finding the number of divisors of a number and the other for finding the sum of the divisors. (MP)

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)

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)

A "neat and general" divisibility algorithm for prime numbers is presented. Five illustrative examples are included. (MNS)

Presented are the mathematical explanation of the algorithm for representing rational numbers in base two, paper-and-pencil methods for producing the representation, some patterns in these representations, and pseudocode for computer programs to explore these patterns. (MNS)