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

An algorithm for long division is presented that involves only addition and subtraction. (MP)

A generalized method of synthetic division where the divisor polynomial may be of any degree equal to or larger than 1, and the dividend polynomial may be of equal or larger degree than the divisor polynomial and a generalization of the familiar remainder theorem, are presented. (Author/MK)

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)

This teacher guide is part of the materials prepared for an individualized program for ninth-grade algebra and basic mathematics students. Materials written for the program are to be used with audiovisual lessons recorded on tape cassettes. For an evaluation of the program, see ED 086 545. In this guide, the teacher is provided with objectives for…

How graph paper has been used to illustrate the algorithm for division of fractions is presented. The combined use of graph paper and an overhead projector can make the presentation even more convincing. A review of whole number division is recommended prior to the lesson. (MP)

P-adic or g-adic sets are sets of elements formed by linear combinations of powers of p, a prime number, or g, a counting number, where the coefficients are whole numbers less than p or g. Discusses exercises illustrating basic numerical operations for p-adic and g-adic sets. Provides BASIC computer programs to verify the solutions. (MDH)