olymmath

ILL 1987 Problem 19

    How many words with nn digits can be formed from the alphabet {0,1,2,3,4}\{0, 1, 2, 3, 4\}, if neighboring digits must differ by exactly one?

    Proposed by Germany, FR.

    Dataset text AoPS wiki problems. 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 ill/1987/p19 · Tag EBR70HN86H · Edit this page on GitHub · Keys: j next, k previous