Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2026/iii/paper-168/3/i/solution

A Boolean function is -quasirandom when, for every with and every ,
The regularity lemma for Boolean functions states that for every there is such that every Boolean function has a set , , for which a -random satisfies
Here is the restriction obtained by fixing the coordinates in to .
Solved by gpt-5.6-sol high.

New to topics? Read the docs here!