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

show this inequality with $a+b+c+d=1$

Let $a,b,c,d\ge 0$,and such $a+b+c+d=1$, show that $$3(a^2+b^2+c^2+d^2)+64abcd\ge 1$$ use AM-GM $$a^2+b^2+c^2+d^2\ge 4\sqrt{abcd}$$ it suffices to $$4\sqrt{abcd}+64abcd\ge 1$$
math110
  • 93,304
4
votes
2 answers

For positive integers $m,n$ if $\sqrt 7 - \frac{m}{n} > 0$ then prove that $\sqrt 7 - \frac{m}{n} > \frac{1}{{mn}}$

For positive integers $m,n$ if $\sqrt 7 - \frac{m}{n} > 0$ then prove that $\sqrt 7 - \frac{m}{n} > \frac{1}{{mn}}$.
user322683
4
votes
2 answers

Inequality involving four numbers

Show that, if $a$, $b$, $c$ and $d$ are four positive numbers with sum $1$, then $$\frac 3 {1-a} + \frac 3 {1-b} + \frac 3 {1-c} + \frac 3 {1-d} \ge \frac 5 {1+a} + \frac 5 {1+b} + \frac 5 {1+c} + \frac 5 {1+d}.$$ I tried to subtract the fractions,…
Imawesome
  • 295
4
votes
1 answer

Weird Inequality that seems to be true

Is it true that: $$\left (3x+\frac{4}{x+1}+\frac{16}{y^2+3}\right )\left (3y+\frac{4}{y+1}+\frac{16}{x^2+3}\right )\geq 81,\ \forall x,y\geq 0$$ I have proved that $3x+\frac{4}{x+1}+\frac{16}{x^2+3}= 9 +\frac{(x-1)^2 (3x^2+1)}{(x+1)(x^2+3)}, \…
Bogdan
  • 1,867
4
votes
3 answers

Prove that $(ax + by + cz)^2 \leq (a^2 + b^2 + c^2)(x^2 + y^2 + z^2)$.

Prove that for any real number $a$, $b$, $c$, $x$, $y$ and $z$, there results $(ax + by + cz)^2 \leq (a^2 + b^2 + c^2)(x^2 + y^2 + z^2)$ I have thought this Q for long time but I still can't get the answer. Can anyone help me please? Thank you!~
JSCB
  • 13,456
  • 15
  • 59
  • 123
4
votes
2 answers

If $x,y,z$ are positive real number number, Then minimum value of $\frac{x^4+y^4+z^2}{xyz}$

If $x,y,z$ are positive real number number, Then minimum value of $\displaystyle \frac{x^4+y^4+z^2}{xyz}$ $\bf{My\; Try::}$ Given $x,y,z>0.$ So Using $\bf{A.M\geq G.M\;,}$ We get $$\displaystyle x^4+y^4\geq 2x^2y^2$$ and then Using …
juantheron
  • 53,015
4
votes
0 answers

Prove that $a+b^2+c^3+d^4 \ge \frac{1}{a}+\frac{1}{b^2}+\frac{1}{c^3}+\frac{1}{d^4}$

If $0 < a \le b \le c \le d$ and $abcd = 1$ prove that $$a+b^2+c^3+d^4 \ge \frac{1}{a}+\frac{1}{b^2}+\frac{1}{c^3}+\frac{1}{d^4}$$ I first thought of multiplying both sides with…
4
votes
3 answers

Finding an Upper Bound on This Inequality

I came across this problem that seems a bit peculiar. Take $$\sum_{1 \leq i < j \leq n} |x_i-x_j|,$$ where $x_1,...,x_n \in [1,35].$ I want to figure out the maximum possible value of this sum in terms of $n$. To me this, problem could possibly be…
Celina
  • 43
  • 3
4
votes
3 answers

Prove this inequality holds $e^x+(\ln{x}-1)\sin{x}>0$

Let $x>0$.show that this following inequality $$e^x+(\ln{x}-1)\sin{x}>0$$ I tried doing this with derivatives, but I don't quickly found that it was outside of my ability to obtain the necessary derivatives, so I figured there must be some simpler…
math110
  • 93,304
4
votes
2 answers

Find the minimum of $\sum_{k=1}^n \frac{x^k_k}{k}$

Let $n$ be a positive integer. Find the minimum of $\displaystyle \sum_{k=1}^n \dfrac{x^k_k}{k}$, where $x_1,x_2,\ldots,x_n$ are positive real numbers such that $\displaystyle \sum_{k=1}^n \dfrac{1}{x_k} = n$. This question sort of reminds me of…
Puzzled417
  • 6,956
4
votes
4 answers

Proving the inequality $ \frac {x+y}{x^2+y^2}\leq \frac 12 \left(\frac {1}{x}+\frac{1}{y}\right)$

Let $x$ and $y$ be two positive numbers: Prove that $$ \left( \frac {x+y}{x^2+y^2}\right) \leq \frac 12 \left(\frac {1}{x}+\frac{1}{y}\right).$$ I answered this one by squaring the two expressions. And therefore finding the difference after…
4
votes
4 answers

Can we say $\sqrt {ab} \ge \min \{ a,b\} $?

Let $a,b\in R$ and both are positive. Can we say $\sqrt {ab} \ge \min \{ a,b\} $?
4
votes
1 answer

If $a>b>0$, find the minimum value of $a+\cfrac{1}{(a-b)b}$

If $a>b>0$, find the minimum value of $a+\cfrac{1}{(a-b)b}$ I am clueless on how to simplify the expression $a+\cfrac{1}{(a-b)b}$. My book gives as a hint to rewrite the given expression so that there's an $a-b$ in a numerator ,which can be then…
Mr. Y
  • 2,637
4
votes
0 answers

An inequality $\frac{y_1-x_1}{x_2+x_3} + \frac{y_2-x_2}{x_3+x_1} + \frac{y_3-x_3}{x_1+x_2} > 0 \;\forall x_i,y_i>0$

Given that $x_1,x_2,x_3,y_1,y_2,y_3$ are positive real numbers satisfying $$\frac{y_1-x_1}{x_2+x_3} + \frac{y_2-x_2}{x_3+x_1} + \frac{y_3-x_3}{x_1+x_2} > 0.$$ Show that $$\frac{y_1-x_1}{y_2+y_3} + \frac{y_2-x_2}{y_3+y_1} + \frac{y_3-x_3}{y_1+y_2} >…
4
votes
2 answers

prove that $(a-b)(c-d)+(a-c)(b-d)+(d-a)(b-c) \geq 0$.

Let $a,b,c$ and $d$ be real numbers with $a+d = b+c$, prove that $(a-b)(c-d)+(a-c)(b-d)+(d-a)(b-c) \geq 0$. Should I substitute in the given condition for $a$ and $b$ and see if things simplify? Or should I use the arithmetic-geometric mean…
Jacob Willis
  • 1,601