The rule is: (a,b)R(c,d) means ad=bc. We verify the three properties.
Reflexive. Let (a,b)∈N×N. Multiplication of natural numbers is commutative, so
ab=ba.
Reading this against the definition with (c,d)=(a,b) — the condition is "first times second-of-the-other equals second times first-of-the-other" — it says precisely (a,b)R(a,b). Hence R is reflexive.
Symmetric. Let (a,b),(c,d)∈N×N with (a,b)R(c,d), so
ad=bc.
What has to be shown is (c,d)R(a,b), that is, cb=da. Using commutativity twice,
cb=bc=ad=da.
So cb=da, which is exactly (c,d)R(a,b). Hence R is symmetric.
Transitive. Let (a,b),(c,d),(e,f)∈N×N with (a,b)R(c,d) and (c,d)R(e,f). Then
ad=bc…(i)
cf=de…(ii)
Multiplying (i) and (ii) side by side,
(ad)(cf)=(bc)(de)⇒acdf=bcde⇒(cd)(af)=(cd)(be).
Since c,d∈N, neither of them is zero, so cd=0 and we may cancel the common factor cd:
af=be.
This is exactly the condition for (a,b)R(e,f). Hence R is transitive.
Since R is reflexive, symmetric and transitive, R is an equivalence relation on N×N.
(What the relation is really saying: ad=bc is the same as ba=dc, so two pairs are related exactly when they represent the same fraction. The class of (1,2) is {(1,2),(2,4),(3,6),(4,8),…}.)