Maths Olympiad Prep

Library / /20 of 30

Number theory Difficulty 6.4 National olympiad Prove it Ireland

Find all pairs of integers (a,b)(a, b) such that a3+b3+3ab=53a^3 + b^3 + 3ab = 53.

Solution

First Solution: The key to this solution is the identity
a3+b31+3ab=(a+b1)(a2+b2ab+a+b+1). a^3 + b^3 - 1 + 3ab = (a+b-1)(a^2 + b^2 - ab + a + b + 1).
Even though this can be verified readily, we explain how to find it. We start with a polynomial of degree 3 which has aa, bb and an auxiliary number cc as its roots f(x)=(xa)(xb)(xc)=x3(a+b+c)x2+(ab+ac+bc)xabcf(x) = (x-a)(x-b)(x-c) = x^3 - (a+b+c)x^2 + (ab+ac+bc)x - abc. We obtain the identity
0=f(a)+f(b)+f(c)=a3+b3+c33abc(a+b+c)(a2+b2+c2abacbc). 0 = f(a) + f(b) + f(c) = a^3 + b^3 + c^3 - 3abc - (a+b+c)(a^2 + b^2 + c^2 - ab - ac - bc).
Substituting c=1c = -1 gives the identity mentioned above.

The original equation a3+b3+3ab=53a^3 + b^3 + 3ab = 53 is equivalent to the equation
(a+b1)(a2+b2ab+a+b+1)=52. (a+b-1)(a^2+b^2-ab+a+b+1) = 52.
Because we are looking for integer solutions, the two numbers u=a+b1u = a+b-1 and v=a2+b2ab+a+b+1=(a+b)2+(a+b1)3ab+2=(u+1)2+u+23ab=(u+1)(u+2)+13abv = a^2+b^2-ab+a+b+1 = (a+b)^2+(a+b-1)-3ab+2 = (u+1)^2+u+2-3ab = (u+1)(u+2)+1-3ab have to be divisors of 52=221352 = 2 \cdot 2 \cdot 13. The integer divisors of 5252 are ±1,±2,±4,±13,±26,±52\pm 1, \pm 2, \pm 4, \pm 13, \pm 26, \pm 52. In particular, u±1(mod3)u \equiv \pm 1 \pmod 3. We have a+b=u+1a+b = u+1 and 3ab=(u+1)(u+2)+1v3ab = (u+1)(u+2)+1-v. The last identity and u±1(mod3)u \equiv \pm 1 \pmod 3 imply v1(mod3)v \equiv 1 \pmod 3. Hence, the following table covers all possibilities for uu and vv.

| u | v | a+b | 3ab | ab |
|----|----|-----|-----|-----|
| 1 | 52 | 2 | -45 | -15 |
| -2 | -26| -1 | 27 | 9 |
| 4 | 13 | 5 | 18 | 6 |
| 13 | 4 | 14 | 207 | 69 |
| -26| -2 | -25 | 603 | 201 |
| 52 | 1 | 53 | 2862| 954 |

From x=a+bx = a+b and y=aby = ab we obtain (a,b)(a, b) by solving the quadratic equation a2ax+y=0a^2 - ax + y = 0 and using b=xab = x - a. For aa to be an integer, we need therefore that the discriminant of the quadratic, x24yx^2 - 4y, is a perfect square. Only the first and third row of the table give x24y0x^2 - 4y \ge 0. Therefore, the only possible solutions are (5,3),(3,5),(3,2),(2,3)(5, -3), (-3, 5), (3, 2), (2, 3). Substituting them in the original equation shows that they are indeed solutions.

Second Solution: Because 5353 is not a perfect cube, neither aa nor bb could be zero. Without loss of generality, we may assume aba \le b. We distinguish the following three cases.

**0<ab0 < a \le b:** In this case, a3+b3+3ab2a3+3a2=a2(2a+3)a^3 + b^3 + 3ab \ge 2a^3 + 3a^2 = a^2(2a + 3), hence a2(2a+3)53a^2(2a+3) \le 53. This implies a2a \le 2. If a=1a = 1, we get b3+3b=b(b2+3)=52=2213b^3+3b = b(b^2+3) = 52 = 2 \cdot 2 \cdot 13. As b<b2+3b < b^2+3, the only possibilities for bb are 1,2,41, 2, 4 but none of them leads to a solution. If a=2a = 2, we have to solve b3+6b=b(b2+6)=45=533b^3+6b = b(b^2+6) = 45 = 5 \cdot 3 \cdot 3. As b<b2+6b < b^2+6, bb can only be 1,31, 3 or 55. Only b=3b = 3 is a solution.

**ab<0a \le b < 0:** In this case, a3+b3+3ab=a(a2+3b)+b3=53>0a^3 + b^3 + 3ab = a(a^2 + 3b) + b^3 = 53 > 0. Because b3<0b^3 < 0 and a<0a < 0 this implies a2+3b<0a^2 + 3b < 0. Hence, a2<3ba^2 < 3|b|. On the other hand, ab|a| \ge |b| and so b2a2<3bb^2 \le a^2 < 3|b| which implies b<3|b| < 3. If b=1b = -1, we get a33a=a(a23)=54>0a^3 - 3a = a(a^2 - 3) = 54 > 0. As a<0a < 0 this implies a2<3a^2 < 3, i.e. a=1a = -1 which does not give a solution. If b=2b = -2, we get a36a=a(a26)=61a^3 - 6a = a(a^2 - 6) = 61. As before, this implies a2<6a^2 < 6, i.e. a=1a = -1 or a=2a = -2. But both values do not solve the equation.

a < 0 < b: In this case, 3ab<03ab < 0 and so a3+b3>0a^3 + b^3 > 0 which implies b>ab > |a|. Let c=a>0c = -a > 0 and b=c+kb = c + k with k1k \ge 1. The given equation becomes
b3c33bc=53(c+k)3c33c(c+k)=533c2(k1)+3ck(k1)+k3=53. \begin{aligned} b^3 - c^3 - 3bc &= 53 \\ (c + k)^3 - c^3 - 3c(c + k) &= 53 \\ 3c^2(k - 1) + 3ck(k - 1) + k^3 &= 53. \end{aligned}
The left hand side is at least 3(k1)+3k(k1)+k3=k2(k+3)33(k-1)+3k(k-1)+k^3 = k^2(k+3)-3, hence we need to have k2(k+3)56k^2(k+3) \le 56 which implies k3k \le 3. We cannot have k=1k=1, because 5353 is not a perfect cube. If k=2k=2 we need to solve 3c2+6c+8=533c^2+6c+8=53, or equivalently, c(c+2)=15c(c+2) = 15 with c=3c=3 as its only positive solution. This leads to (a,b)=(3,5)(a,b) = (-3,5). Finally, if k=3k=3 we need to have 6c2+18c+27=536c^2+18c+27=53 which has no solution as 5353 is not divisible by 33.

Therefore, the only solutions to the original equation are (5,3),(3,5),(3,2)(5,-3), (-3,5), (3,2) and (2,3)(2,3).

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.