Show that there exists a positive constant C such that, for all positive reals a and b with a+b being an integer, we have {a3}+{b3}≤2−(a+b)6C.
Solution
We show that the claim holds when C=541:
Let n=a+b, and without loss of generality assume a≥b. Note that the function f(x)=x3 is an increasing convex function, so if a0+b0=n and a0−b0≥a−b, we have a3+b3≤a03+b03.(1) In particular, when ⌊a3⌋=⌊a03⌋ and ⌊b3⌋=⌊b03⌋, {a3}+{b3}≤{a03}+{b03}. So it suffices to consider the two cases {a3}→1− or {b3}=0. The latter is obvious: {a3}+{b3}<1<2−n6C. For the former, suppose (a+ε)3=k<n3 is a positive integer, in which case b=n−3k+ε. Since ε is sufficiently small, by (1), {a3}+{b3}=a3+b3−⌊a3⌋−⌊b3⌋≤k+(n−3k)3−(k−1)−⌊(n−3k)3⌋=1+{(n−3k)3}. So it suffices to prove 1+{(n−3k)3}≤2−n6C. If (n−3k)3 is an integer, the claim is obvious. If not, the above inequality is equivalent to n6C≤1−{(n−3k)3}={−(n−3k)3}=3n23k−3n3k2−m, where m=⌊3n23k−3n3k2⌋≥0. Consider the following identity (x+y+z)(x2+y2+z2−yz−zx−xy)=x3+y3+z3−3xyz, substituting x=3n23k, y=−3n3k2, z=−m gives 0<(1−{b3})(x2+y2+z2−yz−zx−xy)=27n3k(n3−k−m)−m3. Since the right-hand side is an integer, the left-hand side is at least 1. Therefore, from 3k<n and 0≤m≤3n23k<3n3, 1−{b3}≥x2+y2+z2−yz−zx−xy1≥2(x2+y2+z2)1≥2(9n6+9n6+9n6)1=54n61, 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.