Number theoryDifficulty 6.8National olympiadProve it
Example 2 Let a,b be two distinct positive integers, and ab(a+b) is a multiple of a2+ab+b2. Prove: ∣a−b∣>3ab.
Solution
To prove that since ab(a+b) is divisible by a2+ab+b2, we first divide ab(a+b) by a2+ab+b2, obtaining ab(a+b)=(a2+ab+b2)a−a3
Thus, (a2+ab+b2)∣a3. Similarly, (a2+ab+b2)∣b3, meaning a2+ab+b2 is a common divisor of a3 and b3, so (a2+ab+b2)∣(a3,b3). (See (3) in Unit 2.) Also, (a3,b3)=(a,b)3 (see the note below), hence (a2+ab+b2)∣(a,b)3.
Let d=(a,b),a=a1d,b=b1d, then (1) becomes (a12+a1b1+b12)∣d. Therefore, d⩾a12+a1b1+b12, and more specifically, d>a1b1. Since a=b, the integers a1=b1, thus ∣a1−b1∣⩾1, leading to ∣a−b∣3=d3∣a1−b1∣3⩾d3>d2a1b1=ab
Thus, ∣a−b∣>3ab.
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.