Maths Olympiad Prep

Library / /6 of 73

Number theory Difficulty 7.5 National Olympiad, round 2 Prove it Turkey

Find all pairs (m,n)(m, n) of positive integers satisfying m6+5n2=m+n3m^6 + 5n^2 = m + n^3.

Solution

Let us rewrite the equation: n(n25n)=m(m51)n(n^2 - 5n) = m(m^5 - 1). If nmn \le m then n25nm51n51n^2 - 5n \ge m^5 - 1 \ge n^5 - 1. Contradiction, Thus, n>mn > m. Now n3>n35n2+n>n35n2+m=m6n^3 > n^3 - 5n^2 + n > n^3 - 5n^2 + m = m^6. Therefore, n3>m6n^3 > m^6, equivalently n>m2n > m^2. Let n=m2+kn = m^2 + k for some k>0k > 0. By putting m2=nkm^2 = n - k to the main equation

we get 5n23m2nkk3m=05n^2 - 3m^2nk - k^3 - m = 0. Thus, nn divides k3+mk^3 + m and nk3+mn \le k^3 + m. Now 5n2=k3+3m2kn+mn(3m2k+1)5n^2 = k^3 + 3m^2kn + m \ge n(3m^2k + 1). Therefore, 5n3m2k+15n \ge 3m^2k + 1 or 5m2+5k3m2k+15m^2 + 5k \ge 3m^2k + 1. Since m2(3k5)5k1m^2(3k - 5) \le 5k - 1 then m25k13k5=9+4422k3k5m^2 \le \frac{5k-1}{3k-5} = 9 + \frac{44-22k}{3k-5}. Therefore, if k>1k > 1 then m29m^2 \le 9. Thus, mm takes 1,2,31,2,3. If m=1m = 1 then n2(5n)=0n^2(5-n) = 0 and n=5n = 5. If m=2m = 2 then n2(5n)=62n^2(5-n) = 62 gives no solution. If m=3m = 3 we get n35n2726=(n11)(n2+6n+66)=0n^3 - 5n^2 - 726 = (n-11)(n^2+6n+66) = 0 giving the only solution n=11n = 11. Now let k=1k = 1. Then by putting n=m2+1n = m^2 + 1 to the main equation we get m(3m32m+1)=4m(3m^3 - 2m + 1) = 4. Then m1m \ne 1 and for m>1m > 1 the left hand side exceeds 44. Done. Solutions: (m,n)=(1,5),(3,11)(m, n) = (1, 5), (3, 11).

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 reproduced verbatim; metadata (topic, difficulty) added by this project.