Murad-Smarandache Divisibility Test
by
Murad Abbas AlDamen
University of Jerash

% Murad-Smarandache Divisibility Test, Murad Abbas AlDamen,P.O.box 713330-Hai Nazzal 11171-Amman-Jordan , morad2000@math.org, Test, Test I'm looking for a simple way to explain if a number like M divides a number like N . On the other meaning In This paper, we give a new method to test the divisibility of any positive integer by another . Finally, we generalize our divisibility test to any integer base greater than 1. You can keep using this technique to get other formulas for divisibility for prime numbers. For composite numbers just check for divisibility by divisors. Example: if 7 divides N then 7 divides 2n_1-n_2 Reference 1) http://uzweb.uz.ac.zw/science/maths/zimaths/div19.htm 2)www.mathnstuff.com/math/spoken/here/1words/d/d32.htm 3) http:// hobbes.la.asu.edu/DNT/html/apps3.html 4)www.cut-the-knot.com/Generalization/div11.html 5) Divisibility Tests, Furman University Electronic Journal of Undergraduate Mathematics, Volume 3, 1997, pp 1-5.

6) "Tests for divisibility by 19" by M. Humphreys and N. Macharia, The Mathematical Gazette, Vol 82, No. 495, November 1998, pp 475-477.

7)www.mathworld.wolfram.com “divisibility test” 8)Elementary Number theory and its Applications "Kenneth H. Rosen"

Date received: October 10, 2000

Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caft-18.