olymmath

RO-TST 2004 Problem 13

    Let m≥2m\geq 2 be an integer. A positive integer nn has the property that for any positive integer aa coprime with nn , we have am−1≡0(modn)a^m - 1\equiv 0 \pmod n .

    Prove that n≤4m(2m−1)n \leq 4m(2^m-1) .

    Created by Harazi, modified by Marian Andronache.

    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 ro-tst/2004/p13 · Tag CWYFTM57DC · Edit this page on GitHub · Keys: j next, k previous