olymmath

IN-TST 2002 Problem 14

    Let pp be an odd prime and let aa be an integer not divisible by pp . Show that there are p2+1p^2+1 triples of integers (x,y,z)(x,y,z) with 0≤x,y,z<p0 \le x,y,z < p and such that (x+y+z)2≡axyz(modp)(x+y+z)^2 \equiv axyz \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 in-tst/2002/p14 · Tag 8XDGBKAKB3 · Edit this page on GitHub · Keys: j next, k previous