RankRizz
JEE MAIN 2022 · 28 JUL S1+4 / −1MEDIUMTRANSCRIBED

JEE Main 2022 Mathematics question — Reflexive, symmetric and transitive relations

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

SOLUTION

We need to find the condition on α∈N\alpha \in \mathbb{N} for the relation R={(x,y):3x+αy is a multiple of 7}R = \{(x, y) : 3x + \alpha y \text{ is a multiple of } 7\} on N\mathbb{N} to be an equivalence relation.

Step 1: Check Reflexivity.

(x,x)∈R⇔3x+αx≡0(mod7)(x, x) \in R \Leftrightarrow 3x + \alpha x \equiv 0 \pmod{7} for all x∈Nx \in \mathbb{N}

⇔(3+α)x≡0(mod7)\Leftrightarrow (3 + \alpha)x \equiv 0 \pmod{7} for all xx

This requires 3+α≡0(mod7)3 + \alpha \equiv 0 \pmod{7}, i.e., α≡4(mod7)\alpha \equiv 4 \pmod{7}.

Step 2: Check Symmetry (with α≡4(mod7)\alpha \equiv 4 \pmod 7).

If (x,y)∈R(x, y) \in R, then 3x+4y≡0(mod7)3x + 4y \equiv 0 \pmod{7} (using α≡4(mod7)\alpha \equiv 4 \pmod 7).

We need to show 3y+4x≡0(mod7)3y + 4x \equiv 0 \pmod{7}.

From 3x+4y≡0(mod7)3x + 4y \equiv 0 \pmod{7}: 3x≡−4y(mod7)3x \equiv -4y \pmod{7}.

Since 3−1≡5(mod7)3^{-1} \equiv 5 \pmod{7} (as 3×5=15≡13 \times 5 = 15 \equiv 1), we get x≡−20y≡−6y≡y(mod7)x \equiv -20y \equiv -6y \equiv y \pmod{7}.

Now: 3y+4x≡3y+4y≡7y≡0(mod7)3y + 4x \equiv 3y + 4y \equiv 7y \equiv 0 \pmod{7}. Symmetric!

Step 3: Check Transitivity.

If (x,y)∈R(x, y) \in R and (y,z)∈R(y, z) \in R:

3x+4y≡0(mod7)3x + 4y \equiv 0 \pmod{7} and 3y+4z≡0(mod7)3y + 4z \equiv 0 \pmod{7}

From above, x≡y(mod7)x \equiv y \pmod{7} and y≡z(mod7)y \equiv z \pmod{7}, so x≡z(mod7)x \equiv z \pmod{7}.

Then 3x+4z≡3z+4z=7z≡0(mod7)3x + 4z \equiv 3z + 4z = 7z \equiv 0 \pmod{7}. Transitive!

Step 4: Conclusion.

R is an equivalence relation if and only if α≡4(mod7)\alpha \equiv 4 \pmod{7}, i.e., 4 is the remainder when α\alpha is divided by 7.

The correct answer is Option D: 4 is the remainder when α\alpha is divided by 7

Tagged Reflexive, symmetric and transitive relations. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicReflexive, symmetric and transitive relations
TypeMultiple choice