Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2023/discrete-mathematics-probability-and-continuous-mathematics/1/d/iv/solution

Take the nonempty intersections of the length-three and length-four blocks. Within the first twelve nonnegative integers the common cut points are , giving
The complete partition of a set consists of these six blocks translated by for every . Indeed, adding increases the two floor quotients by and respectively, preserving equality of both quotients within each translated block. No adjacent displayed blocks can merge because at least one quotient changes at their boundary. This is the periodic common refinement of floor-quotient partitions, with period .

New to topics? Read the docs here!