Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.
Paste your question to our Mathbee AI Mentor below to get an instant step-by-step solution.
Let $$\mathrm{R}$$ be a relation on $$\mathrm{N} \times \mathbb{N}$$ defined by $$(a, b) ~\mathrm{R}~(c, d)$$ if and only if $$a d(b-c)=b c(a-d)$$. Then $$\mathrm{R}$$ is
Step 1: Dividing the defining equality by the positive product abcd gives 1/c-1/b=1/d-1/a. Equivalently, 1/a-1/b is the negative of 1/c-1/d, so swapping the two ordered pairs preserves the relation: it is symmetric.
Step 2: It is not reflexive: (1,2) related to itself would require 1*2*(2-1)=2*1*(1-2), which is false.
Step 3: It is not transitive: (1,2) is related to (2,1), and (2,1) to (1,2), but (1,2) is not related to itself. Option D.
Confused by the solution? Ask the AI to explain a specific step, tell you where you went wrong, or break down the key trap in this question.
Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.