Equivalence relation requires:
- Just reflexive
- REFLEXIVE + SYMMETRIC + TRANSITIVE
- Just transitive
- Anti-symmetric
Show answer and solution
Correct answer: B. REFLEXIVE + SYMMETRIC + TRANSITIVE
**Equivalence relation:** aRa (reflexive), aRb
⇒ bRa (symmetric), aRb ∧ bRc ⇒ aRc (transitive).
Partitions set into disjoint equivalence classes.
e.g., 'congruence mod n', 'same age'.