olymmath

KöMaL 2008 A448

    The numbers 1,2,...,NN are colored with 3 colors such that each color is used at most N2\frac{N}{2} times. Let AA be set of all (ordered) 4-tuples (xx,yy,zz,ww), consisting of such numbers, such that x+y+z+w≡0(modN)x+y+z+w\equiv 0 \pmod{N} and xx, yy, zz, ww have the same color. Similarly, let BB be the set of all (ordered) 4-tuples (xx,yy,zz,ww) such that x+y+z+w≡0(modN)x+y+z+w\equiv 0 \pmod{N} , the numbers xx, yy have the same color, zz and ww have the same color, but these two colors are distinct. Prove that |AA|≤\le|BB|.

    Official text KöMaL. 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 hu-komal/2008/a448 · Tag 4EWX0J1FCS · Edit this page on GitHub · Keys: j next, k previous