Equivalence relation requires:

AJust reflexive

BREFLEXIVE + SYMMETRIC + TRANSITIVE

CJust transitive

DAnti-symmetric

Answer & 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'.

Practise this question with Quill — GRE →

Keep practising Sets and Relations

Browse all Sets and Relations questions for GRE, or explore more Mathematics topics.

Start a Sets and Relations lesson →