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

How find this maximum and minimum of$|x+1|+|x-1|+\sqrt{4-x^2}$

show that $$2+\sqrt{3}\le|x+1|+|x-1|+\sqrt{4-x^2}\le2\sqrt{5}$$ This problem have nice methods? Thank you my ugly methods, since $-2\le x\le 2$,and $f(x)=|x-1|+|x+1|+\sqrt{4-x^2}\Longrightarrow f(x)=f(-x)$ so we only find $x\in [0,2]$…
math110
  • 93,304
2
votes
3 answers

How find this inequality $\sqrt{a^2+64}+\sqrt{b^2+1}$

let $a,b$ are positive numbers,and such $ab=8$ find this minum $$\sqrt{a^2+64}+\sqrt{b^2+1}$$ My try: and I find when $a=4,b=2$,then $$\sqrt{a^2+64}+\sqrt{b^2+1}$$ is minum $5\sqrt{5}$ it maybe use Cauchy-Schwarz inequality Thank you
math110
  • 93,304
2
votes
2 answers

set of values of $a$ for which the Inequality $ax^2-(3+2a)x+6>0,a\neq 0$ holds for exactly three negative integer values of $x,$ is

The complete set of values of $a$ for which the Inequality $ax^2-(3+2a)x+6>0,a\neq 0$ holds for exactly three negative integer values of $x,$ is What I try: $\displaystyle ax^2-3x-2ax+6>0$ $x(ax-3)-2(ax-3)=0$ $\displaystyle…
jacky
  • 5,194
2
votes
2 answers

Theorem 7.18 in Rudin's PMA.

The proof starts like this: I can't prove this inequality. What I've tried is split into two cases: If $|s-t|\ge 2$ I can prove it. If $|s-t|<2$ I have $\varphi (s)=|s+2m|$ and $\varphi (t)=|t+2n|$ for some integers $m,n$ such that $|m-n|=0$ or…
2
votes
3 answers

Solving the inequality $−5 < \frac 1 x \le 1$

I can solve for $\frac 1 x \le 1$, but I cannot solve for $−5 < \frac 1 x$. Please help!
Jason
  • 21
  • 1
2
votes
2 answers

How to prove $\sum\limits_{cyc} \frac{1}{x+yz} \le \frac{9}{2(xy+yz+zx)}$ for all $x,y,z >0:x+y+z=3.$?

When I entered a test at my school, I stuck this problem (it is also posted here) Let $x,y,z$ be positive real numbers such that $x+y+z=3$, prove that $$\frac{1}{x+yz}+\frac{1}{y+zx}+\frac{1}{z+xy} \le \frac{9}{2(xy+yz+zx)}.$$ I have tried AM…
2
votes
0 answers

How to prove this inequality based on several inequalities?

Consider $x$, $y$, $z$, $w$, all in $\left(0,1\right)$. Suppose $\frac{1-z}{w}<\frac{1-x}{y}<1<\frac{z}{1-w}<\frac{x}{1-y}$. I want to prove $\frac{w\left(1-x\right)-y\left(1-z\right)}{x+y-1}<1$. Numerical simulation suggests this inequality is…
Ypbor
  • 787
  • 2
  • 8
2
votes
3 answers

Rigorous proof for maximization given $\sum^{n}_{i=0} \frac{a_i}{2^i} = 1$

Let $a_0, a_1, \cdots, a_n \ge 0$ such that $\sum^{n}_{i=0} \frac{a_i}{2^i} = 1$. Maximize $\sum^{n}_{i=0} a_i$ for a given fixed value $n$. It is pretty obvious that it is maximized at $a_0 = 0, a_1 = 0, \cdots, a_{n-1} = 0, a_n = 2^n$. But is…
abc
  • 23
2
votes
1 answer

Divisor function inequality

Prove that: $$\sigma(n) \leq n(\omega(n) + 1),$$ where: $\sigma(n)$ - sum of divisors function and $\omega(n)$ - number of prime divisors function.
user92813
  • 25
  • 2
2
votes
2 answers

Ask a proof of an elementary trigonometric inequality

The background is from a highly cited paper "Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming". I know how to prove $\frac{2\theta}{\pi}\ge \rho(1-\cos \theta)$ for $\theta\in [0, \pi]$,…
Sunni
  • 4,536
2
votes
2 answers

Show that : $\frac{a+b}{a+3b+2c}+\frac{b+c}{2a+b+3c}+\frac{a+c}{3a+2b+c} \geq 1$

question Show that for any strictly positive real numbers a, b, c the inequality holds: $$\frac{a+b}{a+3b+2c}+\frac{b+c}{2a+b+3c}+\frac{a+c}{3a+2b+c} \geq 1$$ and specify when the tie occurs. my idea After some examples I got to the conclusion that…
IONELA BUCIU
  • 1,157
  • 1
  • 17
2
votes
2 answers

Showing that $a\le\frac{1}{2\sqrt{n}}$

Let: $$a= \sqrt{n+1}-\sqrt{n}$$ such that n is a natural number. The problem is to show that: $$a\le\frac{1}{2\sqrt{n}}$$. My approach: I could show that: $\frac{1}{2\sqrt{n}}\ge\frac{\sqrt{n+1}}{2}$, so if I could show that…
Billy
  • 165
2
votes
4 answers

Effective method to solve $ \frac{x}{3x-5}\leq \frac{2}{x-1}$

I need to solve this inequality. How can I do so effectively? $$ \frac{x}{3x-5}\leq \frac{2}{x-1}$$
Asinomás
  • 105,651
2
votes
1 answer

Looking for a tricky proof for two equality occuring $ab+bc+ca=3.$

I'm looking a non trivial proof for the following inequality. It might be comlicated but easily verified by hand. Let $a,b,c\ge 0: ab+bc+ca=3.$ Prove that $$\sqrt{ab+1}+\sqrt{bc+1}+\sqrt{ca+1}\ge \sqrt{2abc+16}.$$ Equality occurs when…
Dragon boy
  • 1
  • 16
2
votes
1 answer

Let $a,b,c > 0 : abc=1$. Prove that $24\sum\limits_{cyc}\dfrac{a^5}{b}+7\sum\limits_{cyc}\dfrac{b}{a^5} \ge 31(a^5+b^5+c^5).$

My friend sent me a excessive hard inequality problem, it's Let $a,b,c > 0 : abc=1.$ Prove that $$24\left(\dfrac{a^5}{b}+\dfrac{b^5}{c}+\dfrac{c^5}{a}\right)+7\left(\dfrac{b}{a^5}+\dfrac{c}{b^5}+\dfrac{a}{c^5}\right) \ge 31(a^5+b^5+c^5).$$ I…