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
3
votes
0 answers

Prove that the expression is greater than 0

During my learning process, I encountered one of the following expressions. $$ 2 \cos \left(\frac{\pi }{k+2}\right) \prod _{j=1}^{2 k+3} \left(2 \cos \left(\frac{\pi }{k+2}\right)-2 \cos \left(\frac{2 j \pi }{2 k+3}\right)\right)-\prod _{j=1}^{2…
licheng
  • 2,266
3
votes
3 answers

Solve $n < e^{6 \sqrt{n}}$

Find for which values of $n \in \mathbb{N}$ it holds that $$n < e^{6 \sqrt{n}}.$$ I tried to use the inequality $(1 + x) \leq e^x$, but from this, I can only find that the inequality holds for $n > 36$. But I need to get $n$ as small as…
Kapur
  • 489
3
votes
2 answers

Better proof of inequality $x - (1 + x) \log(1+x) \leq -\frac{x^2}{2(1+x)}$ for $x > 0$

The following inequality is valid for all positive real $x$, $$ x - (1+x)\log(1+x) \leq \frac{-x^2}{2(1+x)}. $$ It is possible to show that this is true by considering the function $$ f(x) := x - (1+x)\log(1+x)+ \frac{x^2}{2(1+x)}. $$ By…
Drew Brady
  • 3,399
3
votes
1 answer

Transforming inequalities over the real numbers

Given integers a and b and the relation a <= b, intuitively I feel I can transform this inequality into a strict inequality like this: a < b + 1 Conversely, I should be able to transform the strict inequality a < b to a non-strict one like this: a +…
csvan
  • 163
3
votes
2 answers

Application of AM-GM inequality to specific contest problem

Suppose that $x,y\in [0,1]$. Prove that $\frac{1}{\sqrt{1+x^2}}+\frac{1}{\sqrt{1+y^2}}\leq \frac{2}{\sqrt{1+xy}}.$ I suppose that this problem can be solved by some application of AM-GM inequality. I was trying to do the following: since $xy\leq…
RFZ
  • 16,814
3
votes
1 answer

$x^y+y^x>1$ for all $(x, y)\in \mathbb{R_+^2}$

Prove that $x^y+y^x>1$ for all $(x, y)\in \mathbb{R_+^2}$.
user72870
  • 4,182
  • 2
  • 23
  • 43
3
votes
3 answers

How prove this $\sum_{i=n+2}^{+\infty}\frac{1}{i^2}>\frac{2n+5}{2(n+2)^2}$

let $n$ be postive integer,show that $$\sum_{i=n+2}^{+\infty}\dfrac{1}{i^2}>\dfrac{2n+5}{2(n+2)^2}\tag{1}$$ I know $$\sum_{i=n+2}^{+\infty}\dfrac{1}{i^2}>\int_{n+2}^{+\infty}\dfrac{1}{x^2}dx=\dfrac{1}{n+2}$$ But…
math110
  • 93,304
3
votes
3 answers

Proving $a^4+2a^3 b+2ab^3+b^4 ≥ 6a^2b^2$

Prove that for any positive real numbers $a$ and $b$,$$a^4 + 2a^3b + 2ab^3 + b^4 ≥ 6a^2b^2.$$I tried using Vieta's formula to show the product of the LHS is greater than the RHS, but I don't think I am correct.
3
votes
2 answers

Proving the inequality $\ln(\cos x)\ge \frac{-x^2}{\cos^2(x)}$ for $x\in [0,\frac{\pi}{2}]$

I want to prove the following inequality: $\ln(\cos x)\ge \dfrac{-x^2}{\cos^2(x)}$ Please I'm stuck with this problem, maybe considering the equivalent inequality $\ln(\sec x)\ge (x \sec x)^2$ would help, but I'm not sure. I want to prove it by the…
3
votes
0 answers

Let $ a_1,a_2,...,a_n$ be nonnegative real numbers ($ n\ge 3$).

If $ k\geq \dfrac {n - 5 + \sqrt {(n - 1)(n + 7)}}{4(n - 1)}$, then $$ \prod \limits_{cyc}\left(k + \frac {a_1}{a_2 + a_3 + ... + a_n}\right)\ge \left(k + \frac 1{n - 1}\right)^n$$ Here the function $f(x)=\ln\left(k+\dfrac{x}{s-x}\right)$ is not…
3
votes
2 answers

Proving $|(x-x_0)(x-x_1)|\leq \frac {1}{4}(x_1-x_0)^2$

I need to prove that $$ |(x-x_0)(x-x_1)|\leq \frac {1}{4}(x_1-x_0)^2 $$ for all $x\in < x_0 ; x_1 >$ The only thing I have notived it that the expression with absoltue value is always non-positive, so the inequality is equvalent to…
3
votes
2 answers

How to prove such $|\mu_{1}a_{1}+\mu_{2}a_{2}+\cdots+\mu_{n}a_{n}|\le\frac{1}{a}$

let $a$ is give postive real number,and $a_{1},a_{2},\cdots,a_{n}$ be postive real numbers,and such $$a^2_{1}+a^2_{2}+\cdots+a^2_{n}=1,a_{1}+a_{2}+\cdots+a_{n}=a$$ show that: there exist $\mu_{i}\in\{-1,1\},i=1,2,\cdots,n$…
math110
  • 93,304
3
votes
1 answer

AM GM inequality with constants

I was trying to find the minimum value of $a + \frac{1}{a} + 3$ given that $a$ is a positive real number. I found $2$ ways to do it. Minimum value of $a + \frac{1}{a}$ is $2$ using the AM-GM inequality and therefore the minimum value of $a +…
3
votes
3 answers

Why $a^mb^nc^p....$ depends on $\left(\frac{a}{m}\right)^{m}\left(\frac{b}{n}\right)^{n}\left(\frac{c}{p}\right)^{p} \ldots$ for being the greatest?

I am studying Higher Algebra by Hall and Knight and not much explanation is given on any article. So, I had some doubts on this article. To find the greatest value of $a^mb^nc^p....$ when $a+b+c+.....$ is constant; $m,n,p.....$ being positive…
Crocogator
  • 1,007
3
votes
1 answer

Show that $x_n \leq \frac{1}{\sqrt{3n+1}}$

Let $$x_n=\frac{1}{2} \frac{3}{4}\frac{5}{6}\cdots\frac{2n-1}{2n}$$ Then show that $$x_n \leq \frac{1}{\sqrt{3n+1}}$$ for all $n=1,2,3,\dots$ I try induction but unable to solve this equality.
A.D
  • 6,400
  • 1
  • 20
  • 43