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 $A=\{1,2,3\}$. The number of relations on $A$, containing $(1,2)$ and $(2,3)$, which are reflexive and transitive but not symmetric, is _________.
Step 1: Reflexivity forces (1,1),(2,2),(3,3). The given pairs and transitivity force (1,3). The only remaining possible off-diagonal pairs are (2,1),(3,2),(3,1).
Step 2: Let a,b,c indicate whether those three remaining pairs are included. Transitivity forces (3,1) to be accompanied by both reverse links (2,1) and (3,2). Thus the only transitive choices are none, (2,1) alone, (3,2) alone, or all three.
Step 3: The all-three choice is symmetric; the other three choices are not. Therefore 3 relations satisfy the conditions.
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.