olymmath

DK-GEORGMOHR 2004 Problem 2

    Show that if aa and bb are integer numbers, and a2+b2+9aba^2 + b^2 + 9ab is divisible by 1111 , then a2−b2a^2-b^2 divisible by 1111 .

    Dataset text AI-MO AoPS. Quoted with source.

    Official text: Georg Mohr Contest 2004 official paper, page 1.

    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 dk-georgmohr/2004/p2 · Tag J7T4Y0Q2XJ · Edit this page on GitHub · Keys: j next, k previous