The relation "congruence modulo m" is: | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(D) Let $R$ be the relation defined on the set of integers $\mathbb{Z}$ such that $aRb$ if and only if $a \equiv b \pmod{m}$,which means $a - b$ is di

Vedclass · Accepted Answer

An equivalence relation

Vedclass · Answer

(D) Let $R$ be the relation defined on the set of integers $\mathbb{Z}$ such that $aRb$ if and only if $a \equiv b \pmod{m}$,which means $a - b$ is divisible by $m$.$1$. Reflexivity: For any $a \in \mathbb{Z}$,$a - a = 0$,which is divisible by $m$. Thus,$aRa$ holds.$2$. Symmetry: If $aRb$,then $a - b = km$ for some integer $k$. Then $b - a = -(km) = (-k)m$. Since $-k$ is an integer,$bRa$ holds.$3$. Transitivity: If $aRb$ and $bRc$,then $a - b = km$ and $b - c = lm$ for some integers $k, l$. Adding these,$a - c = (k + l)m$. Since $k + l$ is an integer,$aRc$ holds.Since the relation is reflexive,symmetric,and transitive,it is an equivalence relation.

The relation "congruence modulo $m$" is:

Similar Questions

Let $R$ be a relation defined on $N$ such that $a R b$ if $2a + 3b$ is a multiple of $5$,where $a, b \in N$. Then $R$ is

Let $A$ be the non-void set of the children in a family. The relation '$x$ is a brother of $y$' on $A$ is

Show that the number of equivalence relations on the set $A = \{1, 2, 3\}$ containing $(1, 2)$ and $(2, 1)$ is $2$.

Show that the relation $R$ in the set $A = \{x \in Z : 0 \leq x \leq 12\},$ given by $R = \{(a, b) : |a - b| \text{ is a multiple of } 4\},$ is an equivalence relation. Find the set of all elements related to $1$.

On $R$, the relation $\rho$ is defined by '$x \rho y$ holds if and only if $x-y$ is zero or irrational'. Then,

Vedclass Test Series

Exam Paper Generator

Online Exam Module