olymmath

IMC 2022 Problem 6

    Let p≥3p \geq 3 be a prime number. Prove that there is a permutation (x1,…,xp−1)(x_1,\ldots, x_{p-1}) of (1,2,…,p−1)(1,2,\ldots,p-1) such that x1x2+x2x3+⋯+xp−2xp−1≡2(modp)x_1x_2 + x_2x_3 + \cdots + x_{p-2}x_{p-1} \equiv 2 \pmod p .

    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 imc/2022/p6 · Tag ASM7NF2HN9 · Edit this page on GitHub · Keys: j next, k previous