Abstract
In this paper we deal with divisibility criteria for any integer in decimal system. In the development of these criteria we use facts from congruence theory: as modular Arithmetic, linear congruences, and some important properties of divisibility and congruence. Then, we give general divisibility criteria for the two classes of positive integers. The divisibility criteria for the first class of divisors is written down as a linear form in which the decades and the units digits of the test integer are involved in such a way that the co-efficient of the decades takes one and that of the units digit is an integer formed by a parameter, which is the solution of the linear congruence describing the co-primality of the divisor and the base of the underlying number system. This divisibility parameter is not unique, but each yields a unique criterion. Finally, we apply the rule giving a couple of examples and make a conclusion which summarizes the general divisibility test in terms of the two classes of divisors. Keywords: co-prime, modular Arthmetics, linear congruences, divisibility criteria, fundamental theorem of arthmetics DOI : 10.7176/JNSR/9-7-06 Publication date : April 30 th 2019
Highlights
Divisibility rules are designed to answer the question of divisibility of an integer a by a divisor integer without performing division
Are some facts of congruence theory,which is an important tool in number theory, besides handling related problems as solving congruence equations, remainder problems and the like, it is being used in the development of a generalized test of divisibility
The basic facts that are to be used in this paper are linear congruences and their properties along with modular Arthmetics and the Fundamental theorem of Arthmetics
Summary
Divisibility rules are designed to answer the question of divisibility of an integer a by a divisor integer without performing division. In the area of divisibility very little attention has been given. For checking that a given integer is a multiple of any other integer is still time taking, we have some algorithms, such as Euclid’s algorithm, which is one of the preeminent methods ever known regarding the underlying concept. Till the date there was no a feasible generalized test for divisibility. Are some facts of congruence theory ,which is an important tool in number theory, besides handling related problems as solving congruence equations, remainder problems and the like, it is being used in the development of a generalized test of divisibility. The basic facts that are to be used in this paper are linear congruences and their properties along with modular Arthmetics and the Fundamental theorem of Arthmetics. A conclusion is given in the last section of this paper
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.