Stack Exchange Network

Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

Questions tagged [inequality]

Questions on proving, manipulating and applying inequalities.

43
votes
12answers
6k views

How to prove that $\log(x)<x$ when $x>1$?

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 ...
45
votes
3answers
3k views

How do you prove Gautschi's inequality for the gamma function?

A few answers here on math.SE have used as an intermediate step the following inequality that is due to Walter Gautschi: $$x^{1-s} < \frac{\Gamma(x+1)}{\Gamma(x+s)} < (x+1)^{1-s},\qquad x > ...
80
votes
4answers
122k views

Reverse Triangle Inequality Proof

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|-|...
26
votes
6answers
5k 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?
80
votes
18answers
19k 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 ...
79
votes
11answers
10k views

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

How can I calculate, without calculator or similar device, the values of $\pi^e$ and $e^\pi$ in order to compare them?
12
votes
1answer
4k 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 sequence in $\...
43
votes
8answers
17k views

How to prove and interpret $\operatorname{rank}(AB) \leq \operatorname{min}(\operatorname{rank}(A), \operatorname{rank}(B))$?

Let $A$ and $B$ be two matrices which can be multiplied. Then $$\operatorname{rank}(AB) \leq \operatorname{min}(\operatorname{rank}(A), \operatorname{rank}(B)).$$ I proved $\operatorname{rank}(AB) \...
77
votes
24answers
13k views

Simplest or nicest proof that $1+x \le e^x$

The elementary but very useful inequality that $1+x \le e^x$ for all real $x$ has a number of different proofs, some of which can be found online. But is there a particularly slick, intuitive or ...
17
votes
4answers
7k views

Is the Euler phi function bounded below?

I am working on a question for my number theory class that asks: Prove that for every integer $n \geq 1$, $\phi(n) \geq \frac{\sqrt{n}}{\sqrt{2}}$. However, I was searching around Google, and on ...
38
votes
9answers
121k views

Proof of triangle inequality

I understand intuitively that this is true, but I'm embarrassed to say I'm having a hard time constructing a rigorous proof that $|a+b| \leq |a|+|b|$. Any help would be appreciated :)
7
votes
1answer
711 views

Show that $\left|\frac{\alpha - \beta}{1-\bar{\alpha}\beta}\right| < 1$ when $|\alpha|,|\beta| < 1$

This is the question I'm stumbling with: When $|\alpha| < 1$ and $|\beta| < 1$, show that: $$\left|\cfrac{\alpha - \beta}{1-\bar{\alpha}\beta}\right| < 1$$ The chapter that contains this ...
38
votes
4answers
13k views

Purely “algebraic” proof of Young's Inequality

Young's inequality states that if $a, b \geq 0$, $p, q > 0$, and $\frac{1}{p} + \frac{1}{q} = 1$, then $$ab\leq \frac{a^p}{p} + \frac{b^q}{q}$$ (with equality only when $a^p = b^q$). Back when I ...
23
votes
2answers
19k views

Proof of upper-tail inequality for standard normal distribution

$X \sim \mathcal{N}(0,1)$, then to show that for $x > 0$, $$ \mathbb{P}(X>x) \leq \frac{\exp(-x^2/2)}{x \sqrt{2 \pi}} \>. $$
34
votes
7answers
19k views

prove that $\frac{(2n)!}{(n!)^2}$ is even if $n$ is a positive integer

Prove that $\frac{(2n)!}{(n!)^2}$ is even if $n$ is a positive integer. For clarity: the denominator is the only part being squared. My thought process: The numerator is the product of the ...
18
votes
2answers
15k views

Prove the inequality $n! \geq 2^n$ by induction

I'm having difficulty solving an exercise in my course. The question is: Prove that $n!\geq 2^n$. We have to do this by induction. I started like this: The lowest natural number where the ...
13
votes
6answers
6k views

Proving $\sum\limits_{k=1}^{n}{\frac{1}{\sqrt{k}}\ge\sqrt{n}}$ with induction

I am just starting out learning mathematical induction and I got this homework question to prove with induction but I am not managing. $$\sum\limits_{k=1}^{n}{\frac{1}{\sqrt{k}}\ge\sqrt{n}}$$ ...
42
votes
2answers
12k views

How do you show that $l_p \subset l_q$ for $p \leq q$?

I can't seem to work out the inequality $(\sum |x_n|^q)^{1/q} \leq (\sum |x_n|^p)^{1/p}$ for $p \leq q$ (which I'm assuming is the way to go about it).
5
votes
18answers
10k views

How to prove this inequality $ x + \frac{1}{x} \geq 2 $

I was asked to prove that: $$x + \frac{1}{x}\geqslant 2$$ for all values of $ x > 0 $ I tried substituting random numbers into $x$ and I did get the answer greater than $2$. But I have a ...
24
votes
1answer
2k views

Prove that $(p+q)^m \leq p^m+q^m$

If $p,q$ are positive quantities and $0 \leq m\leq 1$ then Prove that $$(p+q)^m \leq p^m+q^m$$ Trial: For $m=0$, $(p+q)^0=1 < 2= p^0+q^0$ and for $m=1$, $(p+q)^1=p+q =p^1+q^1$. So, For $m=0,1$ ...
12
votes
6answers
3k views

How to prove $a^2 + b^2 + c^2 \ge ab + bc + ca$?

How can the following inequation be proven? $$a^2 + b^2 + c^2 \ge ab + bc + ca$$
14
votes
2answers
1k views

If $\sigma_n=\frac{s_1+s_2+\cdots+s_n}{n}$ then $\operatorname{{lim sup}}\sigma_n \leq \operatorname{lim sup} s_n$

This is a question from the book Methods of Real Analysis by R. R. Goldberg. If $(s_n)$ is a sequence of real numbers and if $$\sigma_n=\frac{s_1+s_2+\cdots+s_n}{n}$$ then prove that: $\...
6
votes
7answers
2k views

Show that if $n>2$, then $(n!)^2>n^n$.

Show that if $n>2$, then $(n!)^2>n^n$. My work: I tried to apply induction. So, at the induction step, I need to prove, $n^n>(n+1)^{n-1}$ Here, I tried to use induction again without any ...
15
votes
4answers
15k views

lim sup inequality $\limsup ( a_n b_n ) \leq \limsup a_n \limsup b_n $

I´m not sure how to start with this proof, how can I do it? $$ \limsup ( a_n b_n ) \leqslant \limsup a_n \limsup b_n $$ I also have to prove, if $ \lim a_n $ exists then: $$ \limsup ( a_n b_n ) = ...
25
votes
5answers
44k views

How to prove $\text{Rank}(AB)\leq \min(\text{Rank}(A), \text{Rank}(B))$? [duplicate]

How to prove $\text{Rank}(AB)\leq \min(\text{Rank}(A), \text{Rank}(B))$?
14
votes
4answers
8k views

Showing the inequality $|\alpha + \beta|^p \leq 2^{p-1}(|\alpha|^p + |\beta|^p)$

I have a small question that I think is very basic but I am unsure how to tackle since my background in computing inequalities is embarrasingly weak - I would like to show that, for a real number $p ...
31
votes
4answers
19k views

Prove $\limsup\limits_{n \to \infty} (a_n+b_n) \le \limsup\limits_{n \to \infty} a_n + \limsup\limits_{n \to \infty} b_n$

I am stuck with the following problem. Prove that $$\limsup_{n \to \infty} (a_n+b_n) \le \limsup_{n \to \infty} a_n + \limsup_{n \to \infty} b_n$$ I was thinking of using the triangle inequality ...
14
votes
1answer
935 views

Could this approximation be made simpler ? Solve $n!=a^n 10^k$

I need to find the smallest value of $n$ such that $$\frac{a^n}{n!}\leq 10^{-k}$$ in which $a$ and $k$ are given (these can be large numbers). I set the problem as : solve for $n$ the equation $$n!...
34
votes
6answers
2k views

Proving : $ \bigl(1+\frac{1}{n+1}\bigr)^{n+1} \gt (1+\frac{1}{n})^{n} $

How could we prove that this inequality holds $$ \left(1+\frac{1}{n+1}\right)^{n+1} \gt \left(1+\frac{1}{n} \right)^{n} $$ where $n \in \mathbb{N}$, I think we could use the AM-GM inequality for ...
10
votes
5answers
7k views

How do you prove ${n \choose k}$ is maximum when $k$ is $ \lceil \tfrac n2 \rceil$ or $ \lfloor \tfrac n2\rfloor $?

How do you prove $n \choose k$ is maximum when $k$ is $\lceil n/2 \rceil$ or $\lfloor n/2 \rfloor$? This link provides a proof of sorts but it is not satisfying. From what I understand, it focuses on ...
17
votes
10answers
9k views

Prove by induction that for all $n \geq 3$: $n^{n+1} > (n+1)^n$

I am currently helping a friend of mine with his preperations for his next exam. A big topic of the exam will be induction, thus I told him he should practice this a lot. As at the beginning he had no ...
9
votes
5answers
2k views

Proving the AM-GM inequality for 2 numbers $\sqrt{xy}\le\frac{x+y}2$

I am having trouble with this problem from my latest homework. Prove the arithmetic-geometric mean inequality. That is, for two positive real numbers $x,y$, we have $$ \sqrt{xy}≤ \frac{x+y}{2} .$$ ...
12
votes
3answers
739 views

Prove $(a_1+b_1)^{1/n}\cdots(a_n+b_n)^{1/n}\ge \left(a_1\cdots a_n\right)^{1/n}+\left(b_1\cdots b_n\right)^{1/n}$

consider positive numbers $a_1,a_2,a_3,\ldots,a_n$ and $b_1,b_2,\ldots,b_n$. does the following in-equality holds and if it does then how to prove it $\left[(a_1+b_1)(a_2+b_2)\cdots(a_n+b_n)\right]^{...
13
votes
6answers
37k views

Proof that $n^2 < 2^n$

How do I prove the following statement by induction? $$n^2 \lt 2^n$$ $P(n)$ is the statement $n^2 \lt 2^n$ Claim: For all $n \gt k$, where $k$ is any integer, $P(n)$ (since $k$ is any integer, I ...
17
votes
2answers
4k views

Show $\operatorname{rank}(A) + \operatorname{rank}(B) \ge \operatorname{rank}(A+B)$

Show $\operatorname{rank}(A) + \operatorname{rank}(B) \ge \operatorname{rank}(A+B)$, where $A,B \in M_{m\times n}(\mathbb{F})$. I'm trying to think in terms of linear transformations. We can define $...
1
vote
7answers
276 views

Proof that $\left(\sum^n_{k=1}x_k\right)\left(\sum^n_{k=1}y_k\right)\geq n^2$

If $x_1,...,x_n$ are positive real numbers and if $y_k=1/x_k$, prove that $$\left(\sum^n_{k=1}x_k\right)\left(\sum^n_{k=1}y_k\right)\geq n^2.$$ I've been learning induction, and I've come across this ...
23
votes
3answers
23k views

Intuition behind logarithm inequality: $1 - \frac1x \leq \log x \leq x-1$

One of fundamental inequalities on logarithm is: $$ 1 - \frac1x \leq \log x \leq x-1 \quad\text{for all $x > 0$},$$ which you may prefer write in the form of $$ \frac{x}{1+x} \leq \log{(1+x)} \leq ...
16
votes
6answers
25k views

how to strictly prove $\sin x<x$ for $0<x<\frac{\pi}{2}$

$$\sin x<x\,(0<x<\frac{\pi}{2})$$ In most textbooks, to prove this inequality is based on geometry illustration (draw a circle, compare arc length and chord ), but I think that strict proof ...
16
votes
2answers
14k views

Properties of $\liminf$ and $\limsup$ of sum of sequences: $\limsup s_n + \liminf t_n \leq \limsup (s_n + t_n) \leq \limsup s_n + \limsup t_n$

Let $\{s_n\}$ and $\{t_n\}$ be sequences. I've noticed this inequality in a few analysis textbooks that I have come across, so I've started to think this can't be a typo: $\limsup\limits_{n \...
17
votes
12answers
16k views

Prove that $ n < 2^{n}$ for all natural numbers $n$. [duplicate]

Prove that $ n < 2^{n} $ for all natural numbers $n$. I tried this with induction: Inequality clearly holds when $n=1$. Supposing that when $n=k$, $k<2^{k}$. Considering $k+1 <2^{k}+1$, ...
6
votes
4answers
1k views

Show that, for all $n > 1: \frac{1}{n + 1} < \log(1 + \frac1n) < \frac1n.$ [duplicate]

I'm learning calculus, specifically derivatives and applications of MVT, and need help with the following exercice: Show that, for all $n > 1$ $$\frac{1}{n + 1} < \log(1 + \frac1n) < \...
30
votes
2answers
11k views

On the equality case of the Hölder and Minkowski inequalites

I'm following the book Measure and Integral of Richard L. Wheeden and Antoni Zygmund. This is the problem 4 of chapter 8. Consider $E\subseteq \mathbb{R}^n$ a measurable set. In the following all the ...
4
votes
4answers
4k views

Proving inequality $(a+\frac{1}{a})^2 + (b+\frac{1}{b})^2 \geq \frac{25}{2}$ for $a+b=1$

If $a, b$ are positive real numbers and $a+b = 1$, prove that : $$\left(a+\frac{1}{a}\right)^2 + \left(b+\frac{1}{b}\right)^2 \geq \frac{25}{2}$$ I can see that the value $\frac{25}2$ is attained ...
5
votes
2answers
1k views

Mean Value Theorem: $\frac{2}{\pi}<\frac{\sin x}{x}<1$

I need to show that $\dfrac{2}{\pi}<\dfrac{\sin(x)}{x}<1$ for $0<x<\dfrac{\pi}{2}$. I know I need to use the mean value theorem, would I just say that since $f$ is continuous in the ...
32
votes
6answers
18k views

Sylvester rank inequality: $\operatorname{rank} A + \operatorname{rank}B \leq \operatorname{rank} AB + n$

If $A$ and $B$ are two matrices of the same order $n$, then $$ \operatorname{rank} A + \operatorname{rank}B \leq \operatorname{rank} AB + n. $$ I don't know how to start proving this inequality. I ...
17
votes
1answer
4k views

Factorial Inequality problem $\left(\frac n2\right)^n > n! > \left(\frac n3\right)^n$

I met an inequality, I ask, do not mathematical induction to prove that: Prove \[ \left(\frac n2\right)^n > n! > \left(\frac n3\right)^n \] without using induction
11
votes
4answers
2k views

$X_n\leq Y_n$ implies $\liminf X_n \leq \liminf Y_n$ and $\limsup X_n \leq \limsup Y_n$

Can anyone prove this question? I tried but I didn't get any I idea, so I hope someone can solve it. Let $X_n\leq Y_n$ for each $n\in \Bbb N$. Show that $\liminf X_n \leq \liminf Y_n$ and $\limsup ...
1
vote
2answers
260 views

In $ \triangle ABC$ show that $ 1 \lt \cos A + \cos B + \cos C \le \frac 32$

Here is what I did, tell me whether I did correct or not: \begin{align*} y &= \cos A + \cos B + \cos C\\ y &= \cos A + 2\cos\left(\frac{B+C}2\right)\cos\left(\frac {B-C}2\right)\\ y &= \...
9
votes
4answers
4k views

Proving that $x - \frac{x^3}{3!} < \sin x < x$ for all $x>0$

Prove that $x - \frac{x^3}{3!} < \sin(x) < x$ for all $x>0$ This should be fairly straightforward but the proof seems to be alluding me. I want to show $x - \frac{x^3}{3!} < \sin(x) &...
30
votes
25answers
32k views

How can I prove that $xy\leq x^2+y^2$? [closed]

How can I prove that $xy\leq x^2+y^2$ for all $x,y\in\mathbb{R}$ ?