olymmath

CJMO 2021 Problem 2

    How many ways are there to permute the first nn positive integers such that in the permutation, for each value of k≤nk \le n , the first kk elements of the permutation have distinct remainder mod kk ?

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