Divisibility In General

Divisibility is the basis for the development of number theory, so that the concepts of
divisibility will be widely used in most mathematical descriptions or explanations of proof of
theorem.
If an integer is divided another integer, the result is an integer or a number that is not rounded, for
example, if 40 is divides 8, the resultis an integer 8; but if 40 is divides 16, then the outcome for
him is 2.5. This situation gives the idea of the need for division definition.

Definition 1.1

An integer q is divides an integer p ≠ 0 if there is an integer x so that q = px

Notation
p | q is read p divides q, p factor of q, q is divisible by p, or q multiples of p
p ∤ q is read p does not divides q, p is not a factor of q, q is not divisible by p, or q is not a
multiple of p

Example 1.1

a. 6 | 18 because there is an integer 3 so that 18 = 6.3

b. 12 ∤ 15 because there is no integer x so 15 = 12.x
c. 5 | -30 because there are integers -6 so that -30 = 5. (- 6)
d. -4 | 20 because there is an integer 5 so that 20 = (-4) .5

Based on the definition 1.1 above it is clear that the factors of a number can be positive
integers or are negative integers. Thus, the factors of:
6, are 1, -1, 2, -2, 3, -3, 6, and -6
15, are 1, -1, 3, -3, 5, -5, 15, and -15

Some simple properties of division are:

1. 1 | p for each p  Z
2.p | 0 for each p  Z and p ≠ 0
3. p | p for each p  Z and p ≠ 0
4. If p | q, then the possible relationship between p and q is p <q, p = q, or p> q (for
example 3 | 6, 3 | 3, or 3 | -3)

1
Theorem 1.1

If p and q are element of integer, and p divides q, then p divides qr for all r

element ℤ

Mathematical Sentences

p, q  ℤ ˄ p | q, ⇒ p | qr ∀ r  ℤ

Negation

p and q are element of integers, and p divides q, and p is not divides qr for all element ℤ

Mathematical Sentences

(p, q  ℤ ˄p | q)˄(p ∤ qr)∀ r  ℤ

Proving the theorem

Proof:
It is known that p | q, then by definition 2.1, there is an xZ so that q = px,
q = px means qr = pxr, or qr = p (x.r) with xr Z (because x  Z and r  Z)
In accordance with definition 2.1, because qr = p (xr) then p | qr

Example 1.2

Prove that 7 | 616 ⇒ 7 | 1848

It is known that 7 | 616, then by definition 2.1, there is an xZ so that 616 = 7x means that
there is 1848 = 616r, or 1848 = 7xr. this show that 7 | 1848.

Example 1.3 (Counter Example)

Is it true that for all xZ, 2 | 4 ⇒ 2 | x?

It is known that 2 | 4, then there is an yZ so that 4 = 2y. But, we know that for x,yZ , an
odd number is not equal to 2y. This show that for xZ, 2 | 4 ⇒ 2 | x Is false.

2
Theorem 1.2

If there is an integer p, q and r, which is p divides q, and q divides r, then p divides r

Mathematical Sentences
If p, q, r  Z, p | q, ˄ q | r, ⇒ p | r

Negation

If there is an integer p, q and r, which is p divides q, and q divides r, and p is not divides r

Mathematical Sentences

p, q, r  Z, (p | q, ˄q | r), ˄ (p ∤ r)
Proof

Given p | q and q | r, then according to definition 2.1, of course there are x, y  Z so that
q = px and r = qy,r = qy and q = px, then r = (px) y or r = p (xy) with x, yZ
In accordance with definition 2.1, because r = p (xy), then p | r

Example 1.4

Because 11 | 66 and 66 | 198, there are integers e and f such that 11e = 66 and 66f = 198. hence,
198 = 66f = (11e)f = 11 (ef), and we conclude that 11 | 198.

Example 1.5 (Counter Example)

Is it true that for all x Z, (x | 4), (4 | 16) ⇒ x | 16

Because x | 4 and 4 | 16, there are integers e and f such that xe = 4 and 4f = 16. hence, 16 = 4f =
(xe)f = x (ef), but if x = 3, then 16 ≠ x (ef), because 3 ∤ 16. so, it is false for all x Z, (x | 4), (4 |
16) ⇒ x | 16

Theorem 1.3
If p and q is element of integer number, p divides q and q divides p, then p equals to q
Mathematical Sentences
p, q 𝜖 Z, (p | q ˄q | p ) ⇒ p = q
Negation

3
 p and q is element of integer number, p divides q and q divides p and p not equals to q
Mathematical Sentences
p, q 𝜖 Z, (p | q ˄q | p ) ˄ p ≠ q
Proving by theorem
Proof:
Given p | q and q | p then according to the definition 2.1, there are x, y 𝜖 Z so that
p = qx and q = py.
So: p = (py) x = p (yx) = p (xy) = (xy) p, or 1.p = (xy) p, so that xy = 1
Thus, because x, y 𝜖 Z and xy = 1, x = -1 = y or
x=1=y
If x = -1 = y, then p = -q
If x = 1 = y, then p = q
Example 1.6
Prove that 7 | p , p | 7 ⇒ p = 7

Given 7 | p and p | 7 then there are x, y ϵ Z so that p = 7x and 7 = py.

So: 7 = py = (7x)y = 7 (xy), so that xy = 1.
Thus, because x, y ϵ Z and xy = 1, and x = 1 = y, then p = 7.
Example 1.7 (Counterexample)
Is it true that for pZ, 7 | p , p | 7 ⇒ p = 7
Given 7 | p and p | 7 then there are x, y ϵ Z so that p = 7x and 7 = py.
So: 7 = py = (7x)y = 7 (xy), so that xy = 1. Thus, because x, y ϵ Z and xy = 1, and x = 1 = y, then
p = 7. but, if x = -1 = y, then p = -7 ≠ 7.
So, it is false that for pZ, 7 | p , p | 7 ⇒ p = 7
Theorem 1.4
If p, q, r is element of integer number, p divides q and p divides r, then p divides q + r
Mathematical Sentence
p, q, r  Z, ( p | q ˄ p | r ) ⇒p | q + r
Negation

4
 p, q, r is element of integer number, p divides q and p divides r and p is not divides q + r
Mathematical Sentences
p, q, r  Z, ( p | q ˄ p | r ) ˄ p∤ q + r
Proving by theorem
Proof :
Because p | q and p | r, then according to definition 2.1, there are x, y 𝜖 Z so that q = px and
r = py.
Thus q + r = px + py = p (x + y)
Because x, y 𝜖 Z, so it corresponds to the closed property of the sum of integers, x + y 𝜖 Z
So: p | q + r
Example 1.8
Prove that 3 | 90, if 3 | 66 and 3 | 24.
Solution
Because 3 | 66 and 3 | 24, there are integers a and b such that 3a = 66 and 3b = 24.
Thus,
66 + 24 = 3a + 3b
⇒ 90 = 3(𝑎 + 𝑏),

and we can conclude that 3 | 90.

Example 1.9 (Counterexample)
Is it true that 3 | 10, if (3 | 6), (3 | 4)

We assume that 3 | 6 and 3 | 4. Then, there are a, b  Z so that 6 = 3a and 4 = 3b. But, 4 =
3b is contradicting with a, b  Z.

Thus, it is false that 3 | 10, if (3 | 6), (3 | 4)

Theorem 1.5

if there is an integer p, q, and r, which is p divides q an p divides r, then p divides (qx +

ry). For all x and y is element of integer number. (qx + ry is called a linear combination
of q and r)

5
Mathematical Sentences

If p, q, r  Z, p | q ˄ p | r, ⇒ p | qx + ry ∀x, y  Z

Negation

There is an integer p, q, and r, which is p divides q an p divides r, and p is not divides (qx
+ ry). For all x and y is element of integer number. (qx + ry is called a linear combination
of q and r)

Mathematical Sentences

p, q, r  Z, (p | q ˄p | r), ˄ (p ∤ qx + ry)∀x, y  𝑍

Proving the Theorem

Let p, q, and r  ℤ

p ‫ ׀‬q ⇔ There exist k  ℤ therefore q = pk (1)

p ‫ ׀‬r ⇔ t  ℤ therefore r = pt (2)

Look for the equation (1);

q = pk ⇒ qx = (pk) x (The all sides multipled by x)

⇒ qx = p (kx) (Assosiative Multiplication Property)

Look for the equation (2);

r = pt ⇒ ry = (pt) y (The all sides multipled by x)

⇒ ry = p (ty) (Assosiative Multiplication Property)

If the equation (1) and (2) we sum, we have:

qx+ry = p(kx)+ p(ty)
⇒ qx+ry = p (kx+ty) (Distributive Property)

Let, kx+ty = s, where s  ℤ, so qx+ry=ps.

By the definition of divisibility, we can conclude that qx+ry=ps
so that p‫( ׀‬qx+ry).

6
 So, p ‫ ׀‬q ˄ p ‫ ׀‬r ⇨ p ‫( ׀‬qx+ry), p,q,r,x,y  ℤ.
Example 1.10
Prove that 3 | 90, if 3 | 18 and 3 | 12
Solution
90 = 18 x + 12 y, for x,y  ℤ

3 ‫ ׀‬18 ⇔ t  ℤ therefore 18 = 3t

18x = (3t)x
18x = 3(tx)
3 ‫ ׀‬12 ⇔ k  ℤ therefore 12 = 3k

12y = (3k)y
12y = 3(ky)
Then sum the first and second equation, so we have
18x+12y = 3(tx)+3(ky)
90 = 3 (tx+ky)
Let, tx+ky = s, where s  ℤ, then 90 = 3s
By the definition of divisibility, we can conclude that 90 = 3s
so that 3 ‫ ׀‬90
Example 1.11 (Counterexample)

Theorem 1.6 Division algorithm

If there is a number p and q element of integer number and p is positive number, then there
are number r and s element of integer number which are single, so q is equal to rp + s, with
s is greater or equals 0 and s is less than p (0 ≤ s <p).

If p does not divide q, then s satisfies the inequality 0 <s <p.

From the statement q = rp + s, 0 ≤ s <p, r is called quotient, s is called remainder
(remainder), q is called dividend and p is called divisor.

7
Mathematical Sentences

p, q  Z ˄ p > 0, ⇒ ∃ r, s  Z ⇒ q = rp + s ∀ 0 s< p.

p∤q, ⇒ 0 < s < p.

Proving the theorem

With p, q  Z can be formed an arithmetic sequence (q - rp) with r  Z, that is

..., q - 3p, q - 2p, q - p, q, q + 2p, q + 3 p, ... ,which has a general form q - rp

Take a set of T whose elements are a non-negative sequence term, namely:

T = {q - rp | r  Z, q - rp 0}

Because T ⊂ N and N are neatly ordered sets, according to the neat order principle, T has
the smallest element, for example s.

Because s  T, then s = q - rp for an r  Z, so q = rp + s. So if p, q  Z and p> 0, then there

is r, s  Z so q = rp + s.

Until here the new evidence at the stage shows the existence of r and s. next, it will be
proved that 0 <s <p uses indirect evidence. Suppose that 0  s <p is incorrect, s <0 or s 
p.

Because s  T, then s cannot be negative, so the probability of staying s  p. s  p, then s -

p  0, so that (q - rp) - p  0 or q - (r + 1) p  0.

Because s - p  0 and s - p = q - (r + 1) p or s - p have the form q - rp, then s - p  T

Because p> 0, then s - p <s, so that s - p is a T element smaller than s. This is contrary to
taking s as the smallest element of T.

So: 0  s <p

Next, prove the unity of r and s

Hint: use indirect evidence, for example r and s are not singular, ie there are r1, r2, s1, s2
Z and:

q = r1p + s1, 0 <s1<p

8
 q = r2p + s2, 0 <s1<p

Example 1.20

There are 24 hours in one complete day. How many complete days are contained in 2500
hours?
Solution
To get the number of days in 2500 hours, we need to divide 2500 by 24. Hence, using the
division algorithm we can say that
2500 = 24 x 104 + 4
Since the quotient comes out to be 104 here, we can say that 2500 hours constitute of 104
complete days.

Example 1.21 (Counter Example)

Problem Solving

1. Prove that 5 divides (6n + 4), for every n natural number.

Answer
P (n): 5 divides 6n + 4
It will be proved that P (n) is correct for every n ∈ ℕ
Basic Steps:
It will show P (1) correctly
61 + 4 = 10, 5 divides 10
So, P (1) is correct

Induction Steps:
Assume P (k) is correct, that is
5 divides 6k + 4 , k ∈ N

It will be shown that P (k + 1) is also correct, that is

9
 5 divides 6k+1 + 4
6k+1 + 4 = 6(6k)+ 4
6k+1 + 4 = 5(6k) + 6k + 4
Because 5 divides 5 (6k) and 5 divides 6k + 4, then the result is 5 (6k) + 6k + 4 is also
divisible by 5.
So, P (k + 1) is correct.

Based on the principle of mathematical induction, it is proved that 5 divides 6n + 4 is,

for every n natural number.

2. Prove that 3 divides (n3 + 2n), for every n natural number

Answer:
P (n): n3 + 2n = 3m, with m ∈ ℤ
It will be proved that P (n) is correct for each n ∈ ℕ

Basic Steps:
It will show P (1) correctly
13 + 2.1 = 3 = 3.1
So, P (1) is correct

Induction Steps:
Assume P (k) is correct, that is
k3 + 2k = 3m, k ∈ ℕ

It will be shown that P (k + 1) is also correct, that is

(k + 1)3 + 2(k + 1) = 3p, p ∈ ℤ

(k + 1)3 + 2(k + 1) = (k3 + 3k2 + 3k + 1) + (2k + 2)

(k + 1)3 + 2(k + 1) = (k3 + 2k) + (3k2 + 3k + 3)
(k + 1)3 + 2(k + 1) = 3m + 3(k2 + k + 1)
(k + 1)3 + 2(k + 1) = 3(m + k2 + k + 1)
Because m is an integer and k is an natural number, (m + k2 + k + 1) is an integer.

10
 Suppose p = (m + k2 + k + 1), then
(k + 1)3 + 2 (k + 1) = 3p, with p ∈ ℤ
So, P (k + 1) is correct
Based on the principle of mathematical induction, it is proved that 3 divides (n3 + 2n), for
every n natural number.

3. Show that if a is an integer, then 3 divides 𝑎3 − 𝑎

Basic Step
𝑎=1
𝑎3 − 𝑎 = 1 − 1 = 0
Inductive Step
Assume 3 | (𝑎3 − 𝑎) is true for a = 2,3,4,...,k-1,k
3 | (𝑘 3 − 𝑘) ⇒ There exist x  ℤ therefore 𝑘 3 − 𝑘 = 3x

It will prove that 3 | (𝑎3 − 𝑎) hold for a=k+1

That is 3 | (𝑘 + 1)3 − (𝑘 + 1) ⇒(𝑘 + 1)3 − (𝑘 + 1) = 3𝑝, 𝑠𝑖𝑛𝑐𝑒 𝑝 ℤ

Proof
(𝑘 + 1)3 − (𝑘 + 1) = (𝑘 3 + 3𝑘 2 + 3𝑘 + 1) − (𝑘 + 1)
. = (𝑘 3 − 𝑘) + 3𝑘 2 + 3𝑘
= (𝑘 3 − 𝑘) + 3(𝑘 2 + 𝑘)
. = 3𝑥 + 3(𝑘 2 + 𝑘)

. = 3(𝑥 + 𝑘 2 + 𝑘)

Because x is an integer and k is an natural number, (x + k2 + k) is an integer.

Suppose p = (x + k2 + k ), then
(k + 1)3 + 2 (k + 1) = 3p, with p ∈ ℤ
So, 3 | (𝑎3 − 𝑎) proved

4. Denote the nth Fibonacci Number

𝑓𝑛 is even if and only if n is divisible by 3.

11
Solution : By strong induction on n.
Base Cases:
𝑓1 = 1 is odd and 3 does not divide 1.
𝑓2 = 1 is odd and 3 does not divide 2.
𝑓3 = 2 is even and 3 does divide 3.

Induction hypothesis:
Assume n ≥ 3 and for 1 ≤ k ≤ n, 𝑓𝑘 is even if and only if 3 divides k.

Proof
for k + 1: In an “if and only if” statement, there are two implications to prove.
Suppose 𝑓𝑘+1 is even. Then either 𝑓𝑘 and 𝑓𝑘−1 are both even or both odd.
They can’t both be even since 3 can’t divide 2 consecutive integers, k and k − 1
evenly. So they must both be odd. By the induction hypothesis then, 3 does not
divide k − 1 and 3 does not divide k. Thus, 3 must divide k + 1. (Since out of any
three consecutive integers, 3 divides one of them evenly.)
Now suppose that 3 divides k + 1 evenly. Then we know that 3 does not
divide k and 3 does not divide k − 1. So by the induction hypothesis, 𝑓𝑘 and 𝑓𝑘−1
are both odd. The sum of two odds is even, therefore, 𝑓𝑘+1 = 𝑓𝑘 + 𝑓𝑘−1 is even.

Based on the principle of strong mathematical induction, it is proved that 𝑓𝑛 is even if and
only if n is divisible by 3

12