olymmath

BALKAN-SL 2020 N5

    Consider an integer n≥2n\geq 2 and an odd prime pp . Let UU be the set of all positive integers (( strictly )) less than pnp^n that are not divisible by pp , and let NN be the number of elements of UU . Does there exist permutation a1,a2,⋯aNa_1,a_2,\cdots a_N of the numbers in UU such that the sum ∑k=1Nakak+1\sum_{k=1}^N a_ka_{k+1} ,where aN+1=a1a_{N+1}=a_1 , be divisible by pn−1p^{n-1} but not by pnp^n ? Alexander IvanovBulgariaAlexander \ Ivanov Bulgaria

    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 balkan-sl/2020/n5 · Tag DWX05ZQCZC · Edit this page on GitHub · Keys: j next, k previous