olymmath

SCHWEITZER 2010 Problem 1

    Let pp be prime. Denote by N(p)N (p) the number of integers xx for which 1≤x≤p1 \leq x \leq p and xx≡1( mod p)x ^ {x} \equiv 1 (\bmod p) Prove that there exist numbers c<1/2c <1/2 and p0>0p_ {0}> 0 such that N(p)≤pcN (p) \leq p ^ {c} if p≥p0p \ge p_ {0} .

    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 schweitzer/2010/p1 · Tag 58PQWZK8Z4 · Edit this page on GitHub · Keys: j next, k previous