The Group of Integer modulo 𝑛

In this module we are going to see about integer modulo 𝑛.

Definition: A relation ~ is an equivalence relation on a set 𝐴 if it satisfies the following

properties,
 Reflexive : 𝑎 ~ 𝑎 for all 𝑎 ∈ 𝐴
 Symmetry : If 𝑎 ~ 𝑏 then 𝑏 ~ 𝑎, for all 𝑎, 𝑏 ∈ 𝐴
 Transitivity : 𝑎 ~𝑏 𝑎𝑛𝑑 𝑏 ~ 𝑐 then 𝑎 ~ 𝑐 for all 𝑎, 𝑏, 𝑐 ∈ 𝐴.

Examples:
 Equality ( = ) is an equivalence relation.
 Let 𝐴 be the set of all vectors in ℝ2 . If 𝑎, 𝑏 ∈ 𝐴, define 𝑎 ∼ 𝑏 to mean that 𝑎 and
𝑏 have the same length. ~ is an equivalence relation.
 For 𝑥, 𝑦 ∈ 𝑅 define 𝑥 ~ 𝑦 to mean that 𝑥 − 𝑦 ∈ ℤ.
Reflexive – Let 𝑥 ∈ ℝ. Then 𝑥 − 𝑥 = 0 and 0 ∈ ℤ.
Symmetric – Let 𝑎, 𝑏 ∈ ℝ. Suppose 𝑎 ~ 𝑏 ⇒ 𝑎 − 𝑏 ∈ ℤ. Then 𝑏 − 𝑎 =
−(𝑎 − 𝑏) ∈ ℤ. Thus, 𝑏 ~ 𝑎.
Transitive – Let 𝑎, 𝑏, 𝑐 ∈ ℝ. Suppose that 𝑎 ~ 𝑏 and 𝑏 ~ 𝑐. Thus 𝑎 − 𝑏 ∈ ℤ,
and 𝑏 − 𝑐 ∈ ℤ. Then 𝑎 − 𝑐 = (𝑎 − 𝑏) + (𝑏 − 𝑐). That is, 𝑎 − 𝑐 ∈ ℤ.
Therefore 𝑎 ~ 𝑐.
It now follows from Definition that ~ is an equivalence relation on the set ℝ.

Definition: If ~ is an equivalence relation defined on the set 𝐴 and 𝑎 ∈ 𝐴, let [𝑎] =

{𝑥 ∈ 𝐴 ∶ 𝑎 ~ 𝑥}, called the equivalence class corresponding to a.

Example:
 If 𝐴 is ℤ and ~ is congruent modulo 6, then [2] = { . . . , −10, −4, 2, 8, . . . }

Definition of Congruent modulo n:

Let 𝑛 be a positive integer. For integers 𝑎 and 𝑏 we say that 𝑎 is congruent to 𝑏
modulo 𝑛, and write 𝑎 ≡ 𝑏 (𝑚𝑜𝑑 𝑛), provided 𝑎 − 𝑏 is divisible by 𝑛.

Theorem: Congruent modulo 𝑛 is an equivalence relation on ℤ.

Proof: Let 𝑛 be a fixed integer. Define relation on ℤ by 𝑎 ~ 𝑏 if and only if 𝑛 | (𝑏 – 𝑎).

Clearly, 𝑎 ~ 𝑎 since 𝑛 divides 0 and 𝑎 ~ 𝑏 implies 𝑏 ~ 𝑎 for any integers 𝑎 and 𝑏, so
this relation is trivially reflexive and symmetric. If 𝑎 ~ 𝑏 and 𝑏 ~ 𝑐 then 𝑛 divides
𝑎 − 𝑏 and 𝑛 divides 𝑏 − 𝑐. So, 𝑛 also divides the sum of these two integers. That is,
(𝑎 − 𝑏) + (𝑏 − 𝑐) = 𝑎 − 𝑐, so 𝑎 ~ 𝑐 and the relation is transitive. Hence, this relation
is an equivalence relation.

Definition of congruent class of modulo 𝑛:

[𝑎]𝑛 = { 𝑏 ∈ ℤ |𝑏 ≡ 𝑎 (𝑚𝑜𝑑 𝑛) }
= {𝑏 ∈ ℤ|𝑛|𝑏– 𝑎}
= { 𝑏 ∈ ℤ |𝑏 − 𝑎 = 𝑞𝑛 𝑓𝑜𝑟 𝑠𝑜𝑚𝑒 𝑞 ∈ ℤ }
= { 𝑏 ∈ ℤ |𝑏 = 𝑎 + 𝑞𝑛 𝑓𝑜𝑟 𝑠𝑜𝑚𝑒 𝑞 ∈ ℤ }
= { 𝑎 + 𝑞𝑛 |𝑞 ∈ ℤ }
Integer Modulo 𝑛:
The integers modulo 𝑛, is a set of all congruence classes modulo 𝑛. In symbols,
ℤ𝑛 = {[𝑎]𝑛 |𝑎 ∈ ℤ } = { [0]𝑛 , [1]𝑛 , . . . , [𝑛 − 1]𝑛 }.

Example:
ℤ3 = { [0]3 , [1]3 , [2]3 } has exactly three elements. On the other hand, every integer
is in one of the three classes, [0]3 , [1]3 𝑜𝑟 [2]3 , depending on its remainder upon
dividing by 3.
[0]3 = {… , −6, −3, 0, 3, 6, … }
[1]3 = {… , −5, −2, 1, 4, 7, … }
[2]3 = {… , −4, −1,2,5,8, … }

Arithmetic Operation on ℤ𝑛 :
(a) Addition is defined as, [𝑎]𝑛 + [𝑏]𝑛 = [𝑎 + 𝑏]𝑛
(b) Multiplication is defined as, [𝑎]𝑛 . [𝑏]𝑛 = [𝑎𝑏]𝑛
Example: Let 𝑛 = 8. Consider the sum of [10]8 + [−17]8 = [10 + (−17)]8.
Since, [10]8 = [2]8 𝑎𝑛𝑑 [−17]8 = [7]8 then [10]8 + [−17]8 = [9]8 = [1]8 , as well
as [10 + (−17)]8 = [−7]8 = [1]8 .

Theorem: ℤ𝑛 is an abelian group under addition.

Proof:
 Let [𝑎]𝑛 , [𝑏]𝑛 ∈ ℤ𝑛 then [𝑎]𝑛 + [𝑏]𝑛 = [𝑎 + 𝑏]𝑛 ∈ ℤ𝑛 . That is, if 𝑛 divides 𝑎
and 𝑛 divides 𝑏 implies 𝑛 divides sum of 𝑎 𝑎𝑛𝑑 𝑏. Hence, ℤ𝑛 closed under
addition.
 Let [𝑎]𝑛 , [𝑏]𝑛 , [𝑐]𝑛 ∈ ℤ𝑛 then
[𝑎]𝑛 + ([𝑏]𝑛 + [𝑐]𝑛 ) = [𝑎]𝑛 + [𝑏 + 𝑐]𝑛
= [𝑎 + (𝑏 + 𝑐)]𝑛
= [(𝑎 + 𝑏) + 𝑐]𝑛
= [𝑎 + 𝑏]𝑛 + [𝑐]𝑛
= ([𝑎]𝑛 + [𝑏]𝑛 ) + [𝑐]𝑛 . Hence associativity also hold.
 Clearly, [𝑎]𝑛 ∈ ℤ𝑛 then there exist [0]𝑛 ∈ ℤ𝑛 such that [𝑎]𝑛 + [0]𝑛 = [𝑎]𝑛 .
Hence, [0]𝑛 is the identity for ℤ𝑛 .
 Similarly, [𝑎]𝑛 + [−𝑎]𝑛 = [0]𝑛 . Hence, inverse also exist.
 [𝑎]𝑛 + [𝑏]𝑛 = [𝑎 + 𝑏]𝑛 = [𝑏]𝑛 + [𝑎]𝑛 . Commutative property also holds for
[𝑎]𝑛 , [𝑏]𝑛 ∈ ℤ𝑛 .
Hence, ℤ𝑛 is an abelian group under addition.

Example:
1. Consider the Cayley table for ℤ4 under addition.

⨁ [0] [1] [2] [3]

[0] [0] [1] [2] [3]
[1] [1] [2] [3] [0]
[2] [2] [3] [0] [1]
[3] [3] [0] [1] [2]

From the Cayley table we can easily identify that ℤ4 is an abelian group.
2. Verify ℤ4 is group under multiplication.
 Cayley table for ℤ4 under multiplication.

⨀ [0] [1] [2] [3]

[0] [0] [0] [0] [0]
[1] [0] [1] [2] [3]
[2] [0] [2] [0] [2]
[3] [0] [3] [2] [1]

Note that no element in ℤ4 satisfy the equation [𝑥] ⨀ [0] = [1]. That is, [0] has
no multiplicative inverse. Hence, ℤ4 is not a group under multiplication.
You might suspect that by removing the zero elements, the set ℤ∗𝑛 = {[1], [2],· · ·
, [𝑛 − 1]} with ⨀ might be a group. Unfortunately, this is true for some values of
𝑛 but not for all 𝑛 as shown in the following two examples.
Example: ℤ∗6 is not a group with respect to ⨀ . Since ℤ∗6 is not closed under ⨀.
Indeed, [2]⨀[3] = [0] ∉ ℤ6∗ .

Example: Consider the Cayley table for ℤ∗5 with respect to ⨀.

⨀ [1] [2] [3] [4]

[1] [1] [2] [3] [4]
[2] [2] [4] [1] [3]
[3] [3] [1] [4] [2]
[4] [4] [3] [2] [1]

Thus, [1]−1 = [1], [2]−1 = [3], [3]−1 = [2], 𝑎𝑛𝑑 [4]−1 = [4].

Result: If 𝑎 and 𝑏 are integers, not both zero, then (𝑎, 𝑏) = 1 if and only if 𝑚𝑎 +
𝑛𝑏 = 1 for some integers 𝑚 and 𝑛.

Result: [𝑎] ∈ ℤ𝑛 has a multiplicative inverse if and only if (𝑎, 𝑛) = 1.

Proof: Suppose first that [𝑎] has a multiplicative inverse [𝑏] in ℤ𝑛 . Then [𝑎] ⨀[𝑏] =
[𝑎𝑏] = [1]. This implies that 𝑎𝑏 ≡ 1(𝑚𝑜𝑑 𝑛). Therefore, 𝑎𝑏 = 𝑛𝑞 + 1 for some
integer 𝑞. This last equality can be written in the form 𝑏𝑎 + (−𝑞)𝑛 = 1. Suppose
that 𝑑 = (𝑎, 𝑛). If 𝑑 divides 𝑎 and 𝑛 implies 𝑑 divides 𝑏𝑎 and (−𝑞)𝑛 as well as their
sum, which implies 𝑑|1. Since, 1|𝑑 then, 𝑑 = (𝑎, 𝑛) = 1.
Conversely, suppose that (𝑎, 𝑛) = 1. Then, there exist integers 𝑚 and 𝑞 such that
𝑚𝑎 + 𝑞𝑛 = 1. Thus, 𝑚𝑎 − 1 = (−𝑞)𝑛 and hence 𝑚𝑎 ≡ 1(𝑚𝑜𝑑 𝑛). In terms of ⨀,
we have [𝑚] ⨀ [𝑎] = [1]. Thus, [𝑎] has a multiplicative inverse in ℤ𝑛 .

Theorem: Every nonzero element of ℤ𝑛 has a multiplicative inverse if and only if 𝑛 is

a prime number. That is, (ℤ∗𝑛 , ⨀) is a group if and only if 𝑛 is prime.

Proof: Suppose first that [𝑎] has a multiplicative inverse for all 1 ≤ 𝑎 < 𝑛. Then by
previous theorem, we know (𝑎, 𝑛) = 1 𝑓𝑜𝑟 1 ≤ 𝑎 < 𝑛. This is true only if
𝑛 𝑖𝑠 𝑝𝑟𝑖𝑚𝑒.
Conversely, suppose that 𝑛 is prime then (𝑎, 𝑛) = 1 for every 1 ≤ 𝑎 < 𝑛. By
previous theorem, we know already [𝑎] has a multiplicative inverse for all 1 ≤ 𝑎 <
𝑛. Hence proved.

Theorem: For each positive integer 𝑛 let 𝑈𝑛 = {[𝑘] ∶ 1 ≤ 𝑘 < 𝑛 𝑎𝑛𝑑 𝑔𝑐𝑑(𝑘, 𝑛) =
1}. Then (𝑈𝑛 , ⨀) is an Abelian group.

Proof: We will show that 𝑈𝑛 is a subgroup of ℤ∗𝑛 . Since [1] ∈ 𝑈𝑛 then 𝑈𝑛 ≠ ∅. Now,
let [𝑎], [𝑏] ∈ 𝑈𝑛 . We will show that [𝑎]⨀[𝑏] ∈ 𝑈𝑛 . Since, [𝑎], [𝑏] ∈ 𝑈𝑛 then
𝑔𝑐𝑑(𝑎, 𝑛) = 1 and 𝑔𝑐𝑑(𝑏, 𝑛) = 1. Then, there exist integers 𝑟, 𝑠, 𝑡, 𝑢 such that
𝑎𝑟 + 𝑛𝑠 = 1 and 𝑏𝑡 + 𝑛𝑢 = 1. Thus, (𝑎𝑟 + 𝑛𝑠)(𝑏𝑡 + 𝑛𝑢) = 1 or 𝑎𝑏(𝑟𝑡) +
𝑛(𝑎𝑟𝑢 + 𝑠𝑏𝑡 + 𝑛𝑠𝑢) = 1. By previous result, 𝑔𝑐𝑑(𝑎𝑏, 𝑛) = 1. Thus, [𝑎]⨀[𝑏] =
[𝑎𝑏] ∈ 𝑈𝑛 .
Next, we will show that every element [𝑎] ∈ 𝑈𝑛 is invertible. Indeed, since [𝑎] ∈ 𝑈𝑛
then 𝑔𝑐𝑑(𝑎, 𝑛) = 1. Then, by previous result there exist integers 𝑟 and 𝑠 such that
𝑎𝑟 + 𝑛𝑠 = 1. Thus, 𝑎𝑟 − 1 = 𝑛(−𝑠) and this implies that 𝑎𝑟 ≡ 1(𝑚𝑜𝑑 𝑛). Hence,
[𝑎]⨀[𝑟] = [1] and so [𝑎] is invertible. Since, every element [𝑎] ∈ 𝑈𝑛 has inverse as
well as closed under ⨀ implies 𝑈𝑛 is a subgroup and hence a group. Since (ℤ∗𝑛 , ⨀)
is an abelian group so, (𝑈𝑛 , ⨀).