olymmath

RU-ALLRUSSIAN 1975 Problem 10

    The finite sequence an\mathrm{a_n} has each member 0, 1 or 2. A move involves replacing any two unequal members of the sequence by a single member different from either. A series of moves results in a single number. Prove that no series of moves can terminate in a (single) different number.

    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 ru-allrussian/1975/p10 · Tag PG14WWQN4W · Edit this page on GitHub · Keys: j next, k previous