If $a, b>0$ and n is a positive integer, prove that: $(1+\frac{a}{b})^n+(1+\frac{b}{a})^n\ge 2^{n+1}$
I solved it in the following way:
$(1+\frac{a}{b})^n+(1+\frac{b}{a})^n \ge (2\sqrt{\frac{a}{b}})^n+(2\sqrt{\frac{b}{a}})^n=2^n((\frac{a}{b})^n+(\frac{b}{a})^n)$
It is enough if $(\sqrt{\frac{a}{b}})^n+(\sqrt{\frac{b}{a}})^n\ge2$
If $n=1$:
$\sqrt{\frac{a}{b}}+\sqrt{\frac{b}{a}}\ge2$
$\frac{a}{b}+\frac{b}{a}+2\ge 4$ which holds true.
If it holds true for $n=k$:
If $b\ge a$: $(\sqrt{\frac{a}{b}})^k+(\sqrt{\frac{b}{a}})^k$
$(\sqrt{\frac{a}{b}})^{k+1}+\sqrt{\frac{a}{b}}*(\sqrt{\frac{b}{a}})^k\ge 2$
$(\sqrt{\frac{a}{b}})^{k+1}+(\sqrt{\frac{b}{a}})^{k-1}\ge 2$
And since $b\ge a$ We have that the original proposition holds true for k+1. Similarly, we prove that it is true if $a\ge b$. Hence because of induction, it holds true.
Could you please show some other methods of solving this question easier?
Use Mean power inequality: $$\frac{x^n+y^n}{2} \ge \left(\frac{x+y}{2}\right)^n, n>1$$ Then $$F=\frac{(1+a/b)^n+(1+b/a)^n}{2} \ge \left( \frac{2+a/b+b/a}{2} \right)^n$$ Further by AM-GM: $a/b+b/a \ge 2$, we get $F\ge 2^n$ and hence the result.