The relation R on Z×Z is defined by (a,b)R(c,d) if and only if ad−bc is divisible by 5.
Check Reflexivity.
(a,b)R(a,b)⟺ab−ba=0 is divisible by 5. ✓
R is reflexive.
Check Symmetry.
If (a,b)R(c,d), then 5∣(ad−bc).
We need to check: is 5∣(cb−da)?
cb−da=−(ad−bc). Since 5∣(ad−bc), we have 5∣(−(ad−bc))=cb−da. ✓
R is symmetric.
Check Transitivity.
We need: if (a,b)R(c,d) and (c,d)R(e,f), then (a,b)R(e,f).
Given: 5∣(ad−bc) and 5∣(cf−de).
Need to show: 5∣(af−be).
Counterexample:
Take (a,b)=(1,1), (c,d)=(5,5), (e,f)=(1,2).
Check (1,1)R(5,5): ad−bc=1⋅5−1⋅5=0. Divisible by 5. ✓
Check (5,5)R(1,2): cf−de=5⋅2−5⋅1=5. Divisible by 5. ✓
Check (1,1)R(1,2): af−be=1⋅2−1⋅1=1. NOT divisible by 5. ×
So transitivity fails.
R is reflexive and symmetric but not transitive.
The correct answer is Option (1): Reflexive and symmetric but not transitive.