Divisibility Rules For Prime Divisors

<h1>Divisibility Rules For Prime Divisors</h1>Author: <a title="kvln" href="http://www.articlesbase.com/authors/kvln/107350.htm">kvln</a> studying methods that can be used to determine whether a number is evenly divisible by other numbers, is an important topic in elementary number theory. These are shortcuts for testing a number's factors without resorting to division calculations. The rules transform a given number's divisibilty by a divisor to a smaller number's divisibilty by the same divisor. If the result is not obvious after applying it once, the rule should be applied again to the smaller number. In childrens' math text books, we will usually find the divisibilty rules for 2,3,4,5,6,8,9,11. Even finding the divisibilty rule for 7, in those books is a rarity. In this article, we present the divisibilty rules for prime numbers in general and apply it to specific cases, for prime numbers, below 50. We present the rules with examples, in a simple way, to follow, understand and apply.   Divisibility Rule for any prime divisor 'p' : Consider multiples of 'p' till (least multiple of 'p' + 1) is a multiple of 10, so that one tenth of (least multiple of 'p' + 1) is a natural number. Let us say this natural number is 'n'. Thus, n = one tenth of (least multiple of 'p' + 1). Find (p - n) also. Example (i) : Let the prime divisor be 7. Multiples of 7 are 1x7, 2x7, 3x7, 4x7, 5x7, 6x7, 7x7 (Got it. 7x7 = 49 and 49+1=50 is a multiple of 10). So 'n' for 7 is one tenth of (least multiple of 'p' + 1) = (1/10)50 = 5 'p-n' = 7 - 5 = 2.   Example (ii) : Let the prime divisor be 13. Multiples of 13 are 1x13, 2x13, 3x13 (Got it. 3x13 = 39 and 39+1=40 is a multiple of 10). So 'n' for 13 is one tenth of (least multiple of 'p' + 1) = (1/10)40 = 4 'p-n' = 13 - 4 = 9. The values of 'n' and 'p-n' for other prime numbers below 50 are given below.   p n p-n 7 5 2 13 4 9 17 12 5 19 2 17 23 7 16 29 3 26 31 28 3 37 26 11 41 37 4 43 13 30 47 33 14 After finding 'n' and 'p-n', the divisibilty rule is as follows : To find out, if a number is divisible by 'p', take the last digit of the number, multiply it by 'n', and add it to the rest of the number. or multiply it by '(p - n)' and subtract it from the rest of the number. If you get an answer divisible by 'p' (including zero), then the original number is divisible by 'p'. If you don't know the new number's divisibility, you can apply the rule again.   So to form the rule, we have to choose either 'n' or 'p-n'. Usually, we choose the lower of the two. With this knlowledge, let us state the divisibilty rule for 7. For 7, p-n (= 2) is lower than n (= 5). Divisibility Rule for 7 : To find out, if a number is divisible by 7, take the last digit, Multiply it by two, and subtract it from the rest of the number. If you get an answer divisible by 7 (including zero), then the original number is divisible by 7. If you don't know the new number's divisibility, you can apply the rule again. Example 1 : Find whether 49875 is divisible by 7 or not. Solution : To check whether 49875 is divisible by 7 : Twice the last digit = 2 x 5 = 10; Rest of the number = 4987 Subtracting, 4987 - 10 = 4977 To check whether 4977 is divisible by 7 : Twice the last digit = 2 x 7 = 14; Rest of the number = 497 Subtracting, 497 - 14 = 483 To check whether 483 is divisible by 7 : Twice the last digit = 2 x 3 = 6; Rest of the number = 48 Subtracting, 48 - 6 = 42 is divisible by 7. ( 42 = 6 x 7 ) So, 49875 is divisible by 7. Ans.   Now, let us state the divisibilty rule for 13. For 13, n (= 4) is lower than p-n (= 9). Divisibility Rule for 13 : To find out, if a number is divisible by 13, take the last digit, Multiply it with 4, and add it to the rest of the number. If you get an answer divisible by 13 (including zero), then the original number is divisible by 13. If you don't know the new number's divisibility, you can apply the rule again. Example 2 : Find whether 46371 is divisible by 13 or not. Solution : To check whether 46371 is divisible by 13 : 4 x last digit = 4 x 1 = 4; Rest of the number = 4637 Adding, 4637 + 4 = 4641 To check whether 4641 is divisible by 13 : 4 x last digit = 4 x 1 = 4; Rest of the number = 464 Adding, 464 + 4 = 468 To check whether 468 is divisible by 13 : 4 x last digit = 4 x 8 = 32; Rest of the number = 46 Adding, 46 + 32 = 78 is divisible by 13. ( 78 = 6 x 13 ) (if you want, you can apply the rule again, here. 4x8 + 7 = 39 = 3 x 13)   So, 46371 is divisible by 13. Ans.   Now let us state the divisibilty rules for 19 and 31. for 19, n = 2 is more covenient than (p - n) = 17. So, the divisibilty rule for 19 is as follows. To find out, whether a number is divisible by 19, take the last digit, multiply it by 2, and add it to the rest of the number. If you get an answer divisible by 19 (including zero), then the original number is divisible by 19. If you don't know the new number's divisibility, you can apply the rule again.   For 31, (p - n) = 3 is more covenient than n = 28. So, the divisibilty rule for 31 is as follows.   To find out, whether a number is divisible by 31, take the last digit, multiply it by 3, and subtract it from the rest of the number. If you get an answer divisible by 31 (including zero), then the original number is divisible by 31. If you don't know the new number's divisibility, you can apply the rule again.   Like this, we can define the divisibilty rule for any prime divisor. The method of finding 'n' given above can be extended to prime numbers above 50 also. Before, we close the article, let us see the proof of Divisibilty Rule for 7   Proof of Divisibilty Rule for 7 : Let 'D' ( > 10 ) be the dividend. Let D1 be the units' digit and D2 be the rest of the number of D. i.e. D = D1 + 10D2 We have to prove (i) if D2 - 2D1 is divisible by 7, then D is also divisible by 7 and (ii) if D is divisible by 7, then D2 - 2D1 is also divisible by 7. Proof of (i) : D2 - 2D1 is divisible by 7. So, D2 - 2D1 = 7k where k is any natural number. Multiplying both sides by 10, we get 10D2 - 20D1 = 70k Adding D1 to both sides, we get (10D2 + D1) - 20D1 = 70k + D1 or (10D2 + D1) = 70k + D1 + 20D1 or D = 70k + 21D1 = 7(10k + 3D1) = a multiple of 7. So, D is divisible by 7. (proved.) Proof of (ii) : D is divisible by 7 So, D1 + 10D2 is divisible by 7 D1 + 10D2 = 7k where k is any natural number. Subtracting 21D1 from both sides, we get 10D2 - 20D1 = 7k - 21D1 or 10(D2 - 2D1) = 7(k - 3D1) or 10(D2 - 2D1) is divisible by 7 Since 10 is not divisible by 7, (D2 - 2D1) is divisible by 7. (proved.) In a similar fashion, we can prove the divisibilty rule for any prime divisor. For more about Divisibilty Rules, go to, <a href="http://www.math-help-ace.com/Divisibility-Rules.html" target="_blank" title="http://www.math-help-ace.com/Divisibility-Rules.html"><a target="_blank" href="http://www.math-help-ace.com/Divisibility-Rules.html">http://www.math-help-ace.com/Divisibility-Rules.html</a></a>About the Author: Name : kvln
Qualifications : B.Tech., M.S. (from IIT, Madras) 
Has 14 years of teaching experience. 
Love for math and love for teaching 
makes me feel more than happy to help. 
Has own math web site : 
<a target="_blank" href="http://www.math-help-ace.com/">http://www.math-help-ace.com/</a>Article Source: <a href="http://www.articlesbase.com/">ArticlesBase.com</a> - <a href="http://www.articlesbase.com/k-12-education-articles/divisibility-rules-for-prime-divisors-792025.html" title="Divisibility Rules For Prime Divisors">Divisibility Rules For Prime Divisors</a>

studying methods that can be used to determine whether a number is evenly divisible by other numbers, is an important topic in elementary number theory.

These are shortcuts for testing a number's factors without resorting to division calculations.

The rules transform a given number's divisibilty by a divisor to a smaller number's divisibilty by the same divisor.

If the result is not obvious after applying it once, the rule should be applied again to the smaller number.

In childrens' math text books, we will usually find the divisibilty rules for 2,3,4,5,6,8,9,11.

Even finding the divisibilty rule for 7, in those books is a rarity.

In this article, we present the divisibilty rules for prime numbers in general and apply it to specific cases, for prime numbers, below 50.

We present the rules with examples, in a simple way, to follow, understand and apply.

Divisibility Rule for any prime divisor 'p' :

Consider multiples of 'p' till (least multiple of 'p' + 1) is a multiple of 10, so that one tenth of (least multiple of 'p' + 1) is a natural number.

Let us say this natural number is 'n'.

Thus, n = one tenth of (least multiple of 'p' + 1).

Find (p - n) also.

Example (i) :

Let the prime divisor be 7.

Multiples of 7 are 1x7, 2x7, 3x7, 4x7, 5x7, 6x7,

7x7 (Got it. 7x7 = 49 and 49+1=50 is a multiple of 10).

So 'n' for 7 is one tenth of (least multiple of 'p' + 1) = (1/10)50 = 5

'p-n' = 7 - 5 = 2.

Example (ii) :

Let the prime divisor be 13.

Multiples of 13 are 1x13, 2x13,

3x13 (Got it. 3x13 = 39 and 39+1=40 is a multiple of 10).

So 'n' for 13 is one tenth of (least multiple of 'p' + 1) = (1/10)40 = 4

'p-n' = 13 - 4 = 9.

The values of 'n' and 'p-n' for other prime numbers below 50 are given below.

p n p-n

7 5 2

13 4 9

17 12 5

19 2 17

23 7 16

29 3 26

31 28 3

37 26 11

41 37 4

43 13 30

47 33 14

After finding 'n' and 'p-n', the divisibilty rule is as follows :

To find out, if a number is divisible by 'p', take the last digit of the number, multiply it by 'n', and add it to the rest of the number.

or multiply it by '(p - n)' and subtract it from the rest of the number.

If you get an answer divisible by 'p' (including zero), then the original number is divisible by 'p'.

If you don't know the new number's divisibility, you can apply the rule again.

So to form the rule, we have to choose either 'n' or 'p-n'.

Usually, we choose the lower of the two.

With this knlowledge, let us state the divisibilty rule for 7.

For 7, p-n (= 2) is lower than n (= 5).

Divisibility Rule for 7 :

To find out, if a number is divisible by 7, take the last digit, Multiply it by two, and subtract it from the rest of the number.

If you get an answer divisible by 7 (including zero), then the original number is divisible by 7.

If you don't know the new number's divisibility, you can apply the rule again.

Example 1 :

Find whether 49875 is divisible by 7 or not.

Solution :

To check whether 49875 is divisible by 7 :

Twice the last digit = 2 x 5 = 10; Rest of the number = 4987

Subtracting, 4987 - 10 = 4977

To check whether 4977 is divisible by 7 :

Twice the last digit = 2 x 7 = 14; Rest of the number = 497

Subtracting, 497 - 14 = 483

To check whether 483 is divisible by 7 :

Twice the last digit = 2 x 3 = 6; Rest of the number = 48

Subtracting, 48 - 6 = 42 is divisible by 7. ( 42 = 6 x 7 )

So, 49875 is divisible by 7. Ans.

Now, let us state the divisibilty rule for 13.

For 13, n (= 4) is lower than p-n (= 9).

Divisibility Rule for 13 :

To find out, if a number is divisible by 13, take the last digit, Multiply it with 4, and add it to the rest of the number.

If you get an answer divisible by 13 (including zero), then the original number is divisible by 13.

If you don't know the new number's divisibility, you can apply the rule again.

Example 2 :

Find whether 46371 is divisible by 13 or not.

Solution :

To check whether 46371 is divisible by 13 :

4 x last digit = 4 x 1 = 4; Rest of the number = 4637

Adding, 4637 + 4 = 4641

To check whether 4641 is divisible by 13 :

4 x last digit = 4 x 1 = 4; Rest of the number = 464

Adding, 464 + 4 = 468

To check whether 468 is divisible by 13 :

4 x last digit = 4 x 8 = 32; Rest of the number = 46

Adding, 46 + 32 = 78 is divisible by 13. ( 78 = 6 x 13 )

(if you want, you can apply the rule again, here. 4x8 + 7 = 39 = 3 x 13)

So, 46371 is divisible by 13. Ans.

Now let us state the divisibilty rules for 19 and 31.

for 19, n = 2 is more covenient than (p - n) = 17.

So, the divisibilty rule for 19 is as follows.

To find out, whether a number is divisible by 19, take the last digit, multiply it by 2, and add it to the rest of the number.

If you get an answer divisible by 19 (including zero), then the original number is divisible by 19.

If you don't know the new number's divisibility, you can apply the rule again.

For 31, (p - n) = 3 is more covenient than n = 28.

So, the divisibilty rule for 31 is as follows.

To find out, whether a number is divisible by 31, take the last digit, multiply it by 3, and subtract it from the rest of the number.

If you get an answer divisible by 31 (including zero), then the original number is divisible by 31.

If you don't know the new number's divisibility, you can apply the rule again.

Like this, we can define the divisibilty rule for any prime divisor.

The method of finding 'n' given above can be extended to prime numbers above 50 also.

Before, we close the article, let us see the proof of Divisibilty Rule for 7

Proof of Divisibilty Rule for 7 :

Let 'D' ( > 10 ) be the dividend.

Let D1 be the units' digit and D2 be the rest of the number of D.

i.e. D = D1 + 10D2

We have to prove

(i) if D2 - 2D1 is divisible by 7, then D is also divisible by 7

and (ii) if D is divisible by 7, then D2 - 2D1 is also divisible by 7.

Proof of (i) :

D2 - 2D1 is divisible by 7.

So, D2 - 2D1 = 7k where k is any natural number.

Multiplying both sides by 10, we get

10D2 - 20D1 = 70k

Adding D1 to both sides, we get

(10D2 + D1) - 20D1 = 70k + D1

or (10D2 + D1) = 70k + D1 + 20D1

or D = 70k + 21D1 = 7(10k + 3D1) = a multiple of 7.

So, D is divisible by 7. (proved.)

Proof of (ii) :

D is divisible by 7

So, D1 + 10D2 is divisible by 7

D1 + 10D2 = 7k where k is any natural number.

Subtracting 21D1 from both sides, we get

10D2 - 20D1 = 7k - 21D1

or 10(D2 - 2D1) = 7(k - 3D1)

or 10(D2 - 2D1) is divisible by 7

Since 10 is not divisible by 7, (D2 - 2D1) is divisible by 7. (proved.)

In a similar fashion, we can prove the divisibilty rule for any prime divisor.

For more about Divisibilty Rules, go to,

http://www.math-help-ace.com/Divisibility-Rules.html

Name : kvln Qualifications : B.Tech., M.S. (from IIT, Madras)
Has 14 years of teaching experience.
Love for math and love for teaching
makes me feel more than happy to help.
Has own math web site :
http://www.math-help-ace.com/

Rate this Article:

0 / 5 stars - 0 vote(s)

Re-Publish

Article Source: http://www.articlesbase.com/k-12-education-articles/divisibility-rules-for-prime-divisors-792025.html

Article Tags: Learn Math, Elementary Number Theory, Free Math Help, Divisibility Rules, Factorization

Related Videos
Related Articles
Ask / Related Q&A

Play

Small Business Stories - Senator Claire McCaskill

Play

Learn about Multiplying and dividing negative numbers

Play

Learn about Level 4 division

Play

Learn about Dividing decimal

Play

Learn about Complex Numbers - part 2

Latest K-12 Education Articles
More from kvln

A total Eclipse of the Moon is a must see

By: Paul Ingersole | 31/12/2009
If you go through your lifetime without seeing any eclipses you are really missing out. Even if one is scheduled in your area, the weather needs to be in your favor. However, if you do get to see one, that is truly an excellent site.

1Y0-A08 Practice Testing

By: jessica | 31/12/2009
Certinside 1Y0-A08(HP Certified Specialist Software Quality) Practice Testing Software provides you an easy online solution to your HP 1Y0-A08 Exam Preparation. With Certinside 1Y0-A08 Practice Testing Software is tested on all Windows Platforms and contains the more recent HP 1Y0-A08 Exam Objectives.

How to Put On Makeup

By: Leslie Botts | 30/12/2009
Most people do not understand how to put on makeup correctly because many of us have designed our own methods of applying makeup and we don’t even know what is right and wrong.

How to Write Good NCERT Answers

By: Ashutosh Sharma | 30/12/2009
While writing NCERT answers it is important for students to realize that it is more than a mere compulsory exercise. Questions in the CBSE Boards exams are usually based on these NCERT Questions. To excel in exams, students should stress on writing quality NCERT answers by keeping in mind the salient points that govern the writing of answers for the specific content of the subject matter.

CBSE Solutions

By: Ashutosh Sharma | 30/12/2009
It is important for students to write their CBSE solutions in accordance to the marking scheme by CBSE. Revising using sample papers containing answers that are in accordance to the guidelines for CBSE solutions is an ideal revision exercise.

Comparing 3-D Traditional Chess Set to the Flat-Faced Chess Set

By: Frank Ho | 28/12/2009
It is interesting to note that western chess set are all made in 3-D figurines and each chess piece looks very different and yet Chinese chess sets are all flat-faced with uniform look on one surface, why is this? I do not know if anyone has done a research to look into and see why there is such a disparity in using such a very different styles?

Parent Involvement: A Must for Child’s Progress

By: shashanks | 27/12/2009
Children learn not only at school or with an online tutor; they also learn from their parents. Home, after all, is the first school that your child begins his education at. Parents can contribute to their child’s progress by doing small things that can really make a difference.

How to Run Math Franchise Successfully

By: Frank Ho | 26/12/2009
The other day, some one suggested to me that Ho Math and Chess shall also offer SAT course, I asked why? I was told that there is a demand and also many learning centers now offer SAT courses. The reason for Ho Math and Chess also jumps on the band wagon seems to be convincing but I would prefer to look at this issue in a long term view and this prompts me to spend next few days to ponder on a topic that is just how to run a math franchised centre and be successful?

Greatest Common Factor : Computing It Made Easy - Lucid Explanation Of An Efficient Method With Examples

By: kvln | 06/03/2009 | K-12 Education
Finding the largest positive integer that divides two or more numbers without remainder (G.C.F.) is an important topic in Elementary Number Theory. One way of finding the G.C.F. is by prime factorizations of the numbers. The second method based on the Euclidean algorithm, is more efficient and is discussed here. We provide lucid explanation of the method with a number of solved Examples.

Binary Number System : Lucid Explanation Of Conversion From And To Decimal Number System - Examples

By: kvln | 06/03/2009 | K-12 Education
We make the journey of learning the Binary Number System, binary place value charts, Conversion of base-two numerals to base-ten numerals and vice versa, pleasant, by lucid explanation with examples.

Quadratic Formula : Lucid Explanation Of Its Derivation And Application In Solving Problems

By: kvln | 05/03/2009 | K-12 Education
We explain lucidly, the derivation of Quadratic formula and applying it in finding the roots, Relation between roots and coefficients, Nature of the roots, finding Quadratic Equation whose roots are given, with Examples.

Factoring Trinomials (Quadratics) : Lucid Explanation Of The Method With Examples

By: kvln | 03/03/2009 | K-12 Education
We give step by step explanation of the method of factoring Quadratic Expressions. We apply the step by step method to solve a number of examples. The examples are so chosen that all the models are covered. Lucid Explanation of the method and its application to solve a number of problems, help the reader to feel confident to solve similar problems on his own.

Divisibility Rules For Prime Divisors

By: kvln | 26/02/2009 | K-12 Education
We present the general divisibilty rule for a Divisor which is a prime number and apply it to specific cases. We apply the rule for divisors 7, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47 (i.e. prime numbers below 50). We give the proof of the divisibilty rule for 7. The explanation is lucid and easy to follow, understand and apply.

Multiplication Table - Vedic Mathematics' Simple Technique Helps In Remembering It Easily

By: kvln | 26/02/2009 | K-12 Education
By using a simple technique from Vedic Math, I help you to remember Multiplication Table. You need to just remember some basic multiplication facts (2 times table upto 8 x 2; 3 times table upto 7 x 3; 4 times table upto 6 x 4; 5 times table upto 5 x 5;). Using these basic multiplication facts, we can arrive at all other values.

Modular Arithmetic (Congruences) Of Elementary Number Theory : Lucid Explanation With Examples

By: kvln | 26/02/2009 | Education
Modular Arithmetic (Congruences) is simply the arithmetic of remainders. It is an important part of Elementary Number Theory. Here, we give a lucid explanation of it with examples from day to day life. The explanation is so simple and interesting that any body with a school level math background can understand it.