1.

Introduction

Number theory is a branch of pure mathematics devoted primarily to the study of integer

and integer-valued functions. There are a lot of topics in number theory yet we will straightforward

to the field of divisibility that is a rule to give an interesting ‘window’ into the nature of numbers

and their properties (Posamentier, 2003). Lastly, in this article, we will try to embellish the

conceptualize result for divisibility tests using basic facts of linear congruence and modular

arithmetic.

2. Background of the Study

We can define a divisibility test as an easy way to identify whether the given number is

divided by a fixed divisor without actually performing the long division process.

In other words, divisibility test can be define as an algorithm, which uses the digits of an

integer N to determine whether N is divisible by a divisor d.

The history of divisibility tests started back from at least 500 C.E. when a divisibility test

for 7 was included in the Babylonian Talmud. Since then, that methods which provide divisibility

tests for all positive integers have been discovered and rediscovered by a wide population of

mathematicians and mathematical enthusiasts including Blaise Pascal, Joseph-Louis Lagrange,

and Charles Dodgson (a.k.a. Lewis Caroll, author of Alice In Wonderland).

A remarkable summary of the literature in relation to divisibility tests published prior to

1915 is provided in Leonard Dickson’s History of the Theory of Numbers, Edward Brooks devoted

two chapters to the study of divisibility tests in his 1880 book The Philosophy of Arithmetic.

Recently in (2006), Marc Renault published a wonderful article that provides divisibility tests for

Page 1 of 12
all integers 2 and 102, which includes brief explanations for why the test work. And lastly, Eric L.

McDowell (Berry College) in Divisibility Tests: A History and User’s Guide presents a modest

survey of some of the recent literature regarding divisibility tests.

3. Statement of the Problem

In this article, the core problem which this study intends to investigate or to look-into is

two folds;

 Trying to investigate or explore other proposition for the divisibility test for 7 and for

other integers, and;

 Expanding the outcome of the approach to divisibility.

4. Assumptions

The study will focus on exploring the approach to divisibility through observation and by

investigating the proposed proposition for the divisibility test for 7 and for other integers such as

11, 13, and 17.

The study is delimited in obtaining new proposition that involves divisibility test for 7 and

for other integers such as 11, 13, and 17, and form a conjecture of the proposed proposition.

5. Definition of Terms

5.1 Definition (Modular Arithmetic)

Sometimes referred to as modulus arithmetic or clock arithmetic, in its most elementary

form, arithmetic done with a count that resets itself to zero every time a certain whole number N

greater than one, known as the modulus (mod), has been reached.

Page 2 of 12
5.2 Definition (Congruence Modulo m)

Let 𝑚 be a positive integer. Then an integer 𝑎 is said to be congruent to an integer 𝑏

modulo 𝑚 if 𝑚|(𝑎 − 𝑏) and we denote this in symbols as,𝑎 ≡ 𝑏(𝑚𝑜𝑑 𝑚); 𝑚 is the modulus of

the congruence relation.

5.3 Definition (Linear Congruence)

A congruence of the form 𝑎𝑥 ≡ 𝑏(𝑚𝑜𝑑 𝑚) where x is an unknown integer is called a

linear congruence in one variable.

5.3.1 Theorem The linear congruence 𝑎𝑥 ≡ 𝑏(𝑚𝑜𝑑 𝑚) is solvable if (𝑎, 𝑚)|𝑏.

5.3.2 Lemma Let ℤ denote the set of integers. Let 𝑎, 𝑏, 𝑐 ∈ ℤ such that

𝑎 + 𝑏 ≡ 0(𝑚𝑜𝑑 𝑐). Then, we have, 𝑎 ≡ 0(𝑚𝑜𝑑 𝑐) ⟺ 𝑏 ≡ 0(𝑚𝑜𝑑 𝑐).

5.4 Definition (Greatest Common Divisor (GCD))

The greatest common divisor of two integers 𝑎 and 𝑏 is the greatest integer that divides

both 𝑎 and 𝑏. We denote the GCD of two integers 𝑎 and 𝑏 by (𝑎, 𝑏).

5.5 Definition (Fundamental Theorem of Arithmetic)

Every positive integer different from 1 can be written uniquely as a product of primes.

5.6 Definition (Relatively Prime/Co-prime/Mutually Prime)

Two integers 𝑎 and 𝑏 are relatively prime if (𝑎, 𝑏) = 1.

Page 3 of 12
 6. Nature and Importance of the Study

The significance of the study will try to focus and emphasize in contributing to the

following:

 The readers and towards individual who are certainly part of the society as a whole that

this study may serve as a guide dealing with knowledge especially for those who are

taking similar studies.

 And, to the future researchers who would plan to make any related study especially the

standard under the Bachelor of Science in Mathematics program.

Overall, this research will be a useful tool as a reference in giving a quality and

synchronized way of making their work easygoing.

7. Results

7.1 Some Tests of Divisibility

7.1.1 Divisibility of numbers by 2:

A number that has 0, 2, 4, 6 or 8 in its ones place is divisible by 2.

7.1.2 Divisibility of numbers by 3:

A number is divisible by 3 if the sum of its digits is divisible by 3.

7.1.3 Divisibility of numbers by 4:

A number is divisible by 4 if the number formed by its last two digits (i.e. ones and tens)

is divisible by 4.

Page 4 of 12
7.1.4 Divisibility of numbers by 5:

A number that has either 0 or 5 in its ones places is divisible by 5.

7.1.5 Divisibility of numbers by 6:

A number is divisible by 6 if that number is divisible by both 2 and 3.

7.1.6 Divisibility of numbers by 8:

A number is divisible by 8 if the number formed by its last three digits is divisible by 8.

7.1.7 Divisibility of numbers by 9:

A number is divisible by 9 if the sum of its digits is divisible by 9.

7.1.8 Divisibility of numbers by 10:

A number that has 0 in its ones place is divisible by 10.

7.1.9 Divisibility of numbers by 12:

Any number which is divisible by both 4 and 3, is also divisible by 12.

7.1.10 Divisibility by 14:

Any number which is divisible by both 2 and 7, is also divisible by 14.

7.1.11 Divisibility by 15:

Any number which is divisible by 3 and 5 is also divisible 15.

7.1.12 Divisibility by 16:

Any number whose last 4 digit number is divisible by 16 is also divisible by 16.

Page 5 of 12
7.2 Conjecture

General Rules for Divisibility for all Numbers

 If a number is divisible by another number, then it is also divisible by all the factors of

the other number.

 If two numbers are divisible by another number, then their sum and difference is also

divisible by the other number.

 If a number is divisible by two co-prime numbers, then it is also divisible by the product

of the two co-prime numbers.

7.3 Recall: (Divisible by 7)

We need to double the last digit of the number and then subtract it from the remaining

number that is, (a – 2b) = N’. If the result is divisible by 7, then the original number will also be

divisible by 7.

7.3.1 Example: 672

In the number 672, double the last digit of the number 2 is 4. 67 – 4 = 63.

Since 63 is divisible by 7. Hence, 672 is also divisible by 7.

7.4 Divisibility Test for 7

Let N be a given positive integer. We express N in the form of 10𝑎 + 𝑏, where 𝑏 is the unit

(N−b)
digit of N in decimal representation and 𝑎 = , the rest of N. Now,
10

(10a + b) − 3(a − 16b) = 7(a + 7b) ≡ 0(mod 7)

Page 6 of 12
 So, (10a + b) ≡ 0(mod 7) ⟺ 3(a − 16b) ≡ 0(mod 7) ⟺ (a − 16b) ≡ 0(mod 7)

[∵ gcd(3,7) = 1]

Suppose, 𝑁 ′ = (a − 16b). Hence, 7|𝑁 ⟺ 7|𝑁′.

7.5 Observation

Upon observation the integer 𝑁′ has less digit than 𝑁 wherein it is more easier to solve

using 𝑁 ′ and the integer with less digit can easily be determined whether it is divisible by the

approach or not. Basically, it is solvable if it has less digit. In this case, if the integer 𝑁 is still

bigger than the integer 𝑁 ′ , then we can perform the same checking on 𝑁. We will solve it until it

will last at its less digit to easily identify if it is divisible by 7.

7.6 Example

We want to check whether 7 divides 17526384 or not. Using 𝑁 ′ = (𝑎 − 16𝑏).

17526384 → 1752574 → 175193 → 17471 → 1731 → 157.

Hence, 7 ∤ 157 ⟹ 7 ∤ 17526384.

New proposed proposition:

7.7 Proposition

Let 𝑁 be any positive integer, 𝑏 be its unit digit and 𝑎 be the rest of the number 𝑁, then

7|𝑁 ⟺ 7|(𝑎 − 16𝑏) as a divisibility test for 7.

Page 7 of 12
7.8 Conjecture

The new proposed proposition will holds true if the bi-conditional statement which is

7|𝑁 ⟺ 7|𝑁′ where N and 𝑁 ′ = (a − 16b) are satisfied and both statement have the same truth

value, the bi-conditional is true.

7.9 Observation

We have observed that such a rule is not unique because

(10a + b) − 3(a − 9b) = 7(a + 4b) ≡ 0(mod 7).

So, 7|𝑁 ⟺ 7|(𝑎 − 9𝑏).

7.10 Divisibility Test for Other Integers

7.10.1 Divisibility Test for 11

(10a + b) + (a + 10b) = 11(a + b) ≡ 0(mod 11)

Hence, 11|(10𝑎 + 𝑏) ⟺ 11|(a + 10b).

7.10.2 Divisibility Test for 13

(10a + b) + 3(a − 22b) = 13(a − 5b) ≡ 0(mod 13)

Hence, 13|(10a + b) ⟺ 13|(a − 22b).

7.10.3 Divisibility Test for 17

(10a + b) + 7(a − 22b) = 17(a − 9b) ≡ 0(𝑚𝑜𝑑 17)

Hence, 17|(10𝑎 + 𝑏) ⟺ 17|(a − 22b).

Page 8 of 12
7.11 Theorem

For every 𝑛 ∈ ℕ co-prime to 10, we can get such a divisibility test.

7.12 Observation

It is visible in previous slide (7.10) that we are trying to find an integer of the form a + xb

where x ∈ ℤ with the property that 𝑛|(10𝑎 + 𝑏) ⟺ 𝑛|(𝑎 + 𝑥𝑏) where 𝑛 is a positive integer co-

prime to 10 whose divisibility test we want to find out.

Proof (7.11 Theorem):

Suppose that 𝑁 = 10𝑎 + 𝑏 be any given integer where 𝑏 is its unit digit in the decimal

representation and 𝑎 be the rest of 𝑁.

If we can find an integer 𝑥 such that (10𝑎 + 𝑏) + (𝑛 − 10)(𝑎 + 𝑥𝑏) ≡ 0(𝑚𝑜𝑑 𝑛), then

clearly the 𝑥 will have the desired property 𝑛|(10𝑎 + 𝑏) ⟺ 𝑛|(𝑎 + 𝑥𝑏) because

gcd(𝑛 − 10, 𝑛) = 1 since gcd(𝑛, 10) = 1.

10𝑎 + 𝑏 + 𝑛𝑎 + 𝑛𝑥𝑏 − 10𝑎 − 10𝑥𝑏 ≡ 0(𝑚𝑜𝑑 𝑛)

If 𝑥 satisfies

10𝑥 ≡ 1(𝑚𝑜𝑑 𝑛).

It has a solution because gcd(𝑛, 10) = 1. Moreover, the linear congruence has a solution

in modulo 𝑛. And so, {𝑥0 + 𝑛𝑡 : 𝑡 ∈ ℤ} is the set of all solutions for linear congruennce where 𝑥0

is a solution of 10𝑥 ≡ 1(𝑚𝑜𝑑 𝑛). □

Page 9 of 12
7.13 Conjecture

The linear congruence in the form 10𝑥 ≡ 1(𝑚𝑜𝑑 𝑛) has a unique solution in modulo 𝑛

given that gcd(𝑛, 10) = 1.

7.14 Conjecture

There are infinite number of choices for x.

The following table shows a particular solution of 10𝑥 ≡ 1(𝑚𝑜𝑑 𝑛) for different unit digits of 𝑛.

Unit Digit of 𝑛 Particular Solution

1 (1 − 𝑛)/10
3 (1 − 7𝑛)/10
7 (1 − 3𝑛)/10
9 (1 − 9𝑛)/10
Table 7(a)

7.15 Example

To illustrate the table an example is given:

𝑁 = 214379 𝑎𝑛𝑑 𝑛 = 43

1−7𝑛 1−7(43)
Since the unit digit of 𝑛 = 3, then it corresponds to → = −30.
10 10

So, 43|𝑁 ⟺ 43|(𝑎 − 30𝑏) where 𝑏 is the unit digit of 𝑁 and 𝑎 is the rest of the number 𝑁.

Now, 214379 → 21167 → 1906 → 10. Hence, 43 ∤ 10 ⟹ 43 ∤ 214379.

7.16 Observation

The calculation of 7.15 is simplest than performing the usual division method.

Page 10 of 12
7.17 Observation

We can determine whether a given positive integer is divisible by any positive integer co-

prime to 10 is by performing some simple calculation using the table 7(a).

Page 11 of 12
 8. References

[1] Walter William Rouse Ball, Garnett Carper, and Florian Cajori. History of Mathematics.

Macmillan, 1919.

[2] David M Burton. Elementary Number Theory. Tata McGraw-Hill Education, 2006.

[3] David M Burton. The History of Mathematics: An Introduction, volume 10. McGraw-Hill

Science/Engineering/Math;, 2010

[4] R. Health Brown J. Silverman G.H. Hardy, E.M. Wright and A. Wiles. An Introduction to

the Theory of Numbers. Clarendon press Oxford, 6th edition, 2008.

[5] Kenneth Ireland and Michael Ira Rosen. A Classical Introduction to Modern Number

Theory, volume 1982. Springer, 1982.

[6] Thomas Koshy. Elementary Number Theory with Applications. Academic Press, 2002.

[7] Wissam Raji. An Introductory Course in Elementary Number Theory, 2013.

[8] Eric. Education Resources Information Center.

[9] Career Power. An IIT/IIM Alumni Company – Tests of Divisibility.

Page 12 of 12