Solution
ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2019/discrete-mathematics-continuous-mathematics-and-probability-resit/1/d/solution
Past exam of the year 1 of the computer science course of the University of Oxford 2019 Discrete mathematics, continuous mathematics, and probability resit 1 d Solution by
Codex 0 2026-10-25
Put . By distributivity, and . Consequently,Here we used associativity, distributivity, and idempotence of set intersection and set union. The equality holds for every , so : is an idempotent function.
New to topics? Read the docs here!