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

2024 · 8 Apr · Shift 2 · Q43
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. /2024 · 8 Apr · Shift 2 · Q43

Sets and Relations question

2024 · 8 Apr · Shift 2 · Q43

JEE MainMathematicsSets and RelationsMCQ+4 / −1
Let A={2,3,6,8,9,11}A=\{2,3,6,8,9,11\}A={2,3,6,8,9,11} and B={1,4,5,10,15}B=\{1,4,5,10,15\}B={1,4,5,10,15}. Let RRR be a relation on A×BA \times BA×B defined by (a,b)R(c,d)(a, b) R(c, d)(a,b)R(c,d) if and only if 3ad−7bc3 a d-7 b c3ad−7bc is an even integer. Then the relation RRR is
  1. A
    reflexive but not symmetric.
  2. B
    an equivalence relation.
  3. C
    reflexive and symmetric but not transitive.
  4. D
    transitive but not symmetric.
View written solutionFree

Correct answer: C

  1. Given relation

We have a relation RRR on the set A×BA\times BA×B, where A={2,3,6,8,9,11},B={1,4,5,10,15}.A=\{2,3,6,8,9,11\},\qquad B=\{1,4,5,10,15\}.A={2,3,6,8,9,11},B={1,4,5,10,15}.

For (a,b),(c,d)∈A×B(a,b),(c,d)\in A\times B(a,b),(c,d)∈A×B, (a,b)R(c,d)  ⟺  3ad−7bc is even.(a,b)R(c,d) \iff 3ad-7bc \text{ is even.}(a,b)R(c,d)⟺3ad−7bc is even.

We must determine whether RRR is reflexive, symmetric, transitive, etc.


  1. Simplify the condition using parity

Since we only care whether 3ad−7bc3ad-7bc3ad−7bc is even, work modulo 222.

Now, 3≡1(mod2),7≡1(mod2).3\equiv 1 \pmod 2, \qquad 7\equiv 1 \pmod 2.3≡1(mod2),7≡1(mod2). So 3ad−7bc≡ad−bc(mod2).3ad-7bc \equiv ad-bc \pmod 2.3ad−7bc≡ad−bc(mod2). But modulo 222, subtraction and addition are the same, so ad−bc≡ad+bc(mod2).ad-bc \equiv ad+bc \pmod 2.ad−bc≡ad+bc(mod2). Thus, (a,b)R(c,d)  ⟺  ad−bc≡0(mod2).(a,b)R(c,d) \iff ad-bc \equiv 0 \pmod 2.(a,b)R(c,d)⟺ad−bc≡0(mod2). Equivalently, (a,b)R(c,d)  ⟺  ad≡bc(mod2).(a,b)R(c,d) \iff ad \equiv bc \pmod 2.(a,b)R(c,d)⟺ad≡bc(mod2).

So the relation depends only on the parity of a,b,c,da,b,c,da,b,c,d.


  1. Parity structure of elements of AAA and BBB

From AAA:

  • even elements: 2,6,82,6,82,6,8
  • odd elements: 3,9,113,9,113,9,11

From BBB:

  • even elements: 4,104,104,10
  • odd elements: 1,5,151,5,151,5,15

For any pair (a,b)∈A×B(a,b)\in A\times B(a,b)∈A×B, there are four parity types:

  • (E,E)(E,E)(E,E)
  • (E,O)(E,O)(E,O)
  • (O,E)(O,E)(O,E)
  • (O,O)(O,O)(O,O)

Now compute ad≡bc(mod2)ad \equiv bc \pmod 2ad≡bc(mod2) for these types.

Let us note:

  • product is even if at least one factor is even,
  • product is odd only if both factors are odd.

  1. Check reflexivity

For reflexivity, every (a,b)(a,b)(a,b) must satisfy (a,b)R(a,b).(a,b)R(a,b).(a,b)R(a,b).

This means 3ab−7ba=(3−7)ab=−4ab,3ab-7ba = (3-7)ab = -4ab,3ab−7ba=(3−7)ab=−4ab, which is always even.

Hence RRR is reflexive.


  1. Check symmetry

Assume (a,b)R(c,d)(a,b)R(c,d)(a,b)R(c,d). Then 3ad−7bc is even.3ad-7bc \text{ is even.}3ad−7bc is even. We need to test whether (c,d)R(a,b)(c,d)R(a,b)(c,d)R(a,b) holds, i.e. whether 3cb−7da3cb-7da3cb−7da is even.

Again modulo 222, 3ad−7bc≡ad−bc≡ad+bc ( mod 2),3ad-7bc \equiv ad-bc \equiv ad+bc \, (\bmod 2),3ad−7bc≡ad−bc≡ad+bc(mod2), and 3cb−7da≡cb−da≡cb+da ( mod 2).3cb-7da \equiv cb-da \equiv cb+da \, (\bmod 2).3cb−7da≡cb−da≡cb+da(mod2). But since multiplication is commutative, cb+da=bc+ad.cb+da = bc+ad.cb+da=bc+ad. So both expressions have the same parity.

Therefore, (a,b)R(c,d)  ⟹  (c,d)R(a,b).(a,b)R(c,d) \implies (c,d)R(a,b).(a,b)R(c,d)⟹(c,d)R(a,b). Thus RRR is symmetric.


  1. Check transitivity

We must see whether (a,b)R(c,d) and (c,d)R(e,f)  ⟹  (a,b)R(e,f).(a,b)R(c,d) \text{ and } (c,d)R(e,f) \implies (a,b)R(e,f).(a,b)R(c,d) and (c,d)R(e,f)⟹(a,b)R(e,f).

We will find a counterexample.

Take: (a,b)=(2,1),(c,d)=(3,4),(e,f)=(2,5).(a,b)=(2,1),\quad (c,d)=(3,4),\quad (e,f)=(2,5).(a,b)=(2,1),(c,d)=(3,4),(e,f)=(2,5). These are all in A×BA\times BA×B since

  • 2,3∈A2,3\in A2,3∈A, 1,4,5∈B1,4,5\in B1,4,5∈B.

Now check each relation:

(i) (2,1)R(3,4)(2,1)R(3,4)(2,1)R(3,4)

3⋅2⋅4−7⋅1⋅3=24−21=3,3\cdot 2\cdot 4 - 7\cdot 1\cdot 3 = 24-21=3,3⋅2⋅4−7⋅1⋅3=24−21=3, which is odd. So this does not work.

Let us choose a better example using parity.

We want:

  • first pair related,
  • second pair related,
  • first and third not related.

Since the condition is ad≡bc(mod2)ad\equiv bc\pmod 2ad≡bc(mod2), classify by parity type:

  • (E,E)(E,E)(E,E) behaves like both products always even with many types,
  • (E,O)(E,O)(E,O) and (O,E)(O,E)(O,E) are often related,
  • (O,O)(O,O)(O,O) behaves differently.

Let us explicitly test using parity types.

For a pair (x,y)(x,y)(x,y), define:

  • xxx parity from AAA,
  • yyy parity from BBB.

The relation condition between (a,b)(a,b)(a,b) and (c,d)(c,d)(c,d) is ad≡bc(mod2).ad \equiv bc \pmod 2.ad≡bc(mod2).

Now take

  • (a,b)(a,b)(a,b) of type (E,O)(E,O)(E,O), say (2,1)(2,1)(2,1),
  • (c,d)(c,d)(c,d) of type (E,E)(E,E)(E,E), say (6,4)(6,4)(6,4),
  • (e,f)(e,f)(e,f) of type (O,E)(O,E)(O,E), say (3,4)(3,4)(3,4).

Check:

(i) (2,1)R(6,4)(2,1)R(6,4)(2,1)R(6,4)

3⋅2⋅4−7⋅1⋅6=24−42=−18,3\cdot 2\cdot 4 - 7\cdot 1\cdot 6 = 24-42=-18,3⋅2⋅4−7⋅1⋅6=24−42=−18, which is even. So (2,1)R(6,4)(2,1)R(6,4)(2,1)R(6,4) is true.

(ii) (6,4)R(3,4)(6,4)R(3,4)(6,4)R(3,4)

3⋅6⋅4−7⋅4⋅3=72−84=−12,3\cdot 6\cdot 4 - 7\cdot 4\cdot 3 = 72-84=-12,3⋅6⋅4−7⋅4⋅3=72−84=−12, which is even. So (6,4)R(3,4)(6,4)R(3,4)(6,4)R(3,4) is true.

(iii) (2,1)R(3,4)(2,1)R(3,4)(2,1)R(3,4)

3⋅2⋅4−7⋅1⋅3=24−21=3,3\cdot 2\cdot 4 - 7\cdot 1\cdot 3 = 24-21=3,3⋅2⋅4−7⋅1⋅3=24−21=3, which is odd. So (2,1)R(3,4)(2,1)R(3,4)(2,1)R(3,4) is false.

Thus, (2,1)R(6,4),(6,4)R(3,4),but (2,1)R̸(3,4).(2,1)R(6,4),\quad (6,4)R(3,4),\quad \text{but } (2,1)\not R(3,4).(2,1)R(6,4),(6,4)R(3,4),but (2,1)R(3,4).

Hence RRR is not transitive.


  1. Conclusion

We have shown:

  • RRR is reflexive,
  • RRR is symmetric,
  • RRR is not transitive.

Therefore, the correct option is C: reflexive and symmetric but not transitive.\boxed{\text{C: reflexive and symmetric but not transitive.}}C: reflexive and symmetric but not transitive.​


  1. Comparison with stored correct answer

Stored correct answer: C\text{C}C.

This matches our derived answer.

PreviousNext

More from Sets and Relations

  • Let A={2,3,6,7} and B={4,5,6,8}. Let R be a relation defined on A×B by (a1​,b1​)R(a2​,b2​) if and only if a1​+a2​=b1​+b2​. Then the number of elements in R is ​.2024 · Numerical
  • Let S={1,2,3,…,10}. Suppose M is the set of all the subsets of S, then the relation R={(A,B):A∩Beqϕ;A,B∈M} is :2024 · MCQ
  • Let A and B be two finite sets with m and n elements respectively. The total number of subsets of the set A is 56 more than the total number of subsets of B. Then the distance of the point P(m,n) from the point Q(−2,−3) is…2024 · MCQ
  • Let R be a relation on Z×Z defined by (a,b)R(c,d) if and only if ad−bc is divisible by 5. Then R is2024 · MCQ
  • If R is the smallest equivalence relation on the set {1,2,3,4} such that {(1,2),(1,3)}⊂R, then the number of elements in R is ​.2024 · MCQ
  • The number of symmetric relations defined on the set {1,2,3,4} which are not reflexive is ​.2024 · Numerical
  • Let A={1,2,3,4} and R={(1,2),(2,3),(1,4)} be a relation on A. Let S be the equivalence relation on A such that R⊂S and the number of elements in S is n. Then, the…2024 · Numerical
  • Let A={1,2,3,…………,100}. Let R be a relation on A defined by (x,y)∈R if and only if 2x=3y. Let R1​ be a symmetric relation on A such that R⊂R1​ and the number of elements in…2024 · Numerical