Maths Olympiad Prep

Library / /428 of 520

Number theory Difficulty 6.8 National olympiad Prove it

Example 2 Let a,ba, b be two distinct positive integers, and ab(a+b)ab(a+b) is a multiple of a2+ab+b2a^{2}+ab+b^{2}. Prove: ab>ab3|a-b|>\sqrt[3]{ab}.

Solution

To prove that since ab(a+b)a b(a+b) is divisible by a2+ab+b2a^{2}+a b+b^{2}, we first divide ab(a+b)a b(a+b) by a2+ab+b2a^{2}+a b+b^{2}, obtaining
ab(a+b)=(a2+ab+b2)aa3a b(a+b)=\left(a^{2}+a b+b^{2}\right) a-a^{3}

Thus, (a2+ab+b2)a3\left(a^{2}+a b+b^{2}\right) \mid a^{3}. Similarly, (a2+ab+b2)b3\left(a^{2}+a b+b^{2}\right) \mid b^{3}, meaning a2+ab+b2a^{2}+a b+b^{2} is a common divisor of a3a^{3} and b3b^{3}, so (a2+ab+b2)(a3,b3)\left(a^{2}+a b+b^{2}\right) \mid\left(a^{3}, b^{3}\right). (See (3) in Unit 2.) Also, (a3,b3)=(a,b)3\left(a^{3}, b^{3}\right)=(a, b)^{3} (see the note below), hence
(a2+ab+b2)(a,b)3.\left(a^{2}+a b+b^{2}\right) \mid(a, b)^{3} .

Let d=(a,b),a=a1d,b=b1dd=(a, b), a=a_{1} d, b=b_{1} d, then (1) becomes (a12+a1b1+b12)d\left(a_{1}^{2}+a_{1} b_{1}+b_{1}^{2}\right) \mid d. Therefore, da12+a1b1+b12d \geqslant a_{1}^{2}+a_{1} b_{1}+b_{1}^{2}, and more specifically, d>a1b1d > a_{1} b_{1}. Since aba \neq b, the integers a1b1a_{1} \neq b_{1}, thus a1b11\left|a_{1}-b_{1}\right| \geqslant 1, leading to
ab3=d3a1b13d3>d2a1b1=ab|a-b|^{3}=d^{3}\left|a_{1}-b_{1}\right|^{3} \geqslant d^{3}>d^{2} a_{1} b_{1}=a b

Thus, ab>ab3|a-b|>\sqrt[3]{a b}.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.