Maths Olympiad Prep

Library / /157 of 397

, 2023

Algebra Difficulty 5.6 AIME, harder Prove it Taiwan

Show that there exists a positive constant CC such that, for all positive reals aa and bb with a+ba + b being an integer, we have
{a3}+{b3}2C(a+b)6. \{a^3\} + \{b^3\} \le 2 - \frac{C}{(a+b)^6}.

Solution

We show that the claim holds when C=154C = \frac{1}{54}:

Let n=a+bn = a + b, and without loss of generality assume aba \ge b. Note that the function f(x)=x3f(x) = x^3 is an increasing convex function, so if a0+b0=na_0 + b_0 = n and a0b0aba_0 - b_0 \ge a - b, we have
a3+b3a03+b03.(1) a^3 + b^3 \le a_0^3 + b_0^3. \quad (1)
In particular, when a3=a03\lfloor a^3 \rfloor = \lfloor a_0^3 \rfloor and b3=b03\lfloor b^3 \rfloor = \lfloor b_0^3 \rfloor,
{a3}+{b3}{a03}+{b03}. \{a^3\} + \{b^3\} \le \{a_0^3\} + \{b_0^3\}.
So it suffices to consider the two cases {a3}1\{a^3\} \to 1^- or {b3}=0\{b^3\} = 0. The latter is obvious:
{a3}+{b3}<1<2Cn6. \{a^3\} + \{b^3\} < 1 < 2 - \frac{C}{n^6}.
For the former, suppose (a+ε)3=k<n3(a + \varepsilon)^3 = k < n^3 is a positive integer, in which case b=nk3+εb = n - \sqrt[3]{k} + \varepsilon. Since ε\varepsilon is sufficiently small, by (1),
{a3}+{b3}=a3+b3a3b3k+(nk3)3(k1)(nk3)3=1+{(nk3)3}. \begin{aligned} \{a^3\} + \{b^3\} &= a^3 + b^3 - \lfloor a^3 \rfloor - \lfloor b^3 \rfloor \\ &\le k + (n - \sqrt[3]{k})^3 - (k - 1) - \lfloor (n - \sqrt[3]{k})^3 \rfloor \\ &= 1 + \{(n - \sqrt[3]{k})^3\}. \end{aligned}
So it suffices to prove
1+{(nk3)3}2Cn6. 1 + \{(n - \sqrt[3]{k})^3\} \le 2 - \frac{C}{n^6}.
If (nk3)3(n - \sqrt[3]{k})^3 is an integer, the claim is obvious. If not, the above inequality is equivalent to
Cn61{(nk3)3}={(nk3)3}=3n2k33nk23m, \frac{C}{n^6} \le 1 - \{(n - \sqrt[3]{k})^3\} = \{-(n - \sqrt[3]{k})^3\} = 3n^2\sqrt[3]{k} - 3n\sqrt[3]{k^2} - m,
where m=3n2k33nk230m = \lfloor 3n^2\sqrt[3]{k} - 3n\sqrt[3]{k^2} \rfloor \ge 0. Consider the following identity
(x+y+z)(x2+y2+z2yzzxxy)=x3+y3+z33xyz, (x + y + z)(x^2 + y^2 + z^2 - yz - zx - xy) = x^3 + y^3 + z^3 - 3xyz,
substituting x=3n2k3x = 3n^2\sqrt[3]{k}, y=3nk23y = -3n\sqrt[3]{k^2}, z=mz = -m gives
0<(1{b3})(x2+y2+z2yzzxxy)=27n3k(n3km)m3. 0 < (1 - \{b^3\})(x^2 + y^2 + z^2 - yz - zx - xy) = 27n^3k(n^3 - k - m) - m^3.
Since the right-hand side is an integer, the left-hand side is at least 1. Therefore, from k3<n\sqrt[3]{k} < n and 0m3n2k3<3n30 \le m \le 3n^2\sqrt[3]{k} < 3n^3,
1{b3}1x2+y2+z2yzzxxy12(x2+y2+z2)12(9n6+9n6+9n6)=154n6, \begin{aligned} 1 - \{b^3\} &\ge \frac{1}{x^2 + y^2 + z^2 - yz - zx - xy} \ge \frac{1}{2(x^2 + y^2 + z^2)} \\ &\ge \frac{1}{2(9n^6 + 9n^6 + 9n^6)} = \frac{1}{54n^6}, \end{aligned}
and the proof is complete.

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 translated into English from zh; metadata (topic, difficulty) added by this project.