olymmath

CZ-SK-MO 2020 Problem 6

    For each positive integer kk , denote by P(k)P (k) the number of all positive integers 4k4k -digit numbers which can be composed of the digits 2,02, 0 and which are divisible by the number 20202 020 . Prove the inequality P(k)≥(2k−1k)2P (k) \ge \binom{2k - 1}{k}^2 and determine all kk for which equality occurs.

    (Note: A positive integer cannot begin with a digit of 00 .)

    (Jaromir Simsa)

    Dataset text AI-MO AoPS. 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 cz-sk-mo/2020/p6 · Tag GJ7Q7A97ME · Edit this page on GitHub · Keys: j next, k previous