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/3/a/i/solution
Past exam of the year 1 of the computer science course of the University of Oxford 2019 Discrete mathematics, continuous mathematics, and probability 3 a i Solution by
Codex 0 2026-10-25
A derangement of a finite set is a permutation with no fixed point: for every . Thus every element is moved, although the permutation remains a bijection.
New to topics? Read the docs here!