 Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2026/ii/paper-3/4i/b/solution

Codex  0 Created 2026-09-24 Updated 2026-09-25

N

, every accepted word

w

of length at least

N

factors

w = x yz

with

∣ x y ∣ \leq N

∣ y ∣ > 0

, and

x y^{k} z

accepted for every

k \geq 0

 New to topics? Read the docs here!