olymmath

AUSTRIAN-POLISH 1984 Problem 5

    Given n>2n > 2 nonnegative distinct integers a1,...,ana_1,...,a_n , find all nonnegative integers yy and x1,...,xnx_1,...,x_n satisfying gcd(x1,...,xn)=1gcd(x_1,...,x_n) = 1 and {a1x1+a2x2+...+anxn=yx1a2x1+a3x2+...+a1xn=yx2...anx1+a1x2+...+an−1xn=yxn\begin{cases} a_1x_1 + a_2x_2 +...+ a_nx_n = yx_1 a_2x_1 + a_3x_2 +...+ a_1x_n = yx_2 ... a_nx_1 + a_1x_2 +...+ a_{n-1}x_n = yx_n \end{cases}

    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 austrian-polish/1984/p5 · Tag 1BC3TZSXZN · Edit this page on GitHub · Keys: j next, k previous