Sign in
12thPass logo
New chatPYQ LibraryDoubtsRank report
Sign in to see Recents

Your guest activity stays on this device

Sign in to save progress →
Sign in

Sets and Relations question

2022 · 28 Jul · Shift 1 · Q29
Guest · filters and generic practice availableBrowsing as a guest · PYQ filters and generic practice are available. Sign in only for personalised features and saved progress.
  1. PYQ Library
  2. /JEE Main
  3. /Mathematics
  4. /Sets and Relations
  5. /2022 · 28 Jul · Shift 1 · Q29

Sets and Relations question

2022 · 28 Jul · Shift 1 · Q29

JEE MainMathematicsSets and RelationsMCQ+4 / −1
For α∈N\alpha \in \mathbf{N}α∈N, consider a relation R\mathrm{R}R on N\mathbf{N}N given by R={(x,y):3x+αy\mathrm{R}=\{(x, y): 3 x+\alpha yR={(x,y):3x+αy is a multiple of 7 }\}}. The relation RRR is an equivalence relation if and only if :
  1. A
    α=14\alpha=14α=14
  2. B
    α\alphaα is a multiple of 4
  3. C
    4 is the remainder when α\alphaα is divided by 10
  4. D
    4 is the remainder when α\alphaα is divided by 7
View written solutionFree

Correct answer: D

We need to determine for which values of α∈N\alpha \in \mathbf Nα∈N the relation

R={(x,y):3x+αy is a multiple of 7}R=\{(x,y): 3x+\alpha y \text{ is a multiple of }7\}R={(x,y):3x+αy is a multiple of 7}

on N\mathbf NN is an equivalence relation.

An equivalence relation must be:

  1. Reflexive
  2. Symmetric
  3. Transitive

We analyze these one by one modulo 777.


1. Rewrite the relation modulo 777

The condition 3x+αy is a multiple of 73x+\alpha y \text{ is a multiple of }73x+αy is a multiple of 7 means 3x+αy≡0(mod7).3x+\alpha y \equiv 0 \pmod 7.3x+αy≡0(mod7). So (x,y)∈R  ⟺  3x+αy≡0(mod7).(x,y)\in R \iff 3x+\alpha y\equiv 0\pmod 7.(x,y)∈R⟺3x+αy≡0(mod7).


2. Reflexivity

For reflexivity, we need (x,x)∈R(x,x)\in R(x,x)∈R for every x∈Nx\in \mathbf Nx∈N.

So: 3x+αx≡0(mod7)∀x3x+\alpha x \equiv 0 \pmod 7 \quad \forall x3x+αx≡0(mod7)∀x x(3+α)≡0(mod7)∀x.x(3+\alpha)\equiv 0 \pmod 7 \quad \forall x.x(3+α)≡0(mod7)∀x. For this to hold for all natural numbers xxx, we must have 3+α≡0(mod7).3+\alpha \equiv 0 \pmod 7.3+α≡0(mod7). Hence, α≡−3≡4(mod7).\alpha \equiv -3 \equiv 4 \pmod 7.α≡−3≡4(mod7).

So reflexivity requires α≡4(mod7).\boxed{\alpha \equiv 4 \pmod 7}.α≡4(mod7)​.


3. Symmetry

Assume (x,y)∈R(x,y)\in R(x,y)∈R. Then 3x+αy≡0(mod7).3x+\alpha y \equiv 0 \pmod 7.3x+αy≡0(mod7). For symmetry, we must also have (y,x)∈R(y,x)\in R(y,x)∈R, i.e. 3y+αx≡0(mod7).3y+\alpha x \equiv 0 \pmod 7.3y+αx≡0(mod7).

Now from reflexivity condition, let α≡4(mod7).\alpha \equiv 4 \pmod 7.α≡4(mod7). Then the relation becomes 3x+4y≡0(mod7).3x+4y\equiv 0 \pmod 7.3x+4y≡0(mod7). But since 4≡−3(mod7)4\equiv -3 \pmod 74≡−3(mod7), 3x+4y≡3x−3y=3(x−y)(mod7).3x+4y \equiv 3x-3y = 3(x-y) \pmod 7.3x+4y≡3x−3y=3(x−y)(mod7). So (x,y)∈R  ⟺  3(x−y)≡0(mod7).(x,y)\in R \iff 3(x-y)\equiv 0 \pmod 7.(x,y)∈R⟺3(x−y)≡0(mod7). Since 333 is invertible modulo 777, x−y≡0(mod7),x-y\equiv 0 \pmod 7,x−y≡0(mod7), i.e. x≡y(mod7).x\equiv y \pmod 7.x≡y(mod7). This is clearly symmetric.

So symmetry holds when α≡4(mod7)\alpha\equiv 4\pmod 7α≡4(mod7).


4. Transitivity

Again, with α≡4(mod7)\alpha\equiv 4\pmod 7α≡4(mod7), we found (x,y)∈R  ⟺  x≡y(mod7).(x,y)\in R \iff x\equiv y \pmod 7.(x,y)∈R⟺x≡y(mod7). Congruence modulo 777 is transitive. Hence transitivity also holds.


5. Necessity and sufficiency

We have shown:

  • Reflexivity forces α≡4(mod7)\alpha\equiv 4\pmod 7α≡4(mod7).
  • For this value, the relation becomes x≡y(mod7)x\equiv y\pmod 7x≡y(mod7), which is an equivalence relation.

Therefore, R is an equivalence relation   ⟺  α≡4(mod7).R \text{ is an equivalence relation } \iff \alpha\equiv 4\pmod 7.R is an equivalence relation ⟺α≡4(mod7).

That means: 4 is the remainder when α is divided by 7.\boxed{\text{4 is the remainder when } \alpha \text{ is divided by }7}.4 is the remainder when α is divided by 7​.


6. Check options

  • A: α=14\alpha=14α=14
    Then α≡0(mod7)\alpha\equiv 0\pmod 7α≡0(mod7), not 444. Incorrect.

  • B: α\alphaα is a multiple of 444
    Not sufficient. Example: α=8≡1(mod7)\alpha=8\equiv 1\pmod 7α=8≡1(mod7), fails. Incorrect.

  • C: 444 is the remainder when α\alphaα is divided by 101010
    This means α≡4(mod10)\alpha\equiv 4\pmod{10}α≡4(mod10), which does not necessarily imply α≡4(mod7)\alpha\equiv 4\pmod 7α≡4(mod7). Incorrect.

  • D: 444 is the remainder when α\alphaα is divided by 777
    Exactly the required condition. Correct.


Final Answer

The relation is an equivalence relation if and only if α≡4(mod7).\boxed{\alpha\equiv 4\pmod 7}.α≡4(mod7)​. Hence the correct option is D.\boxed{\text{D}}.D​.

PreviousNext

More from Sets and Relations

  • Let R1 and R2 be relations on the set {1, 2, ......., 50} such that R1 = {(p, pn) : p is a prime and n ≥ 0 is an integer} and R2 = {(p, pn) : p is a prime and n = 0 or 1}. Then, the number of elements in R1 − R2 is ​…2022 · Numerical
  • Let R1 = {(a, b) ∈ N × N : |a − b|≤ 13} and R2 = {(a, b) ∈ N × N : |a − b|e 13}. Then on N :2022 · MCQ
  • Let R be a relation from the set {1,2,3,…,60} to itself such that R={(a,b):b=pq, where p,q⩾3 are prime numbers}. Then, the number of elements in R is :2022 · MCQ
  • Let S={4,6,9} and T={9,10,11,…,1000}. If A={a1​+a2​+…+ak​:k∈N,a1​,a2​,a3​,…,ak​ ϵS}, then the sum of all the elements in the set T−A is equal to ​…2022 · Numerical
  • Let a set A = A1 ∪ A2 ∪..... ∪ Ak, where Ai ∩ Aj =ϕ for i e j, 1 ≤ j, j ≤ k. Define the relation R from A to A by R = {(x, y) : y ∈ Ai if and only if x ∈ Ai, 1 ≤ i ≤ k}. Then, R is :2022 · MCQ
  • The number of elements in the set {x ∈ R : (|x|− 3) |x + 4| = 6} is equal to :2021 · MCQ
  • Let A = {2, 3, 4, 5, ....., 30} and '≃' be an equivalence relation on A × A, defined by (a, b) ≃ (c, d), if and only if ad = bc. Then the number of ordered pairs which satisfy this equivalence relation with ordered…2021 · MCQ
  • In a school, there are three types of games to be played. Some of the students play two types of games, but none play all the three games. Which Venn diagrams can justify the above statement? Includes diagram2021 · MCQ