Given: A relation R on Z×Z is defined by (a,b)R(c,d) if and only if ad−bc is divisible by 5.
Find: Whether R is reflexive, symmetric, and transitive.
For reflexivity, check whether (a,b)R(a,b) holds for every (a,b).
ab−ba=0
Since 0 is divisible by 5, the relation is reflexive.
For symmetry, assume (a,b)R(c,d). Then
ad−bc
is divisible by 5. Hence
bc−ad=−(ad−bc)
is also divisible by 5. Therefore (c,d)R(a,b), so the relation is symmetric.
For transitivity, suppose
ad−bc=5k1
and
cf−de=5k2
for some integers k1 and k2. Then
afd−bcf=5k1f
and
bcf−bde=5k2b
Adding,
afd−bde=5(k1f+k2b)
that is,
d(af−be)=5(k1f+k2b)
This does not guarantee that af−be is divisible by 5 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.