NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 4 results Save | Export
Peer reviewed Peer reviewed
Smith, Lehi T. – Mathematics Teacher, 1978
A test for divisibility by any prime number is discussed and its proof is given. (MP)
Descriptors: Algorithms, Division, Instruction, Mathematics
Peer reviewed Peer reviewed
Reimann, Kurt W. – Mathematics Teacher, 1980
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)
Descriptors: Algebra, Algorithms, Division, Mathematics Curriculum
Peer reviewed Peer reviewed
Szetela, Walter – Mathematics Teacher, 1980
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)
Descriptors: Algorithms, Division, Mathematical Concepts, Mathematics Instruction
Peer reviewed Peer reviewed
Aslan, Farhad; Duck, Howard – School Science and Mathematics, 1992
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)
Descriptors: Addition, Algebra, Algorithms, College Mathematics