Questions tagged [inequality]

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

An inequality is a mathematical relation between two quantities that are not necessarily equal, but bigger or smaller.

To prove inequalities, a number of proven inequalities can be used, including:

  • The AM-GM inequality

    Let $x_i>0$, $\alpha_i>0$ such that $\alpha_1+\alpha_2+...+\alpha_n=1$. Prove that $$\alpha_1x_1+\alpha_2x_2+...+\alpha_nx_n\geq x_1^{\alpha_1}x_2^{\alpha_2}...x_n^{\alpha_n}$$

For $\alpha_1=\alpha_2=...=\alpha_n=\frac{1}{n}$ we obtain the well-known $$\frac{x_1+x_2+\cdots+x_n}{n} \ge \sqrt[n]{x_1x_2\cdots x_n}$$

  • The Power Mean inequality (P-M).

    Let $a_1, a_2,\cdots, a_n$ be positive numbers and $p>q$. Then $$\left(\frac{a_1^p+a_2^p+\cdots+a_n^p}{n}\right)^{\frac{1}{p}} \geq \left(\frac{a_1^q+a_2^q+\cdots+a_n^q}{n}\right)^{\frac{1}{q}}$$

  • The Rearrangement inequality (R).

    Let $a_1\le\dots\le a_n$ and $b_1\le\dots\le b_n$. For all permutations $\sigma\in S_n$, $$\sum_{i=1}^na_ib_{n-i+1}\le\sum_{i=1}^na_ib_{\sigma(i)}\leq\sum_{i=1}^na_ib_i.$$

The rearrangement generalizes similar for more than two sequences of numbers.

  • The Cauchy-Schwarz inequality (C-S).

    If $a_1, a_2, \cdots, a_n$ and $b_1, b_2,\cdots, b_n$ are two sequences of real numbers, then $$\sum^{n}_{i=1} a_i^2 \sum^{n}_{i=1} b_i^2\geq\left(\sum^{n}_{i=1} a_ib_i \right)^2$$

  • The H$\ddot o$lder inequality (H).

    Let $a_1$, $a_2$,..., $a_n$, $b_1$, $b_2$,..., $b_n$, $\alpha$ and $\beta$ be positive numbers. Then $$\left(\sum_{i =1}^n a_i\right )^\alpha \left(\sum_{i =1}^n b_i \right )^\beta\geq \left(\sum_{i =1}^n (a_ib_i)^\frac{1}{\alpha+\beta}\right )^{\alpha+\beta} $$

  • The Schur inequalities (S):

    Let $x$, $y$ and $z$ be positive numbers and $t$ is a real number. Prove that:$$x^t(x-y)(x-z)+y^t(y-z)(y-x)+z^t (z-x)(z-y)\ge 0$$

  • Muirhead inequalities

    A sequence $a_1 \geq a_2 \geq \dots \geq a_n$ majorizes a sequence $b_1 \geq b_2 \geq \dots \geq b_n$ if $$\sum_{i=1}^k a_i \geq\sum_{i=1}^k a_i $$ for all $1\leq k < n$ and $$\sum_{i=1}^n a_i =\sum_{i=1}^n a_i $$ If sequence $(a_i)$ majorizes $(b_i)$ (notated as $a_i \succ b_i$), then $$\sum_{\text{sym}}x_1^{a_1}x_2^{a_2}\dots x_n^{a_n}\geq \sum_{\text{sym}}x_1^{b_1}x_2^{b_2}\dots x_n^{b_n}$$

30160 questions
15
votes
5 answers

Suppose $xyz=8$, try to prove that $\sqrt{\frac{1}{1+x}}+\sqrt{\frac{1}{1+y}}+\sqrt{\frac{1}{1+z}}<2$

Who can help with the following inequality? I can prove it but using some rather ugly approach (e.g. by leveraging the derivative of $\frac{1}{\sqrt{t+1}}+\frac{1}{2}\sqrt{1-\frac{8}{t^2+8}}$ to show this is always less than 1 for $t>0$. I'm just…
user85356
  • 388
15
votes
7 answers

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$

I was recently asked this question which stumped me. How can you show $\dfrac{x_1}{x_n} + \dfrac{x_2}{x_{n-1}} + \dfrac{x_3}{x_{n-2}} + \dots + \dfrac{x_n}{x_1} \geq n$ for any positive reals $x_1, x_2, \dots, x_n$?
marshall
  • 729
  • 7
  • 22
15
votes
2 answers

How to find $1+\dfrac{1}{a_{1}}+\dfrac{1}{a_{2}}+\cdots+\dfrac{1}{a_{n}}$

Let $a_{i}>0,i=1,2,\cdots,n$, If $$1+\dfrac{1}{a_{1}}+\dfrac{1}{a_{2}}+\cdots+\dfrac{1}{a_{n}}\ge k\;\left(\dfrac{1}{\sqrt{1+a^2_{1}}}+\dfrac{1}{\sqrt{1+a^2_{1}+a^2_{2}}}+\cdots+\dfrac{1}{\sqrt{1+a^2_{1}+\cdots+a^2_{n}}}\right)$$ then find the…
math110
  • 93,304
15
votes
1 answer

Prove that there are four distinct real number $x,y,z,w$,such $|xz+yw|\ge |\sqrt{5}(xw-yz)|$

For any nine distinct real numbers,there exsit four distinct real number $x,y,z,w$,such $$|xz+yw|\ge |\sqrt{5}(xw-yz)|$$ I think can use pigeonhole principle to solve it?Thanks
math110
  • 93,304
15
votes
2 answers

How can one prove that $\pi^4 + \pi^5 < e^6$?

A proof of the inequality using properties of $\pi$ and $e$, for example, is what I'm looking for. Not calculator approximations showing the inequality holds.
Acid2
  • 577
15
votes
4 answers

Inequality $a+b+c \geqslant abc +2$

Assuming $a,b,c \in (0, \infty)$, we need to prove that: $$a+b+c \geqslant a b c+2 \quad \text{if} \quad ab+bc+ca=3$$ Can you give me an idea, please? This inequality seem to be known, but I didn't manage to solve it.
Iuli
  • 6,790
15
votes
6 answers

Prove $\sum\limits_{cyc}\left(\frac{a^4}{a^3+b^3}\right)^{\frac34} \geqslant \frac{a^{\frac34}+b^{\frac34}+c^{\frac34}}{2^{\frac34}}$

When $a,b,c > 0$, prove $$\left(\frac{a^4}{a^3+b^3}\right)^{\frac34}+\left(\frac{b^4}{b^3+c^3}\right)^ {\frac34}+\left(\frac{c^4}{c^3+a^3}\right)^{\frac34} \geqslant \frac{a^{\frac34}+b^{\frac34}+c ^{\frac34}}{2^{\frac34}}$$ I tried the substitution…
HN_NH
  • 4,361
15
votes
3 answers

if $x^y=y^x$ show that $x+y>2e$

Let $02e$$ Since $$y\ln{x}=x\ln{y}\Longrightarrow \dfrac{\ln{y}}{y}=\dfrac{\ln{x}}{x}$$ Let $$f(x)=\dfrac{\ln{x}}{x}\Longrightarrow f'(x)=\dfrac{1-\ln{x}}{x^2}$$ If $00$, if…
partofsha
  • 294
15
votes
2 answers

This general inequality maybe is true? $\sum_{i=1}^{n}\frac{i}{1+a_{1}+\cdots+a_{i}}<\frac{n}{2}\sqrt{\sum_{i=1}^{n}\frac{1}{a_{i}}}$

Let $a_{1},a_{2},\ldots,a_{n}>0$ and prove or disprove $$\dfrac{1}{1+a_{1}}+\dfrac{2}{1+a_{1}+a_{2}}+\cdots+\dfrac{n}{1+a_{1}+a_{2}+\cdots+a_{n}}\le\dfrac{n}{2}\sqrt{\dfrac{1}{a_{1}}+\dfrac{1}{a_{2}}+\cdots+\dfrac{1}{a_{n}}}\tag{1}$$ This…
math110
  • 93,304
15
votes
6 answers

Proving $(1 + 1/n)^{n+1} \gt e$

I'm trying to prove that $$ \left(1 + \frac{1}{n}\right)^{n+1} > e $$ It seems that the definition of $e$ is going to be important here but I can't work out what to do with the limit in the resulting inequality.
15
votes
3 answers

About the Polya-Knopp-like inequality $\sum_{k=1}^{n}\frac{k^2}{a^2_{1}+\cdots+a^2_{k}}\le\left(\frac{1}{a_{1}}+\cdots+\frac{1}{a_{n}}\right)^2$

I was inspired by other question I came out with the inequality: let $a_{i}>0,i=1,2,\cdots,n$ Prove that $$\sum_{k=1}^{n}\dfrac{k^2}{a^2_{1}+\cdots+a^2_{k}}\le\left(\dfrac{1}{a_{1}}+\cdots+\dfrac{1}{a_{n}}\right)^2\tag{1}$$ and I believe that (1)…
14
votes
3 answers

Prove that $e^{\sum 1/p_k^2} > \pi/2$

The $k$th prime is $p_k.$ Prove (if inclined, and without a machine) that $$\exp\left({\sum_{k=1}^{\infty}\frac1{p_k^2}}\right) > \frac{\pi}{2} $$
daniel
  • 10,141
14
votes
4 answers

Prove that $\left(1+2^{-1+b^{\left(\frac{1}{b-1}\right)}}\right)^b < 1+2^{-1+b^{\left(\frac{b}{b-1}\right)}}$ for all $b>2$.

While solving a bigger problem, I've reduced it to an inequality $$\left(1+2^{-1+b^{\left(\frac{1}{b-1}\right)}}\right)^b < 1+2^{-1+b^{\left(\frac{\color{red}b}{b-1}\right)}}$$for $b>2$, which looks plausible when looking at the plots. I've tried…
Jakobian
  • 10,247
14
votes
1 answer

Prove inequality$\sum\limits_{n|i+j+k}x_{i}y_{j}z_{k}\le n^2$

Being given an integer $n\ge 2$, and $x_{i},y_{i},z_{i}\in \mathbb{R}$ ($i=1,2,\cdots,n$) such that $$\sum_{i=1}^{n}(x^3_{i}+y^3_{i}+z^3_{i})=3n$$ show that $$\sum_{i+j+k=n}x_{i}y_{j}z_{k}\le n^2.$$ I know $a^3+b^3+c^3\ge 3abc$ if $a+b+c\ge 0$.
math110
  • 93,304
14
votes
2 answers

$a^{|b-a|}+b^{|c-b|}+c^{|a-c|} > \frac52$ for $a,b,c >0$ and $a+b+c=3$

Let $a,b,c >0$ with $a+b+c=3$. Prove that $$a^{|b-a|}+b^{|c-b|}+c^{|a-c|} > \frac52.$$ What I did: It is cyclic inequality so I assume $c= \min\{ a,b,c \}$. I consider the first case where $a\ge b\ge c$ then $$a^{|b-a|}+b^{|c-b|}+c^{|a-c|} >…
HN_NH
  • 4,361