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

How can I prove this inequality: $\frac{a^2}{3}+b^2+c^2>ab+bc+ca$?

If $abc=1$ and $a^3>36$ prove that, $\frac{a^2}{3}+b^2+c^2>ab+bc+ca$ I tried to use the general proof method. $\frac{a^2}{3}+b^2+c^2-ab-bc-ca>0$ Symbolically notation: $\frac{a^2}{3}+b^2+c^2-ab-bc-ca>0 \Rightarrow(x+y+z+...)^2>0$ But, after trying…
MathLover
  • 429
6
votes
5 answers

Proof of $e^x (\ln x+\frac{1}{x})>\ln 8$

Prove that $$e^x \left(\ln x+\frac{1}{x}\right)>\ln 8$$ I found that the minimum of $e^x \left(\ln x+\frac{1}{x}\right)$ is close to $\ln 8$, then how do we prove that it's greater than $\ln 8$?
Pi Secant
  • 377
6
votes
4 answers

Proving this inequality $\left(1+\frac{1}{n}\right)^n < 3$

How would I prove this, particularly using a method using a geometric series and binomial coefficient. I'm having trouble giving a reason for $(\star)$ especially. This is what I did For $n=1$, LHS = $(1+1)^1 = 2 < 3$ = RHS. Thus, for…
6
votes
2 answers

An algebraic riddle: The king's chest full of bags of gold coins

Consider following riddle in short form: A king seeks a new treasurer and ask all the possible candidates the following question to check their logical abilities. "There is a chest in front of you. The chest holds bags which contain the same amount…
Bastian
  • 639
6
votes
3 answers

Prove or Disprove $(x+\frac{1}{x})^p-x^p-\frac{1}{x^p}\ge 2^p-2$

Let $p\in \mathbb R_{\geq2}$, $x>0$, prove or disprove $$\left(x+\dfrac{1}{x}\right)^p-x^p-\dfrac{1}{x^p}\ge 2^p-2$$ I can prove this for positive integers $p$ because we can use…
wightahtl
  • 739
  • 3
  • 12
6
votes
1 answer

An inequality involving $a_i, b_i$ such that $\sum_{i=1}^n a_i = \sum_{i=1}^n b_i = 1$

I am having the hardest time proving this inequality: Let $n$ be a natural number, and $a_1,a_2,\cdots,a_n$ and $b_1, b_2, ..., b_n$ be nonnegative numbers such that $\sum_{i=1}^n a_i = \sum_{i=1}^n b_i = 1$. Then $$\sum_{i=1}^n \sqrt{a_i b_i}…
VividD
  • 15,966
6
votes
1 answer

$\frac{a+b}{b+c} + \frac{c+d}{d+a} ≤ 4(\frac{a+c}{b+d}) ; a , b , c , d ∈ [1 , 2]$

Is it true that if all the real numbers $a , b , c , d$ are from the closed interval $[1 , 2]$ then we always have the inequality $$ \frac{a+b}{b+c} + \frac{c+d}{d+a} ≤ 4\Big(\frac{a+c}{b+d}\Big) $$
Souvik Dey
  • 8,297
6
votes
6 answers

Prove that $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\geq \frac{9}{a+b+c} : (a, b, c) > 0$

Please help me for prove this inequality: $$\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\geq \frac{9}{a+b+c} : (a, b, c) > 0$$
user39471
6
votes
4 answers

Inequality.$\sqrt{\frac{2a}{b+c}}+\sqrt{\frac{2b}{c+a}}+\sqrt{\frac{2c}{a+b}} \leq 3$

Let $a,b,c \gt 0$. Prove that (Using Cauchy-Schwarz) : $$\sqrt{\frac{2a}{b+c}}+\sqrt{\frac{2b}{c+a}}+\sqrt{\frac{2c}{a+b}} \leq 3$$ I tried to use Cauchy-Schwarz in the following form $$\sqrt{Ax}+\sqrt{By}+\sqrt{Cz}\leq…
Iuli
  • 6,790
6
votes
2 answers

How may I prove this inequality?

Let $a, b, c$ be positive real, $abc = 1$. Prove that: $$\frac{1}{1+a+b} + \frac{1}{1+b+c} + \frac{1}{1+c+a} \le \frac{1}{2+a} + \frac{1}{2+b}+\frac{1}{2+c}$$ I thought of Cauchy and AM-GM, but I don't see how to successfully use them to prove the…
user 1591719
  • 44,216
  • 12
  • 105
  • 255
6
votes
1 answer

Inequality. $\frac{a^2}{b}+\frac{b^2}{c}+\frac{c^2}{a}+\frac{3n}{a^2+b^2+c^2} \geq 3+n$

I can't find any solution for this inequality which can be found here Exercise 1.3.5 Let $a,b,c$ be positive real numbers such that $a+b+c=ab+bc+ca$ and $n \leq 3$. Prove that $$\frac{a^2}{b}+\frac{b^2}{c}+\frac{c^2}{a}+\frac{3n}{a^2+b^2+c^2} \geq…
Iuli
  • 6,790
6
votes
3 answers

Find the maximum of the value $x+y+z$ if such condition $n(x+y+z)=xyz$

Let $n$ be give postive intger, and $x\ge y\ge z$ are postive integers,such $$n(x+y+z)=xyz$$ Find the $(x+y+z)_{\max}$ I have see this problem only answer is $(n+1)(n+2)$,iff $x=n(n+2),y=n+1,z=1$ and How do it?
math110
  • 93,304
6
votes
1 answer

(Tournament of towns 1994) Prove the inequality

Let $a_1,a_2,\ldots,a_n$ be real positive numbers. Prove that $$\left(1+\frac{a_1^2}{a_2}\right)\left(1+\frac{a_2^2}{a_3}\right) \cdots \left(1+\frac{a_n^2}{a_1}\right) \geq(1+a_1)(1+a_2) \cdots (1+a_n)$$
Rafael Deiga
  • 1,325
  • 8
  • 15
6
votes
0 answers

How prove this ineqlity

Let $x,y,z,w>0$ and such that $xyzw=1$. Show that $$ \dfrac{1+x}{1+x^2}+\dfrac{1+y}{1+y^2}+\dfrac{1+z}{1+z^2}+\dfrac{1+w}{1+w^2}\le 4. $$
math110
  • 93,304
6
votes
1 answer

Prove inequality $n\sqrt[n]{n!}-m\sqrt[m]{m!}\le\frac{(n−m)(n+m+1)}2.$

Let $m,n\in\mathbb N$, $n>m$. Prove inequality $$n\sqrt[n]{n!}-m\sqrt[m]{m!}\le\frac{(n−m)(n+m+1)}2.$$ My work so far: $$\sqrt[n]{n!}=\sqrt[n]{1\cdot2\cdot...\cdot n}\le\frac{1+2+...+n}{n}=\frac{n(n+1)}{2n}=\frac{n+1}2.$$ Then…
Roman83
  • 17,884
  • 3
  • 26
  • 70