 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/2/a/i/solution

The pigeonhole principle states that if $N$ objects are placed in $k$ boxes and $N > k$ , at least one box contains at least two objects.

 New to topics? Read the docs here!