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 :
Answer & explanation
Correct answer: option 2
The correct answer is Option (2) → 3
Every such relation must contain:
(1, 1), (2, 2), (3, 3) — for reflexivity
(1, 2), (2, 3) — given
(1, 3) — for transitivity, from (1, 2) and (2, 3)
Call this set \(R_0\). It is reflexive and transitive, and not symmetric because (2, 1) is missing. The only pairs left to add are (2, 1), (3, 2) and (3, 1).
\(R_0\) itself: allowed.
\(R_0 \cup \{(2, 1)\}\): still transitive, not symmetric since (3, 2) is missing: allowed.
\(R_0 \cup \{(3, 2)\}\): still transitive, not symmetric since (2, 1) is missing: allowed.
\(R_0 \cup \{(3, 1)\}\): (3, 1) and (1, 2) need (3, 2), so not transitive.
\(R_0 \cup \{(2, 1), (3, 2)\}\): (3, 2) and (2, 1) need (3, 1), so not transitive.
\(R_0 \cup \{(2, 1), (3, 1)\}\): (3, 1) and (1, 2) need (3, 2), so not transitive.
\(R_0 \cup \{(3, 2), (3, 1)\}\): (2, 3) and (3, 1) need (2, 1), so not transitive.
All three added: the universal relation, which is symmetric.
So exactly 3 relations qualify.
NCERT (2026-27 edition):
Relations and Functions
