olymmath

PL-OM 2011 Problem 1

    Find all integers n≥1n\geq 1 such that there exists a permutation (a1,a2,...,an)(a_1,a_2,...,a_n) of (1,2,...,n)(1,2,...,n) such that a1+a2+...+aka_1+a_2+...+a_k is divisible by kk for k=1,2,...,nk=1,2,...,n

    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 pl-om/2011/p1 · Tag DZN0531AZ4 · Edit this page on GitHub · Keys: j next, k previous