# Questions tagged [inequality]

Questions on proving, manipulating and applying inequalities. Do not use this tag just because an inequality appears somewhere in your question.

3,996 questions
Filter by
Sorted by
Tagged with
23k views

### How to prove that $\log(x)<x$ when $x>1$? [duplicate]

It's very basic but I'm having trouble to find a way to prove this inequality $\log(x)<x$ when $x>1$ ($\log(x)$ is the natural logarithm) I can think about the two graphs but I can't find ...
• 2,487
98k views

### How to prove that exponential grows faster than polynomial?

In other words, how to prove: For all real constants $a$ and $b$ such that $a > 1$, $$\lim_{n\to\infty}\frac{n^b}{a^n} = 0$$ I know the definition of limit but I feel that it's not enough to ...
• 7,149
216k views

### Prove that $||x|-|y||\le |x-y|$

I've seen the full proof of the Triangle Inequality \begin{equation*} |x+y|\le|x|+|y|. \end{equation*} However, I haven't seen the proof of the reverse triangle inequality: \begin{equation*} ||x|-|...
• 2,378
10k views

### Inequality involving $\limsup$ and $\liminf$: $\liminf(a_{n+1}/a_n) \le \liminf a_n^{1/n} \le \limsup a_n^{1/n} \le \limsup(a_{n+1}/a_n)$

This may have been asked before, however I was unable to find any duplicate. This comes from pg. 52 of "Mathematical Analysis: An Introduction" by Browder. Problem 14: If $(a_n)$ is a ...
• 2,265
51k views

### Proofs of AM-GM inequality

The arithmetic - geometric mean inequality states that $$\frac{x_1+ \ldots + x_n}{n} \geq \sqrt[n]{x_1 \cdots x_n}$$ I'm looking for some original proofs of this inequality. I can find the usual ...
11k views

### Elementary central binomial coefficient estimates

How to prove that $\quad\displaystyle\frac{4^{n}}{\sqrt{4n}}<\binom{2n}{n}<\frac{4^{n}}{\sqrt{3n+1}}\quad$ for all $n$ > 1 ? Does anyone know any better elementary estimates? Attempt. We ...
4k views

• 259k
16k views

### Comparing $\pi^e$ and $e^\pi$ without calculating them

How can I compare (without calculator or similar device) the values of $\pi^e$ and $e^\pi$ ?
• 1,317
39k views

• 453
1k views

### Inductive Proof that $k!<k^k$, for $k\geq 2$.

Call $P(k): k!<k^k$, for $k\geq 2$ Test it out with 2, and it's true ($2<4$). Assume that $P(k)$ is true for some $k\geq2$. Then show that $P(k+1)$ is true. $P(k+1): (k+1)!<(k+1)^{k+1}$ ...
• 637