Let $n_1,n_2,n_3,...,n_{2000}$ be $2000$ positive integers satisfying $n_1<n_2<n_3<...<n_{2000}$. Prove that $$\frac{n_1}{[n_1,n_2]}+\frac{n_1}{[n_2,n_3]}+\frac{n_1}{[n_3,n_4]}+...+\frac{n_1}{[n_{1999},n_{2000}]} \le 1 - \frac{1}{2^{1999}}$$ where $[a, b]$ denotes the least common multiple of $a$ and $b$.

[asy] size(200); dotfactor=3; pair A=(0,0),B=(1,0),C=(2,0),D=(3,0),X=(1.2,0.7); draw(A--D); dot(A);dot(B);dot(C);dot(D); draw(arc((0.4,0.4),0.4,180,110),arrow = Arrow(TeXHead)); draw(arc((2.6,0.4),0.4,0,70),arrow = Arrow(TeXHead)); draw(B--X,dotted); draw(C--X,dotted); label("$A$",A,SW); label("$B$",B,S); label("$C$",C,S); label("$D$",D,S); label("x",X,fontsize(5pt)); //Credit to TheMaskedMagician for the diagram [/asy] Points $A , B, C$, and $D$ are distinct and lie, in the given order, on a straight line. Line segments $AB, AC$, and $AD$ have lengths $x, y$, and $z$ , respectively. If line segments $AB$ and $CD$ may be rotated about points $B$ and $C$, respectively, so that points $A$ and $D$ coincide, to form a triangle with positive area, then which of the following three inequalities must be satisfied? $\textbf{I. }x<\frac{z}{2}\qquad\textbf{II. }y<x+\frac{z}{2}\qquad\textbf{III. }y<\frac{z}{2}$ $\textbf{(A) }\textbf{I. }\text{only}\qquad\textbf{(B) }\textbf{II. }\text{only}\qquad$ $\textbf{(C) }\textbf{I. }\text{and }\textbf{II. }\text{only}\qquad\textbf{(D) }\textbf{II. }\text{and }\textbf{III. }\text{only}\qquad\textbf{(E) }\textbf{I. },\textbf{II. },\text{and }\textbf{III. }$

Assume that $a, b,$ and $c$ are positive real numbers for which $(a+b)(a+c)(b+c) = 1$. Prove that $ab+bc+ca \leq\frac{3 }{4}.$

Let $0<c<1$ be a given real number. Determine the least constant $K$ such that the following holds: For all positive real $M$ that is greater than $1$, there exists a strictly increasing sequence $x_0, x_1, \ldots, x_n$ (of arbitrary length) such that $x_0=1, x_n\geq M$ and \[\sum_{i=0}^{n-1}\frac{\left(x_{i+1}-x_i\right)^c}{x_i^{c+1}}\leq K.\] (From 2020 IMOCSL A5. I think this problem is particularly beautiful so I want to make a separate thread for it :D )

An integer $n \geq 3$ is given. We call an $n$-tuple of real numbers $(x_1, x_2, \dots, x_n)$ [i]Shiny[/i] if for each permutation $y_1, y_2, \dots, y_n$ of these numbers, we have $$\sum \limits_{i=1}^{n-1} y_i y_{i+1} = y_1y_2 + y_2y_3 + y_3y_4 + \cdots + y_{n-1}y_n \geq -1.$$ Find the largest constant $K = K(n)$ such that $$\sum \limits_{1 \leq i < j \leq n} x_i x_j \geq K$$ holds for every Shiny $n$-tuple $(x_1, x_2, \dots, x_n)$.

Prove the following inequality. \[ \frac{\pi}{4}\sqrt{\frac{3}{2}\plus{}\sqrt{2}}<\int_0^{\frac{\pi}{2}} \sqrt{1\minus{}\frac 12\sin ^ 2 x}\ dx<\frac{\sqrt{3}}{4}\pi\]

A triangle has inradius $r$ and circumradius $R$. Its longest altitude has length $H$. Show that if the triangle does not have an obtuse angle, then $H \ge r+R$. When does equality hold?

If $\alpha, \beta, \gamma$ are angles whose measures in radians belong to the interval $\left[0, \frac{\pi}{2}\right]$ such that: $$\sin^2 \alpha + \sin^2 \beta + \sin^2 \gamma = 1$$ calculate the minimum possible value of $\cos \alpha + \cos \beta + \cos \gamma$.

Let $a,b,c$ be positive reals. Prove that \[ \frac{(a-b)(a-c)}{2a^2 + (b+c)^2} + \frac{(b-c)(b-a)}{2b^2 + (c+a)^2} + \frac{(c-a)(c-b)}{2c^2 + (a+b)^2} \geq 0. \] [i]Calvin Deng.[/i]

Let $a, b$ and $c$ be non-zero natural numbers such that $c \geq b$ . Show that $$a^b\left(a+b\right)^c>c^b a^c.$$

Let $x_1,x_2,\cdots,x_n$ be real numbers with $x_1^2+x_2^2+\cdots+x_n^2=1$. Prove that \[\sum_{k=1}^{n}\left(1-\dfrac{k}{{\displaystyle \sum_{i=1}^{n} ix_i^2}}\right)^2 \cdot \dfrac{x_k^2}{k} \leq \left(\dfrac{n-1}{n+1}\right)^2 \sum_{k=1}^{n} \dfrac{x_k^2}{k}\] Determine when does the equality hold?

Assume that the numbers from the table $$\begin{matrix}a_{11}&a_{12}&\cdots&a_{1n}\\a_{21}&a_{22}&\cdots&a_{2n}\\\vdots&\vdots&&\vdots\\a_{n1}&a_{n2}&\cdots&a_{nn}\end{matrix}$$satisfy the inequality: $$\sum_{j=1}^n|a_{j1}x_1+a_{j2}x_2+\ldots+a_{jn}x_n|\le M,$$for each choice $x_j=\pm1$. Prove that $$|a_{11}+a_{22}+\ldots+a_{nn}|\le M.$$

The positive integers $a_1,a_2, \dots, a_n$ are aligned clockwise in a circular line with $n \geq 5$. Let $a_0=a_n$ and $a_{n+1}=a_1$. For each $i \in \{1,2,\dots,n \}$ the quotient \[ q_i=\frac{a_{i-1}+a_{i+1}}{a_i} \] is an integer. Prove \[ 2n \leq q_1+q_2+\dots+q_n < 3n. \]

Determine the smallest positive constant $k$ such that no matter what $3$ lattice points we choose the following inequality holds: $$ L_{\max} - L_{\min} \ge \frac{1}{\sqrt{k} \cdot L_{max}} $$ where $L_{\max}$, $L_{\min}$ is the maximal and minimal distance between chosen points.

Let $x,y,z,t$ be real numbers such that, $1 \leq x \leq y \leq z \leq t \leq 100$. Find minimum value of $$\frac{x}{y}+\frac{z}{t}$$

Ten volleyball teams played a tournament; every two teams met exactly once. The winner of the play gets 1 point, the loser gets 0 (there are no draws in volleyball). If the team that scored $n$-th has $x_{n}$ points ($n=1, \dots, 10$), prove that $x_{1}+2x_{2}+\dots+10x_{10}\geq 165$. [i]Proposed by D. Teryoshin[/i]

Let be two complex numbers $ a,b $ chosen such that $ |a+b|\ge 2 $ and $ |a+b|\ge 1+|ab|. $ Prove that $$ \left| a^{n+1} +b^{n+1} \right|\ge \left| a^{n} +b^{n} \right| , $$ for any natural number $ n. $ [i]Alin Pop[/i]

Let $f(x)$ be a continuous function defined on $0\leq x\leq \pi$ and satisfies $f(0)=1$ and \[\left\{\int_0^{\pi} (\sin x+\cos x)f(x)dx\right\}^2=\pi \int_0^{\pi}\{f(x)\}^2dx.\] Evaluate $\int_0^{\pi} \{f(x)\}^3dx.$

Find the smallest real constant $p$ for which the inequality holds $\sqrt{ab}- \frac{2ab}{a + b} \le p \left( \frac{a + b}{2} -\sqrt{ab}\right)$ with any positive real numbers $a, b$.

Prove that for $\forall$ $a,b,c\in [\frac{1}{3},3]$ the following inequality is true: $\frac{a}{a+b}+\frac{b}{b+c}+\frac{c}{c+a}\geq \frac{7}{5}$.

If $a, b, c$ and $d$ are positive real numbers such that $a + b + c + d = 2$, prove that $$\frac{a^2}{(a^2+1)^2}+\frac{b^2}{(b^2+1)^2}+\frac{c^2}{(c^2+1)^2}+\frac{d^2}{(d^2+1)^2} \le \frac{16}{25}$$

Given positive integers $m$ and $n$. Let $a_{i,j} ( 1 \le i \le m, 1 \le j \le n)$ be non-negative real numbers, such that $$ a_{i,1} \ge a_{i,2} \ge \cdots \ge a_{i,n} \text{ and } a_{1,j} \ge a_{2,j} \ge \cdots \ge a_{m,j} $$ holds for all $1 \le i \le m$ and $1 \le j \le n$. Denote $$ X_{i,j}=a_{1,j}+\cdots+a_{i-1,j}+a_{i,j}+a_{i,j-1}+\cdots+a_{i,1},$$ $$ Y_{i,j}=a_{m,j}+\cdots+a_{i+1,j}+a_{i,j}+a_{i,j+1}+\cdots+a_{i,n}.$$ Prove that $$ \prod_{i=1}^{m} \prod_{j=1}^{n} X_{i,j} \ge \prod_{i=1}^{m} \prod_{j=1}^{n} Y_{i,j}.$$

For any real number $a$, prove the inequality: $$\left(a^3+a^2+3\right)^2>4a^3(a-1)^2.$$

Let $a$, $b$, $c$ be real numbers. Prove that \begin{align*}&\quad\,\,\sqrt{2(a^2+b^2)}+\sqrt{2(b^2+c^2)}+\sqrt{2(c^2+a^2)}\\&\ge \sqrt{3[(a+b)^2+(b+c)^2+(c+a)^2]}.\end{align*}

Let $K$ be the intersection of the diagonals of a convex quadrilateral $ABCD$. Let $L\in [AD]$, $M \in [AC]$, $N \in [BC]$ such that $KL\parallel AB$, $LM\parallel DC$, $MN\parallel AB$. Show that \[\dfrac{Area(KLMN)}{Area(ABCD)} < \dfrac {8}{27}.\]