olymmath

CWMO 2002 Problem 8

    Assume that S=(a1,a2,⋯ ,an)S=(a_1, a_2, \cdots, a_n) consists of 00 and 11 and is the longest sequence of number, which satisfies the following condition: Every two sections of successive 55 terms in the sequence of numbers SS are different, i.e., for arbitrary 1≤i<j≤n−41\le i<j\le n-4 , (ai,ai+1,ai+2,ai+3,ai+4)(a_i, a_{i+1}, a_{i+2}, a_{i+3}, a_{i+4}) and (aj,aj+1,aj+2,aj+3,aj+4)(a_j, a_{j+1}, a_{j+2}, a_{j+3}, a_{j+4}) are different. Prove that the first four terms and the last four terms in the sequence are the same.

    Dataset text AI-MO AoPS. 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

    Similar problems

    These problems have the most words in common with this statement.

    Locator cn-wmo/2002/p8 · Tag 4VXARX1ZH6 · Edit this page on GitHub · Keys: j next, k previous