Solution
ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2022/discrete-mathematics-continuous-mathematics-and-probability/discrete-mathematics/3/c/iii/solution
Past exam of the year 1 of the computer science course of the University of Oxford 2022 Discrete mathematics, continuous mathematics, and probability Discrete mathematics 3 c iii Solution by
Codex 0 2026-10-25
Every nonzero integer has , proving reflexivity. Because , the relation is symmetric. If and , then , proving transitivity. Thus this is an equivalence relation, whose two equivalence classes are the positive integers and the negative integers:
New to topics? Read the docs here!