Maths Olympiad Prep

Library / /8 of 55

, 2019

Number theory Difficulty 8.0 National olympiad, round 2 Prove it IMO

Find all triples (a,b,c)(a, b, c) of positive integers such that a3+b3+c3=(abc)2a^{3} + b^{3} + c^{3} = (a b c)^{2}.

Solution

Solution 1. We will start by proving that c=1c=1. Note that
3a3a3+b3+c3>a3 3 a^{3} \geqslant a^{3} + b^{3} + c^{3} > a^{3}
So 3a3(abc)2>a33 a^{3} \geqslant (a b c)^{2} > a^{3} and hence 3ab2c2>a3 a \geqslant b^{2} c^{2} > a. Now b3+c3=a2(b2c2a)a2b^{3} + c^{3} = a^{2} (b^{2} c^{2} - a) \geqslant a^{2}, and so
18b39(b3+c3)9a2b4c4b3c5 18 b^{3} \geqslant 9 (b^{3} + c^{3}) \geqslant 9 a^{2} \geqslant b^{4} c^{4} \geqslant b^{3} c^{5}
so 18c518 \geqslant c^{5} which yields c=1c=1.

Now, note that we must have a>ba > b, as otherwise we would have 2b3+1=b42 b^{3} + 1 = b^{4} which has no positive integer solutions. So
a3b3(b+1)3b3>1 a^{3} - b^{3} \geqslant (b + 1)^{3} - b^{3} > 1
and
2a3>1+a3+b3>a3, 2 a^{3} > 1 + a^{3} + b^{3} > a^{3},
which implies 2a3>a2b2>a32 a^{3} > a^{2} b^{2} > a^{3} and so 2a>b2>a2 a > b^{2} > a. Therefore
4(1+b3)=4a2(b2a)4a2>b4 4 (1 + b^{3}) = 4 a^{2} (b^{2} - a) \geqslant 4 a^{2} > b^{4}
so 4>b3(b4)4 > b^{3} (b - 4); that is, b4b \leqslant 4.

Now, for each possible value of bb with 2b42 \leqslant b \leqslant 4 we obtain a cubic equation for aa with constant coefficients. These are as follows:
b=2:a34a2+9=0b=3:a39a2+28=0b=4:a316a2+65=0. \begin{array}{ll} b=2: & a^{3} - 4 a^{2} + 9 = 0 \\ b=3: & a^{3} - 9 a^{2} + 28 = 0 \\ b=4: & a^{3} - 16 a^{2} + 65 = 0 . \end{array}
The only case with an integer solution for aa with bab \leqslant a is b=2b=2, leading to (a,b,c)=(3,2,1)(a, b, c) = (3, 2, 1).

Solution 2. Again, we will start by proving that c=1c=1. Suppose otherwise that c2c \geqslant 2. We have a3+b3+c33a3a^{3} + b^{3} + c^{3} \leqslant 3 a^{3}, so b2c23ab^{2} c^{2} \leqslant 3 a. Since c2c \geqslant 2, this tells us that b3a/4b \leqslant \sqrt{3 a} / 4. As the right-hand side of the original equation is a multiple of a2a^{2}, we have a22b32(3a/4)3/2a^{2} \leqslant 2 b^{3} \leqslant 2 (3 a / 4)^{3 / 2}. In other words, a2716<2a \leqslant \frac{27}{16} < 2, which contradicts the assertion that ac2a \geqslant c \geqslant 2. So there are no solutions in this case, and so we must have c=1c=1.

Now, the original equation becomes a3+b3+1=a2b2a^{3} + b^{3} + 1 = a^{2} b^{2}. Observe that a2a \geqslant 2, since otherwise a=b=1a = b = 1 as aba \geqslant b.
The right-hand side is a multiple of a2a^{2}, so the left-hand side must be as well. Thus, b3+1a2b^{3} + 1 \geqslant a^{2}. Since aba \geqslant b, we also have
b2=a+b3+1a22a+1a2 b^{2} = a + \frac{b^{3} + 1}{a^{2}} \leqslant 2 a + \frac{1}{a^{2}}
and so b22ab^{2} \leqslant 2 a since b2b^{2} is an integer. Thus (2a)3/2+1b3+1a2(2 a)^{3 / 2} + 1 \geqslant b^{3} + 1 \geqslant a^{2}, from which we deduce a8a \leqslant 8.

Now, for each possible value of aa with 2a82 \leqslant a \leqslant 8 we obtain a cubic equation for bb with constant coefficients. These are as follows:
a=2:b34b2+9=0a=3:b39b2+28=0a=4:b316b2+65=0a=5:b325b2+126=0a=6:b336b2+217=0a=7:b349b2+344=0a=8:b364b2+513=0. \begin{array}{ll} a=2: & b^{3} - 4 b^{2} + 9 = 0 \\ a=3: & b^{3} - 9 b^{2} + 28 = 0 \\ a=4: & b^{3} - 16 b^{2} + 65 = 0 \\ a=5: & b^{3} - 25 b^{2} + 126 = 0 \\ a=6: & b^{3} - 36 b^{2} + 217 = 0 \\ a=7: & b^{3} - 49 b^{2} + 344 = 0 \\ a=8: & b^{3} - 64 b^{2} + 513 = 0 . \end{array}
The only case with an integer solution for bb with aba \geqslant b is a=3a=3, leading to (a,b,c)=(3,2,1)(a, b, c) = (3, 2, 1).

Solution 3. Set k=(b3+c3)/a22ak = (b^{3} + c^{3}) / a^{2} \leqslant 2 a, and rewrite the original equation as a+k=(bc)2a + k = (b c)^{2}. Since b3b^{3} and c3c^{3} are positive integers, we have (bc)3b3+c31=ka21(b c)^{3} \geqslant b^{3} + c^{3} - 1 = k a^{2} - 1, so
a+k(ka21)2/3 a + k \geqslant (k a^{2} - 1)^{2 / 3}
As in Comment 1.2, kk is a positive integer; for each value of k1k \geqslant 1, this gives us a polynomial inequality satisfied by aa:
k2a4a35ka23k2a(k31)0. k^{2} a^{4} - a^{3} - 5 k a^{2} - 3 k^{2} a - (k^{3} - 1) \leqslant 0 .
We now prove that a3a \leqslant 3. Indeed,
0k2a4a35ka23k2a(k31)k2a4a35a23aka4a35a25a, 0 \geqslant \frac{k^{2} a^{4} - a^{3} - 5 k a^{2} - 3 k^{2} a - (k^{3} - 1)}{k^{2}} \geqslant a^{4} - a^{3} - 5 a^{2} - 3 a - k \geqslant a^{4} - a^{3} - 5 a^{2} - 5 a,
which fails when a4a \geqslant 4.
This leaves ten triples with 3abc13 \geqslant a \geqslant b \geqslant c \geqslant 1, which may be checked manually to give (a,b,c)=(3,2,1)(a, b, c) = (3, 2, 1).

Solution 4. Again, observe that b3+c3=a2(b2c2a)b^{3} + c^{3} = a^{2} (b^{2} c^{2} - a), so bab2c21b \leqslant a \leqslant b^{2} c^{2} - 1.
We consider the function f(x)=x2(b2c2x)f(x) = x^{2} (b^{2} c^{2} - x). It can be seen that that on the interval [0,b2c21][0, b^{2} c^{2} - 1] the function ff is increasing if x<23b2c2x < \frac{2}{3} b^{2} c^{2} and decreasing if x>23b2c2x > \frac{2}{3} b^{2} c^{2}. Consequently, it must be the case that
b3+c3=f(a)min(f(b),f(b2c21)) b^{3} + c^{3} = f(a) \geqslant \min \left(f(b), f(b^{2} c^{2} - 1)\right)
First, suppose that b3+c3f(b2c21)b^{3} + c^{3} \geqslant f(b^{2} c^{2} - 1). This may be written b3+c3(b2c21)2b^{3} + c^{3} \geqslant (b^{2} c^{2} - 1)^{2}, and so
2b3b3+c3(b2c21)2>b4c42b2c2b4c42b3c4 2 b^{3} \geqslant b^{3} + c^{3} \geqslant (b^{2} c^{2} - 1)^{2} > b^{4} c^{4} - 2 b^{2} c^{2} \geqslant b^{4} c^{4} - 2 b^{3} c^{4}
Thus, (b2)c4<2(b - 2) c^{4} < 2, and the only solutions to this inequality have (b,c)=(2,2)(b, c) = (2, 2) or b3b \leqslant 3 and c=1c = 1. It is easy to verify that the only case giving a solution for aba \geqslant b is (a,b,c)=(3,2,1)(a, b, c) = (3, 2, 1).

Otherwise, suppose that b3+c3=f(a)f(b)b^{3} + c^{3} = f(a) \geqslant f(b). Then, we have
2b3b3+c3=a2(b2c2a)b2(b2c2b) 2 b^{3} \geqslant b^{3} + c^{3} = a^{2} (b^{2} c^{2} - a) \geqslant b^{2} (b^{2} c^{2} - b)
Consequently bc23b c^{2} \leqslant 3, with strict inequality in the case that bcb \neq c. Hence c=1c = 1 and b2b \leqslant 2. Both of these cases have been considered already, so we are done.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.