For alpha in N,consider a relation R on N giv | vedclass

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

Question

(D) For $R$ to be reflexive,$xRx$ must hold for all $x \in N$. $3x + \alpha x = (3 + \alpha)x$ must be a multiple of $7$. This implies $(3 + \alpha)$

Vedclass · Accepted Answer

$4$ is the remainder when $\alpha$ is divided by $7$

Vedclass · Answer

(D) For $R$ to be reflexive,$xRx$ must hold for all $x \in N$. $3x + \alpha x = (3 + \alpha)x$ must be a multiple of $7$. This implies $(3 + \alpha)$ must be a multiple of $7$,so $3 + \alpha = 7k \Rightarrow \alpha = 7k - 3 = 7(k-1) + 4$. Thus,when $\alpha$ is divided by $7$,the remainder is $4$. For $R$ to be symmetric,$xRy \Rightarrow yRx$. $3x + \alpha y = 7n_1$ and $3y + \alpha x = 7n_2$. Subtracting these,$(3 - \alpha)(x - y) = 7(n_1 - n_2)$. This condition is satisfied if $3 + \alpha$ is a multiple of $7$. For $R$ to be transitive,$xRy$ and $yRz \Rightarrow xRz$. $3x + \alpha y = 7n_1$ and $3y + \alpha z = 7n_2$. From the first,$\alpha y = 7n_1 - 3x$. Substituting into the second: $3y + \alpha z = 7n_2$. By eliminating $y$,we find that the relation is transitive if $3 + \alpha$ is a multiple of $7$. Therefore,the condition for $R$ to be an equivalence relation is that $4$ is the remainder when $\alpha$ is divided by $7$.

For $\alpha \in N$,consider a relation $R$ on $N$ given by $R = \{(x, y) : 3x + \alpha y \text{ is a multiple of } 7\}$. The relation $R$ is an equivalence relation if and only if:

Similar Questions

If $A = \{x \in Z^+ : x < 10\}$ and $x$ is a multiple of $3$ or $4$,where $Z^+$ is the set of positive integers,then the total number of symmetric relations on $A$ is

$R = \{(\pi, \pi), (\pi^2, \pi^2), (\pi^3, \pi^3), (\pi, \pi^2), (\pi^2, \pi^3)\}$ is defined on the set $A = \{\pi, \pi^2, \pi^3\}$. Then $R$ is . . . . . . .

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

Let $A = \{1, 2, 3, 4\}$ and $R = \{(1, 2), (2, 3), (1, 4)\}$ be a relation on $A$. Let $S$ be the smallest equivalence relation on $A$ such that $R \subset S$. If the number of elements in $S$ is $n$,then the value of $n$ is:

Vedclass Test Series

Exam Paper Generator

Online Exam Module