MCQMediumJEE 2024Relations

JEE Mathematics 2024 Question with Solution

Let RR be a relation on Z×Z\mathbb{Z} \times \mathbb{Z} defined by (a,b)R(c,d)(a, b)R(c, d) if and only if adbcad - bc is divisible by 55. Then RR is:

  • A

    Reflexive and symmetric but not transitive

  • B

    Reflexive but neither symmetric nor transitive

  • C

    Reflexive, symmetric, and transitive

  • D

    Reflexive and transitive but not symmetric

Answer

Correct answer:A

Step-by-step solution

Standard Method

Given: A relation RR on Z×Z\mathbb{Z} \times \mathbb{Z} is defined by (a,b)R(c,d)(a,b)R(c,d) if and only if adbcad-bc is divisible by 55.

Find: Whether RR is reflexive, symmetric, and transitive.

For reflexivity, check whether (a,b)R(a,b)(a,b)R(a,b) holds for every (a,b)(a,b).

abba=0ab - ba = 0

Since 00 is divisible by 55, the relation is reflexive.

For symmetry, assume (a,b)R(c,d)(a,b)R(c,d). Then

adbcad - bc

is divisible by 55. Hence

bcad=(adbc)bc - ad = -(ad-bc)

is also divisible by 55. Therefore (c,d)R(a,b)(c,d)R(a,b), so the relation is symmetric.

For transitivity, suppose

adbc=5k1ad - bc = 5k_1

and

cfde=5k2cf - de = 5k_2

for some integers k1k_1 and k2k_2. Then

afdbcf=5k1fafd - bcf = 5k_1 f

and

bcfbde=5k2bbcf - bde = 5k_2 b

Adding,

afdbde=5(k1f+k2b)afd - bde = 5(k_1 f + k_2 b)

that is,

d(afbe)=5(k1f+k2b)d(af - be) = 5(k_1 f + k_2 b)

This does not guarantee that afbeaf - be is divisible by 55 for all integers, so transitivity does not follow.

The extracted the solution contains an internal inconsistency because one heading says option B, but both the detailed conclusion and the worked classification state reflexive and symmetric but not transitive. That classification matches option A in the given options.

Therefore, the relation is reflexive and symmetric but not transitive, so the correct option is A.

Property-wise Check

  1. Reflexive:
(a,b)R(a,b)abba=0(a,b)R(a,b) \Rightarrow ab-ba = 0

So RR is reflexive.

  1. Symmetric: If (a,b)R(c,d)(a,b)R(c,d), then adbcad-bc is divisible by 55. Hence (adbc)=bcad-(ad-bc)=bc-ad is also divisible by 55, so (c,d)R(a,b)(c,d)R(a,b). Thus RR is symmetric.

  2. Transitive: From

adbc0(mod5),cfde0(mod5)ad-bc \equiv 0 \pmod{5}, \qquad cf-de \equiv 0 \pmod{5}

it is not forced that

afbe0(mod5)af-be \equiv 0 \pmod{5}

for every choice of integers. Hence RR is not transitive.

So the relation is reflexive and symmetric but not transitive.

Common mistakes

  • Assuming symmetry fails because adbcad-bc changes sign when the ordered pairs are swapped. A change of sign does not affect divisibility by 55. Use the fact that if 5x5 \mid x, then 5(x)5 \mid (-x) as well.

  • Treating the relation as transitive just because two divisibility conditions are given. The conditions adbc0(mod5)ad-bc \equiv 0 \pmod{5} and cfde0(mod5)cf-de \equiv 0 \pmod{5} do not directly imply afbe0(mod5)af-be \equiv 0 \pmod{5}. Always check the exact target expression needed for transitivity.

  • Checking reflexivity incorrectly by substituting different ordered pairs. For reflexivity, you must test (a,b)R(a,b)(a,b)R(a,b) itself and compute abba=0ab-ba=0, not any other combination.

Practice more Relations questions

Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.

Related questions