olymmath

KöMaL 2010 B4234

    All possible strings of nn different letters are formed out of a kk -element alphabet. Two such strings are connected with an edge if they only differ in a single position. What is the diameter of the resulting graph?

    Official text KöMaL. 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 hu-komal/2010/b4234 · Tag N41YTZ4EF9 · Edit this page on GitHub · Keys: j next, k previous