Number theoryDifficulty 5.3AIME, harderProve itBelarus
Prove that ∣a3−b5∣>4a+5b4 for any naturals a and b. (V. Bernik)
Solution
Multiplying the left-hand side of the required inequality by a3+b5, we obtain ∣a3−b5∣(a3+b5)=∣3a2−5b2∣. If ∣3a2−5b2∣=1 for some integers a and b, then either 3a2−5b2=1 or 3a2−5b2=−1. In the first case we have 3a2≡1(mod5), which is impossible since 3a2≡0(mod5), 3a2≡3(mod5) for a≡±1(mod5), and 3a2≡12≡2(mod5) for a≡±2(mod5).
In the second case we have −5b2≡(−1)(mod3), i.e. 5b2≡1(mod3), which is impossible since 5b2≡0(mod3) for b≡0(mod3), and 5b2≡5(mod3) for b≡±1.
Therefore, ∣3a2−5b2∣=1 for all integers a and b, hence ∣3a2−5b2∣≥2 for all integers a and b. So ∣a3−b5∣=a3+b5∣3a2−5b2∣≥a3+b52=2a3+2b54≥[23<4,25<5]≥4a+5b4 as required.
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 and solution reproduced as published; topic and difficulty added by this site.