Maths Olympiad Prep

Library / /13 of 32

, 2010

Algebra Difficulty 5.2 AIME, harder Prove it Estonia

Find all pairs of integers (m,n)(m, n) such that for all positive real numbers xx and yy the inequality xm+ynxnymx^m + y^n \ge x^n y^m holds.

Solution

If m=0m = 0, then the inequality is 1+ynxn1 + y^n \ge x^n. This holds for all positive real numbers xx and yy iff n=0n = 0. Hence (0,0)(0, 0) is a solution.

Let now both mm and nn be different from zero. If the pair (m,n)(m, n) satisfies the condition, then substituting xx and yy by 1x\frac{1}{x} and 1y\frac{1}{y} we see that the pair (m,n)(-m, -n) also satisfies the condition. Hence we can assume without loss of generality that mnm \ge n and m0m \ge 0.

If m>nm > n, then by taking x=1x = 1 we get 1+ynym1 + y^n \ge y^m, which does not hold for yy large enough. Hence m=nm = n.

By taking x=y=4x = y = 4 we get 24m42m2 \cdot 4^m \ge 4^{2m} which does not hold for any positive integer mm. Therefore there are no more suitable pairs.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.