Division Algorithm

Part 3.2
 Recall
Theorem: Division Algorithm
Let a be any integer and b a positive
integer. Then there exist unique integers q
and r such that
Divisibility Relation
In symbols, 𝒃ȁ𝒂
If b divides a
b is a factor of a
b is a divisor of a
a is a multiple of b.
a is divisible by b.
Illustrations
a. 𝟑ȁ𝟗
b. 𝟓ȁ𝟎
c. 𝟒ȁ𝟒
d. 𝟒 ∤ 𝟓
Example 0
The square of an integer must leave a
remainder of 0 or 1 when divided by 4.
Example 1
Prove that no number in the sequence
11, 111, 1111, 11111,… is a perfect
square.
Example 2
Prove that one of any two consecutive
integers must be even.
Example 3 (TRY)
If n is an integer not divisible by 2 or 3,
2
show that 𝑛 + 23 must be divisible by
24.
Hint: Any integer must be of the form
6k, 6k + 1, …, 6k + 5.
Example 4
Let a, b, c ∈ 𝑍. If 𝑎ȁ𝑏 and 𝑏ȁ𝑐 then 𝑎ȁ𝑐.