Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2016/discrete-mathematics-continuous-mathematics-and-probability-resit/2/a/solution

A binary relation on is an equivalence relation exactly when it is reflexive, symmetric, and transitive:
The equivalence class of is . The equivalence classes partition : every element belongs to its own class, and two classes are either equal or disjoint.

New to topics? Read the docs here!