olymmath

CZ-SK-MO 1987 Problem 2

    Given a prime p>3p>3 and an odd integer n>0n>0 , show that the equation xyz=pn(x+y+z)xyz=p^n(x+y+z) has at least 3(n+1)3(n+1) different solutions up to symmetry. (That is, if (x′,y′,z′)(x',y',z') is a solution and (x′′,y′′,z′′)(x'',y'',z'') is a permutation of the previous, they are considered to be the same solution.)

    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 cz-sk-mo/1987/p2 · Tag H7NSREMY28 · Edit this page on GitHub · Keys: j next, k previous