Teori Bilangan

Congruences

Nanang Susyanto

PEMBINAAN TAHAP I CALON PESERTA IMO 2019

8 Oktober 2018

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 1 / 18

Definition

Let m be a positive integer. We say that a is congruent to b modulo m

if m | (a b ) where a and b are integers, i.e. if a = b + km where
k 2 Z. If a is congruent to b modulo m, we write a ⌘ b (mod m ).

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 2 / 18

Properties

If a ⌘ b (mod m ), then b ⌘ a(mod m ).

If a ⌘ b (mod m ) and b ⌘ c (mod m ), then a ⌘ c (mod m ).
If a ⌘ b (mod m ), then a + c ⌘ b + c (mod m ).
If a ⌘ b (mod m ), then a c ⌘ b c (mod m ).
If a ⌘ b (mod m ), then ac ⌘ bc (mod m ).
If a ⌘ b (mod m ), then ac ⌘ bc (mod mc ), for c > 0.
If a ⌘ b (mod m ) and c ⌘ d (mod m ) then
a + c ⌘ (b + d )(mod m ).
If a ⌘ b (mod m ) and c ⌘ d (mod m ) then
a c ⌘ (b d )(mod m ).
If a ⌘ b (mod m ) and c ⌘ d (mod m ) then ac ⌘ bd (mod m ).
NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 3 / 18
Examples

Because 14 ⌘ 8(mod 6) then 8 ⌘ 14(mod 6).

Because 22 ⌘ 10(mod 6) and 10 ⌘ 4(mod 6). Notice that
22 ⌘ 4(mod 6).
Because 50 ⌘ 20(mod 15), then
50 + 5 = 55 ⌘ 20 + 5 = 25(mod 15).
Because 50 ⌘ 20(mod 15), then
50 5 = 45 ⌘ 20 5 = 15(mod 15).
Because 19 ⌘ 16(mod3), then
2(19) = 38 ⌘ 2(16) = 32(mod 3).
Because 19 ⌘ 16(mod3), then
2(19) = 38 ⌘ 2(16) = 32(mod 2(3) = 6).
Because 19 ⌘ 3(mod 8) and 17 ⌘ 9(mod 8), then
19 + 17 = 36 ⌘ 3 + 9 = 12(mod 8).
NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 4 / 18
Theorems

If a, b, c and m are integers such that m > 0, d = (m, c ) and

ac ⌘ bc (mod m ), then a ⌘ b (mod m/d ).
If (m, c ) = 1 then a = b (mod m ) if ac ⌘ bc (mod m ).

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 5 / 18

 Residue Systems Zn

Suppose m is a positive integer. Given two integers a and b, we

see that by the division algorithm that a = bm + r where
0  r < m. We call r the least nonnegative residue of a modulo
m. As a result, we see that any integer is congruent to one of the
integers 0, 1, 2, ..., m 1 modulo m.
 Residue Systems Zn

Suppose m is a positive integer. Given two integers a and b, we

see that by the division algorithm that a = bm + r where
0  r < m. We call r the least nonnegative residue of a modulo
m. As a result, we see that any integer is congruent to one of the
integers 0, 1, 2, ..., m 1 modulo m.
 Residue Systems Zn

Suppose m is a positive integer. Given two integers a and b, we

see that by the division algorithm that a = bm + r where
0  r < m. We call r the least nonnegative residue of a modulo
m. As a result, we see that any integer is congruent to one of the
integers 0, 1, 2, ..., m 1 modulo m.

Definition
A complete residue system modulo m is a set of integers such that
every integer is congruent modulo m to exactly one integer of the set.
 Residue Systems Zn

Suppose m is a positive integer. Given two integers a and b, we

see that by the division algorithm that a = bm + r where
0  r < m. We call r the least nonnegative residue of a modulo
m. As a result, we see that any integer is congruent to one of the
integers 0, 1, 2, ..., m 1 modulo m.

Definition
A complete residue system modulo m is a set of integers such that
every integer is congruent modulo m to exactly one integer of the set.

The easiest complete residue system modulo m is the set of

integers 0, 1, 2, ..., m 1. Every integer is congruent to one of
these integers modulo m.
Reduced Residue System Zn⇤

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 7 / 18

Reduced Residue System Zn⇤

Definition
A reduced residue system modulo m is a set of integers ri such that
(ri , m ) = 1 for all i and ri 6= rj (mod m ) if i 6= j.

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 7 / 18

Reduced Residue System Zn⇤

Definition
A reduced residue system modulo m is a set of integers ri such that
(ri , m ) = 1 for all i and ri 6= rj (mod m ) if i 6= j.

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 7 / 18

Reduced Residue System Zn⇤

Definition
A reduced residue system modulo m is a set of integers ri such that
(ri , m ) = 1 for all i and ri 6= rj (mod m ) if i 6= j.

Theorem
If a1 , a2 , ..., am is a complete residue system modulo m, and if k is a
positive integer with (k , m ) = 1, then

ka1 + b, ka2 + b, ..., kam + b

is another complete residue system modulo m for any integer b.

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 7 / 18
Euler’s f-Function

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 8 / 18

Euler’s f-Function

Definition
The Euler f-function of a positive integer n, denoted by f(n) counts the
number of positive integers less than n that are relatively prime to n.

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 8 / 18

Euler’s f-Function

Definition
The Euler f-function of a positive integer n, denoted by f(n) counts the
number of positive integers less than n that are relatively prime to n.

f(n) = |Zn⇤ | and f(p ) = p 1 for every prime p.

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 8 / 18

Euler’s f-Function

Definition
The Euler f-function of a positive integer n, denoted by f(n) counts the
number of positive integers less than n that are relatively prime to n.

f(n) = |Zn⇤ | and f(p ) = p 1 for every prime p.

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 8 / 18

Euler’s f-Function

Definition
The Euler f-function of a positive integer n, denoted by f(n) counts the
number of positive integers less than n that are relatively prime to n.

f(n) = |Zn⇤ | and f(p ) = p 1 for every prime p.

Theorem
If a1 , a2 , ..., af(n) is a reduced residue system modulo n and (k, n) = 1,
then ka1 , ka2 , ..., kaf(n) is a reduced residue system modulo n.

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 8 / 18

Linear Congruences

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 9 / 18

Linear Congruences

Definition
A congruence of the form ax ⌘ b (mod m ) where x is an unknown
integer is called a linear congruence in one variable.

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 9 / 18

Linear Congruences

Definition
A congruence of the form ax ⌘ b (mod m ) where x is an unknown
integer is called a linear congruence in one variable.

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 9 / 18

Linear Congruences

Definition
A congruence of the form ax ⌘ b (mod m ) where x is an unknown
integer is called a linear congruence in one variable.

Theorem
Let a, b and m be integers such that m > 0 and let c = (a, m ). If c
does not divide b, then the congruence ax ⌘ b (mod m ) has no
solutions. If c | b, then
ax ⌘ b (mod m )
has exactly c incongruent solutions modulo m.
NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 9 / 18
Modular Inverse

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 10 / 18

Modular Inverse

Definition
A solution for the congruence ax ⌘ 1(mod m ) for (a, m ) = 1 is called
the modular inverse of a modulo m. We denote such a solution by ā.

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 10 / 18

Modular Inverse

Definition
A solution for the congruence ax ⌘ 1(mod m ) for (a, m ) = 1 is called
the modular inverse of a modulo m. We denote such a solution by ā.

Example: The modular inverse of 7 modulo 48 is 7. Notice that a

solution for 7x ⌘ 1(mod 48) is x ⌘ 7(mod 48).

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 10 / 18

Wilson’s Theorem

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 11 / 18

Wilson’s Theorem

Lemma
Let p be a prime. A positive integer m is its own inverse modulo p if
and only if p divides m + 1 or p divides m 1.

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 11 / 18

Wilson’s Theorem

Lemma
Let p be a prime. A positive integer m is its own inverse modulo p if
and only if p divides m + 1 or p divides m 1.

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 11 / 18

Wilson’s Theorem

Lemma
Let p be a prime. A positive integer m is its own inverse modulo p if
and only if p divides m + 1 or p divides m 1.

Theorem
Wilson’s Theorem If p is a prime number, then p divides (p 1)! + 1.

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 11 / 18

Wilson’s Theorem

Lemma
Let p be a prime. A positive integer m is its own inverse modulo p if
and only if p divides m + 1 or p divides m 1.

Theorem
Wilson’s Theorem If p is a prime number, then p divides (p 1)! + 1.

Note also that the converse of Wilson’s theorem also holds. The
converse tells us whether an integer is prime or not.
NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 11 / 18
Euler’s Theorem

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 12 / 18

Euler’s Theorem

Theorem
Euler’s Theorem If m is a positive integer and a is an integer such that
(a, m ) = 1, then
af(m) ⌘ 1(mod m )

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 12 / 18

Euler’s Theorem

Theorem
Euler’s Theorem If m is a positive integer and a is an integer such that
(a, m ) = 1, then
af(m) ⌘ 1(mod m )

Proof:ak1 ak2 ...akf(m) = af(m) k1 k2 ...kf(m) ⌘ k1 k2 ...kf(m) (mod m ).

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 12 / 18

Euler’s Theorem

Theorem
Euler’s Theorem If m is a positive integer and a is an integer such that
(a, m ) = 1, then
af(m) ⌘ 1(mod m )

Proof:ak1 ak2 ...akf(m) = af(m) k1 k2 ...kf(m) ⌘ k1 k2 ...kf(m) (mod m ).

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 12 / 18

 I I
Euler’s Theorem

Theorem
Euler’s Theorem If m is a positive integer and a is an integer such that
(a, m ) = 1, then
af(m) ⌘ 1(mod m )

Proof:ak1 ak2 ...akf(m) = af(m) k1 k2 ...kf(m) ⌘ k1 k2 ...kf(m) (mod m ).

Corollary
Fermat’s Theorem If p is a prime and a is a positive integer with p - a,
then
ap 1 ⌘ 1(mod p ).
NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 12 / 18
 S

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 13 / 18

 S

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 14 / 18

 S

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 15 / 18

 S

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 16 / 18

 S

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 17 / 18

 S

NS (Tahap 1 IMO 2019) Teori Bilangan 08/10/2018 18 / 18