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
1 answer

prove this Inequalities relating to trigonometric functions

Conjecture if $x_{k}>0,k=1,2,\cdots,n$, then $$\sum_{k=1}^{n}x_{k}\cos{k}\cdot\sum_{k=1}^{n}x_{k}\sin{k}\le\dfrac{n+3}{8}\sum_{k=1}^{n}x^2_{k}$$ It use $ab\le\dfrac{(a+b)^2}{4}$.so we…
math110
  • 93,304
4
votes
2 answers

How do you divide an inequality by another inequality?

The question I'm having trouble with is follows: Suppose you have already proved the proposition that, “If $a$ and $b$ are nonnegative real numbers, then $\frac{a + b}{2} ≥ \sqrt{ab}$.” a. Explain how you could use this proposition to prove that if…
4
votes
0 answers

prove that this inequality

Let $a_{0},a_{1},\cdots,a_{n}\ge 0,n\ge 1,$ and let $S_{k}=\displaystyle\sum_{i=0}^{k}\binom{k}{i}a_{i}$ with $k=0,1,2,\cdots,n$. We Assume that $\binom{0}{0}=1,\binom{n}{k}=\dfrac{n!}{k!(n-k)!}$. Prove…
math110
  • 93,304
4
votes
3 answers

Solve the given inequality below in the body.

$$\frac{1}{|x|-3} \le \frac 12$$ Let’s consider $|x|=y$ So $$\frac{1}{y-3}-\frac 12 \le 0$$ $$\frac{2-y+3}{y-3} \le 0$$ $$\frac{y-5}{y-3} \ge 0$$ $$y \in (-\infty , 3)\cup [5, \infty)$$ Now this is where the problem starts. I cannot figure out on…
Aditya
  • 6,191
4
votes
3 answers

How to solve this inequality , when there is a irrational power?

$$\frac{(x-2)(x-3)^\sqrt{2}}{(x+1)}>0$$ I'm confused with $(x-3)^\sqrt{2}$ factor. When $x>3$ it is positive. When $x=3$ this inequality does not hold. When $x<3$, I am confused.
Angelo Mark
  • 5,954
4
votes
3 answers

If $a_1,\ldots ,a_n >0$ and $S=a_1+\ldots + a_n <1$, then $(1+a_1)(1+a_2)\ldots (1+a_n)(1-S) < 1$

Let $a_1,\ldots ,a_n >0$ and $S=a_1+\ldots + a_n <1$. I want to show that: $$(1+a_1)(1+a_2)\ldots (1+a_n)(1-S) < 1$$ So by expanding the LHS I get: $$1+S-S+a_1\ldots a_n + a_1\ldots a_{n-1} +\ldots + a_1 a_2+\ldots$$ I want to show somehow that the…
4
votes
1 answer

Exploring an inequality between $\frac{1}{1+a}+\frac{1}{1+b}+\frac{1}{1+c} $ and $\frac{3}{1+(abc)^{1/3}}$ if $a,b, c>0$

An AM-HM inequality for three positive numbers leads to $$\frac{1}{1+a}+\frac{1}{1+b}+\frac{1}{1+c} \ge \frac{3}{{1+\frac{a+b+c}{3}}}. ~~~~(1)$$ Next, the well known AM-GM inequality $$\frac{a+b+c}{3} \ge (abc)^{1/3} ~~~~(2)$$ becomes…
Z Ahmed
  • 43,235
4
votes
2 answers

Prove the following assertion: $a<0, b<0,$ then $ab>0$

I am reading Inequalities by Radmila Bulajich Manfrino. I am new to Inequalities, so I don't understand a lot. The above mentioned problem is exercise $1.2(i)$ in the book. There are some properties mentioned before this exercise. They…
alu
  • 349
4
votes
1 answer

Silly but tricky inequality involving order of shifting and exponentiating

So I got stuck on a little problem. Given $x,s,t>1$, show that $1+(x^t-1)^s > (1+(x-1)^s)^t$ It seems true when I plot it, and I'm very convinced that it's true, but I cannot find a way to prove it. I have been stumped by this all day. Anyone know…
4
votes
3 answers

find the maximum of the value $\left(\sum_{i=1}^{n}ia_{i}\right)\left(\sum_{i=1}^{n}\frac{a_{i}}{i}\right)^2$

let $a_{i}\ge 0$ and such $$a_{1}+a_{2}+\cdots+a_{n}=1$$ find the maximum of the value $$\left(\sum_{i=1}^{n}ia_{i}\right)\left(\sum_{i=1}^{n}\dfrac{a_{i}}{i}\right)^2$$ I try to use From Pólya-Szegö’s inequality, we have for $0 < m_1 \leqslant…
math110
  • 93,304
4
votes
3 answers

How to prove inequality?

What is an easy way to show that for positive integers $i,n$, a real $p \in (\frac12,1)$ and $\epsilon \in [0,p]$, $$p^i(1-p)^{n-i} \geq (p-\epsilon)^i(1-(p-\epsilon))^{n-i}.$$ (I have a complicated way, where I first show that the left hand side is…
user915
4
votes
1 answer

Help with the inequality $\sum_{k=1}^{1006} \sqrt{k \cdot (2014-k)}<506^2\pi$

This question's been solved, come and look if you want to check out some hardcore solutions Here's an inequality that needs to be proven: Prove that $\sqrt{1\cdot 2013} + \sqrt{2\cdot 2012} + \sqrt{3\cdot 2011} + \dots + \sqrt{1006\cdot 1008}$ <…
mathsnoob
  • 667
4
votes
1 answer

Prove $\frac{a}{ab+2c}+\frac{b}{bc+2a}+\frac{c}{ca+2b} \ge \frac 98$

$a,b,c \in \mathbb{R^+} \text{such that }a+b+c=2$. Prove inequality $$\frac a{ab+2c}+\frac b{bc+2a}+\frac c{ca+2b} \ge \frac 98$$ I tried $$LHS = \sum \frac{1}{b+2\cdot c/a} \ge \frac 9 {2+2(\sum c/a)} \longrightarrow failed$$ $$\frac a {ab+2c}…
Xeing
  • 2,967
4
votes
1 answer

Prove the inequality $\frac a{a+b^2+c^2} + \frac b{b+c^2+a^2}+\frac c{c+a^2+b^2} \le 1$

$a, b, c > 0$ such that $abc=1$, prove inequality (Lagrang not allowed here because I am still in grade $9^{th}$): $$P=\frac a{a+b^2+c^2} + \frac b{b+c^2+a^2}+\frac c{c+a^2+b^2} \le 1$$ I have tried to use AM-GM, that I have: $(a+b^2+c^2)(a+1+1)\ge…
Xeing
  • 2,967