The correct option is D (a, b) R (c, d) ⇔ (b + c) = ad (a + d)
Let (a, b), (c, d) ϵ N × N.
The relation R defined by (a, b) R (c, d)
⇔ a + d = b + c is an equivalence relation.
The relation R defined by (a, b) R (c, d)
⇔ ad = bc is equivalence relation.
Let R = {((a, b), (c, d)) : ad (b + c)= bc (a + b), (a, b), (c, d) ϵ N × N}
Ad (b+c) = bc (a+b) \(\Leftrightarrow \frac{b+c}{bc}=\frac{a+d}{ad}\)
⇔1c+1b=1d+⇔1a−1b=1c−1d
Let (a,b) ϵ N × N
We have, 1a−1b=1a−1b
∴ (a,b)R (a,b) ∴ R is reflexive
Let (a,b) R(c, d). ∴1a−1b=1c−1d
⇒1c−1d=1a−1b ⇒ (c,d) R(a, b)
⇒ R is symmetric
Let (a, b) R (c, d) and (c, d) R (e, f).
∴ 1a−1b=1c−1d and 1c−1d=1e−1f
⇒1a−1b=1e−1f ⇒(a,b) R(e,f)
⇒ R is transitive.
∴ R is equivalence relation.
Let R = {((a, b), (c, d)) :bc (b + c) = ad (a + d), (a, b), (c, d) ϵ N × N}
Let (a, b) ϵ N × N
We have, ba (b + a) = ab (a + b). ⇒ R is reflexive.
Let (a, b) R (c, d)
∴ bc (b+c) = ad (a+b)
⇒ ad (a + b) = bc (b + c)
⇒ ad (d + a) = cb (c + b)
⇒ (c, d) R (a, b)
⇒ R is symmetric
Let (a, b) R (c, d) and (c, d) R (e, f).
∴ bc (b+c) = ad (a+d) and de (d+e)=cf (c+f)
These equations need no imply be (b + e) = af(a + f).
∴ (a,b) may not be R – related to (c, f).
∴ R is not transitive
∴ R is not an equivalence relation.
∴ The correct answer is (d).