olymmath

KöMaL 2013 K380

    Strings are made out of 6 letters A and 7 letters B. How many such strings can be made that are palindromes, i.e. that read the same either from the beginning or from the end?

    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/2013/k380 · Tag WDTM144A0S · Edit this page on GitHub · Keys: j next, k previous