2787
268
Relations and Functions - Part 2
Report Error
Solution:
Congruence modulo: An integer ‘a’ is said to be congruent to another integer ‘b’
module ‘m’ if a - b is divisible by m and expressed as: a ≡ b (mod m)
The integer m is called the modulus of the congruence.
Now suppose a, b, c ∈ I (congruence of modulo)
Let a ≡ b (mod m)
Since a ≡ a (mod m) and o ≐ m
so the function is Reflexive.
Now if a ≡ b (mod m) then
Also b ≡ a (mod m) because (a - b) divides by m, then b - a also divides by m. Thus function is symmetric.
Now If a ≡ b (mod m) and b ≡ c (mod m) ⇒ma−b and mb−c; So ma−c ∴a≡c (mod m) thus function is Transitive.
Thus the relation is Equivalence Relation.