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
4
votes
2 answers

Prove that if $a$,$b$,$c$ are non-negative real numbers such that $a+b+c =3$, then $abc(a^2 + b^2 + c^2)\leq 3$

Prove that if $ a,b,c $ are non-negative real numbers such that $a+b+c = 3$, then $$ abc(a^2 + b^2 + c^2) \le 3 $$ My attempt : I tried AM-GM inequality, tried to convert it to $a+b+c$, but I think I cannot get the manipulation of $abc$.
novak
  • 275
4
votes
3 answers

Elementary Proof that $x^x \geq x!$

Is there an elementary proof that $x^x \geq x!$ for natural numbers $x$? I am not looking for a heuristic argument such as the one that there are $x$ terms in $x^x$ and $x!$ and since almost every term in $x \times x \times .... \times x$ is greater…
user191837
4
votes
1 answer

Please help me to prove the following inequality

Let $a_i\geq0$ for all $i\in\{1,2,...,n\}$ with $\sum_{i=1}^na_i=1$. Suppose $x_1,x_2,...,x_n$ are non-negative reals. Show that $(\sum_{i=1}^na_i^2x_i^2)(\sum_{i=1}^n\dfrac{1}{x_i^2})\leq\dfrac{(z_{\min}+z_{\max})^2}{4z_{\min}z_{\max}}$ where…
Landon Carter
  • 12,906
  • 4
  • 32
  • 79
4
votes
2 answers

Show that: $\frac{1}{1+\log_ab+\log_bc}+\frac{1}{1+\log_bc+\log_ca}+\frac{1}{1+\log_ca+\log_ab}\leq1$

Let $a, b, c>1$. Show that: $$\frac{1}{1+\log_ab+log_bc}+\frac{1}{1+\log_bc+\log_ca}+\frac{1}{1+\log_ca+\log_ab}\leq1.$$ My attempt: We noted $\log_bc=x, \log_ca=y, \log_ab=z$ with $xyz=1$ and we have reduced inequality at this…
medicu
  • 4,482
4
votes
1 answer

How prove this inequality $(y-z)^2>8(y+z)$

For three distinct postive integer $x,y,z$ such $$(x+y)(x+z)=(y+z)^2$$ show that $$(y-z)^2>8(y+z)$$ My some idea: since $$x^2+(y+z)x+yz-(y+z)^2=0$$ so $$\Delta_{x}=(y+z)^2-4yz+4(y+z)^2=5(y+z)^2-4yz=m^2$$then I can't
math110
  • 93,304
4
votes
1 answer

How prove this inequality $\sum\limits_{cyc}(a^2b+ab)\le 6$

let $a,b,c> 0$ and such $a+b+c=3$ show that $$a^2b+b^2c+c^2a+ab+bc+ac\le 6?$$ I can't find counterexample, maybe it is true. Then how prove it? And I know $$(a^2b+b^2c+c^2a)\le 4,a+b+c=3$$ see:Proving the inequality $4\ge a^2b+b^2c+c^2a+abc$ But…
math110
  • 93,304
4
votes
1 answer

Strange algebraic inequality

Let $x, y, z$ be real numbers such that $-1< x + y + z < 1$ and $x^2 + y^2 + z^2 < 1$. Prove the inequality or give a counter example: $$(x^2 + 2yz)^2 + (y^2 + 2xz)^2 + (z^2 + 2xy)^2 < 1$$ I do not know if it is true or not.
Vlad
  • 63
4
votes
2 answers

Find the minimum possible value of $x(1-z)+y(1-x)+z(1-y)$

It is given that $$xyz=(1-x)(1-y)(1-z)$$ and $$x, y, z \in (0,1)$$ Find the minimum possible value of the expression: $$x(1-z)+y(1-x)+z(1-y)$$ Using the AM-GM inequality concepts, I can write that the value is minimum when…
Shubham
  • 880
4
votes
2 answers

Proving the inequality $\frac{9}4\ + \frac{3abc}4\ \ge ab+bc+ca$

If a,b,c are non-negative real numbers for which holds that $a+b+c=3$ then prove the following inequality: $$\frac{9}4\ + \frac{3abc}4\ \ge ab+bc+ca$$
CryoDrakon
  • 3,392
4
votes
1 answer

Prove that $a+b+c \geq \frac{3}{a+b+c}+\frac{2}{abc}$

Given $a,b,c>0$ such that $$a+b+c \geq \frac{1}{a}+\frac{1}{b}+\frac{1}{c}.$$ Prove that $$a+b+c \geq \frac{3}{a+b+c}+\frac{2}{abc}.$$
Phi Linh
  • 193
4
votes
1 answer

Connection between some inequalities

Let $I \subset \mathbb{R}$ be an interval, $f: I \rightarrow \mathbb{R}$ be a function and let $n \geq 2, n \in \mathbb{N}$ be fixed number. Let's consider the following conditions: $\displaystyle f\left(\frac{x_1+x_2}{2}\right) \leq…
Alex
  • 129
3
votes
7 answers

How can I prove $(a+b+c)!>a!b!c!$

In fact, I couldn't prove the inequality because I don't know which method is used for this. The condition for this inequality is $$(a+b+c)>1$$
E.H.E
  • 23,280
3
votes
1 answer

$ (1+\sin{x})^{\cos{x}} + (1+\cos{x})^{\sin{x}} > 3x $

How do I show that, for $ 0 < x < \dfrac{\pi}{4} $ (first quadrant), the inequality $ (1+\sin{x})^{\cos{x}} + (1+\cos{x})^{\sin{x}} > 3x $ is valid? I've tried Bernoulli's, but it took me to a false inequality (though all restrictions were…
3
votes
5 answers

How prove this $xyzw>0$

let $x,y,z,w\neq 0$ are real numbers,and such $$x+y+z+w=\dfrac{1}{x}+\dfrac{1}{y}+\dfrac{1}{z}+\dfrac{1}{w}=0$$ show that $$xyzw>0$$ My idea: let…
math110
  • 93,304
3
votes
3 answers

A surprisingly resistant elementary numerical inequality

Let $a$ and $b$ be real numbers such that $a\geq 1$ and $b$ lies in the interval $[0,a-1]$. How can I then prove that $$(a-b)^{a-b}\geq a^{-b-a}\quad ?$$ This innocent looking inequality seems tougher than I tought: I tried different methods, but…
user19053