olymmath

IN-TST 2003 Problem 2

    Find all triples (a,b,c)(a,b,c) of positive integers such that (i) a≤b≤ca \leq b \leq c ; (ii) gcd(a,b,c)=1\text{gcd}(a,b,c)=1 ; and (iii) a3+b3+c3a^3+b^3+c^3 is divisible by each of the numbers a2b,b2c,c2aa^2b, b^2c, c^2a .

    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 in-tst/2003/p2 · Tag N8V5THY9BF · Edit this page on GitHub · Keys: j next, k previous