olymmath

KöMaL 2019 B5029

    Assume that a certain football team have played 1000 games altogether, and scored 1000 points altogether since the team was founded. (A team score 3 points for every game they win, 1 point for a draw and no points for games they lose.) Prove that there are at most (2.9)1000{(2.9)}^{1000} possible sequences of the 1000 scores.

    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/2019/b5029 · Tag 7KSF1E16Y8 · Edit this page on GitHub · Keys: j next, k previous