Maths Olympiad Prep

Library / /181 of 520

Algebra Difficulty 6.2 National olympiad Prove it

Let mm be a positive integer. Prove that for all positive real numbers aa and bb the following holds:

(1+ab)m+(1+ba)m2m+1 \left(1+\frac{a}{b}\right)^{m}+\left(1+\frac{b}{a}\right)^{m} \geq 2^{m+1}

Solution

We use that x+1x2x+\frac{1}{x} \geq 2 for all xR>0x \in \mathbb{R}_{>0}. It holds that

(1+ab)m+(1+ba)m=i=0m(mi)(ab)i+i=0m(mi)(ba)i=i=0m(mi)((ab)i+(ba)i)=i=0m(mi)(aibi+biai)i=0m(mi)2=2m+1. \begin{aligned} \left(1+\frac{a}{b}\right)^{m}+\left(1+\frac{b}{a}\right)^{m} & =\sum_{i=0}^{m}\binom{m}{i}\left(\frac{a}{b}\right)^{i}+\sum_{i=0}^{m}\binom{m}{i}\left(\frac{b}{a}\right)^{i} \\ & =\sum_{i=0}^{m}\binom{m}{i}\left(\left(\frac{a}{b}\right)^{i}+\left(\frac{b}{a}\right)^{i}\right) \\ & =\sum_{i=0}^{m}\binom{m}{i}\left(\frac{a^{i}}{b^{i}}+\frac{b^{i}}{a^{i}}\right) \\ & \geq \sum_{i=0}^{m}\binom{m}{i} \cdot 2 \\ & =2^{m+1} . \end{aligned}

## Alternative solution.

Apply the inequality of the arithmetic and geometric means to 1 and ab\frac{a}{b}:

1+ab2ab 1+\frac{a}{b} \geq 2 \sqrt{\frac{a}{b}}

so

(1+ab)m(2ab)m \left(1+\frac{a}{b}\right)^{m} \geq\left(2 \sqrt{\frac{a}{b}}\right)^{m}

Similarly, of course,

(1+ba)m(2ba)m \left(1+\frac{b}{a}\right)^{m} \geq\left(2 \sqrt{\frac{b}{a}}\right)^{m}

Now we apply the inequality of the arithmetic and geometric means again:

(2ab)m+(2ba)m2(2ab)m(2ba)m=2m+1 \left(2 \sqrt{\frac{a}{b}}\right)^{m}+\left(2 \sqrt{\frac{b}{a}}\right)^{m} \geq 2 \sqrt{\left(2 \sqrt{\frac{a}{b}}\right)^{m} \cdot\left(2 \sqrt{\frac{b}{a}}\right)^{m}}=2^{m+1}

This proves the desired result.

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.