olymmath

KöMaL 2021 B5206

    An nn-digit number a1a2a3…an‾\overline{a_1a_2a_3\ldots a_n} is called hill type if there exists an integer 1≤k≤n1 \le k \le n for which the sequence a1,a2,…,aka_1,a_2,\ldots,a_k is strictly increasing and the sequence ak,ak+1,…,ana_k,a_{k+1},\ldots,a_n is strictly decreasing. (For example, the numbers 1, 121, 1231 are of hill type, whereas 1442 or 12313 are not.) How many hill type numbers are there?

    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/2021/b5206 · Tag QZEAXGP662 · Edit this page on GitHub · Keys: j next, k previous