2018 Kazakhstan MO #4

-

 Prove that for all reals $a,b,c,d\in(0,1)$ we have$$\left(ab-cd\right)\left(ac+bd\right)\left(ad-bc\right)+\min{\left(a,b,c,d\right)} < 1.$$



WLOGE assume $ a \ge c. $ Because $ a, b, d <1 $, by Cauchy-Schwarz we get $$(ab-cd)(ad-bc)\le \left(\frac{(ab-cd)+(ad-bc)}{2}\right)^ 2=\frac{(b+d)^2(a-c)^2}{4} < (1-c)^2.$$

Also, $ac + bd <c + 1$. Multiplying our two inequalities, we obtain $$ (ab-cd) (ac + bd) (ad-bc) <(1-c) ^ 2 (1 + c) = ( 1-c) (1-c ^ 2) <1-c$$ $$\le 1- \min (a, b, c, d),$$ as desired. $\square$

Comments

Post a Comment

Popular posts from this blog

1995 IMO #2

-
 Let $ a$, $ b$, $ c$ be positive real numbers such that $ abc = 1$. Prove that \[ \frac {1}{a^{3}\left(b + c\right)} + \frac {1}{b^{3}\left(c + a\right)} + \frac {1}{c^{3}\left(a + b\right)}\geq \frac {3}{2}. \]
Read more

2014 IMO SL #C2

-
  Problem : We have $2^m$ sheets of paper, with the number $1$ written on each of them. We perform the following operation. In every step we choose two distinct sheets; if the numbers on the two sheets are $a$ and $b$, then we erase these numbers and write the number $a + b$ on both sheets. Prove that after $m2^{m -1}$ steps, the sum of the numbers on all the sheets is at least $4^m$ .
Read more

2015 IMO SL #A1

-
 Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies\[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\]for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.
Read more