olymmath

ISL 2011 C6

    Let nn be a positive integer and let W=…x−1x0x1x2…W=\ldots x_{-1} x_{0} x_{1} x_{2} \ldots be an infinite periodic word consisting of the letters aa and bb. Suppose that the minimal period NN of WW is greater than 2n2^{n}. A finite nonempty word UU is said to appear in WW if there exist indices k≤ℓk \leq \ell such that U=xkxk+1…xℓU=x_{k} x_{k+1} \ldots x_{\ell}. A finite word UU is called ubiquitous if the four words Ua,Ub,aUU a, U b, a U, and bUb U all appear in WW. Prove that there are at least nn ubiquitous finite nonempty words.

    Dataset text NuminaMath olympiads. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Locator isl/2011/c6 · Tag 562SZ2Y1CW · Edit this page on GitHub · Keys: j next, k previous