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 ______ -
Reflexivity requires the pairs . Since and are given, transitivity forces us to include . Thus the base set of pairs is .
Aside from these, the only remaining possible ordered pairs on are . We examine which subsets of these can be added without violating transitivity and while ensuring the relation remains not symmetric.
If we add none of these extra pairs, the relation is already transitive and is not symmetric because is present but is absent. This case is valid.
If we add only , then checking transitivity: ✓, ✓, and all other composites are already accounted for. Since is present without , the relation remains not symmetric, so this case is valid.
If we add only , then ✓, ✓, and all necessary closures hold. Because appears without , the relation is not symmetric, so this case is valid.
If we add only , transitivity would require to be present, but it is not. Therefore this case fails transitivity and is invalid.
If we add and , then transitivity demands , which is missing, so this case is invalid.
If we add and , then must be present but is not, making this case invalid.
If we add and , then is required and is missing, so this case is invalid.
If we add all three extra pairs , the relation is transitive but becomes symmetric since every pair has its reverse, which is forbidden. Hence this case is invalid.
Out of the eight possibilities, only three yield relations that are reflexive, transitive, contain and , and are not symmetric. Therefore, the answer is 3.
Tagged Reflexive, symmetric and transitive relations. Machine-assigned, so read it as a strong shortlist rather than a verdict.