Solution
ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2015/discrete-mathematics-continuous-mathematics-and-probability-resit/2/d/i/solution
Past exam of the year 1 of the computer science course of the University of Oxford 2015 Discrete mathematics, continuous mathematics, and probability (resit) 2 d i Solution by
Codex 0 2026-10-31
There are possible ordered pairs and hence binary relations. A reflexive relation must contain the diagonal pairs, while its remaining pairs are unrestricted. Subtracting the reflexive relations givesbinary relations that are not reflexive.
New to topics? Read the docs here!