Show $\frac{x_1}{x_n} + \frac{x_2}{x_{n-1}} + \frac{x_3}{x_{n-2}} + \dots + \frac{x_n}{x_1} \geq n$

By the AM-GM inequality, we have $$\frac{x_1/x_n+x_2/x_{n-1}+\cdots+x_n/x_1}{n}\geq\sqrt[n]{\frac{x_1}{x_n}\frac{x_2}{x_{n-1}}\cdots\frac{x_n}{x_1}}=\sqrt[n]{1}=1.$$

HINT: Use AM-GM inequality for real positive $a_i$s (where $1\le i\le n$)

$$\frac{\sum_{1\le r\le n} a_i}n\ge \sqrt[n]{\prod_{ 1\le r\le n}a_i}$$

Dude. You shouldn't need all those fancy things. Just pair up each $\frac{x_i}{x_{n-i}} + \frac{x_{n-i}}{x_i}$ and examine each of those separately. Take into account even $n$ and odd $n$, since there'll be an unpaired fraction when $n$ is odd.

Spoiler:

When $n$ is odd, identify what the unpaired fraction is, then it's value will be obvious.

HINT: Rearrangement inequality (http://en.wikipedia.org/wiki/Rearrangement_inequality).

For some permutation $(i_1,i_2,\cdots,i_n)$ of $(1,2,\cdots,n)$, the following holds: $$x_{i_1}\ge x_{i_2}\ge \dots\ge x_{i_{n-1}}\ge x_{i_n}(>0),$$ $$\frac1{x_{i_n}}\ge \frac1{x_{i_{n-1}}}\ge \dots \ge \frac1{x_{i_2}}\ge \frac1{x_{i_1}}.$$

It follows from the rearrangement inequality that $$x_1\cdot \frac1{x_n}+x_2\cdot\frac1{x_{n-1}}+\dots+x_n\cdot\frac1{x_1} \ge x_{i_1}\cdot \frac1{x_{i_1}}+x_{i_2}\cdot\frac1{x_{i_2}}+\dots+x_{i_n}\cdot\frac1{x_{i_n}}=n.$$

(Intuitive approach with an hidden use of AM-GM)If $n$ is even you can put togheter couples which are equidistant from $n/2$ and then $x_i/x_{n+1-i}+x_{n+1-i}/x_i \geq2$ (and you have $n/2$ of such couples); if n is odd it's almost the same since you'll have a central 1.