olymmath

IMAC 2013 Problem 1

    Show that in any set of three distinct integers there are two of them, say aa and bb such that the number a5b3−a3b5a^5b^3-a^3b^5 is a multiple of 1010 .

    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 imac/2013/p1 · Tag QS5HQ34Y6S · Edit this page on GitHub · Keys: j next, k previous