Let $n\ge 2$ be an integer. $a_1,a_2,\dotsc,a_n$ are arbitrarily chosen positive integers with $(a_1,a_2,\dotsc,a_n)=1$. Let $A=a_1+a_2+\dotsb+a_n$ and $(A,a_i)=d_i$. Let $(a_2,a_3,\dotsc,a_n)=D_1, (a_1,a_3,\dotsc,a_n)=D_2,\dotsc, (a_1,a_2,\dotsc,a_{n-1})=D_n$. Find the minimum of $\prod\limits_{i=1}^n\dfrac{A-a_i}{d_iD_i}$

Let $a, b, c \geq 0$ and satisfy \[ a^2+b^2+c^2 +abc = 4 . \] Show that \[ 0 \le ab + bc + ca - abc \leq 2. \]

Juku has the first $100$ volumes of the Harrie Totter book series at his home. For every$ i$ and $j$, where $1 \le i < j \le 100$, call the pair $(i, j)$ reversed if volume No. $j$ is before volume No, $i$ on Juku’s shelf. Juku wants to arrange all volumes of the series to one row on his shelf in such a way that there does not exist numbers $i, j, k$, where $1 \le i < j < k \le 100$, such that pairs $(i, j)$ and $(j, k)$ are both reversed. Find the largest number of reversed pairs that can occur under this condition

Let $x, y, z$ be positive real numbers. Prove that $\frac{y^2 + z^2}{x}+\frac{z^2 + x^2}{y}+\frac{x^2 + y^2}{z}\ge 2(x + y + z)$.

Let $N$ be a positive integer. Kingdom Wierdo has $N$ castles, with at most one road between each pair of cities. There are at most four guards on each road. To cost down, the King of Wierdos makes the following policy: (1) For any three castles, if there are roads between any two of them, then any of these roads cannot have four guards. (2) For any four castles, if there are roads between any two of them, then for any one castle among them, the roads from it toward the other three castles cannot all have three guards. Prove that, under this policy, the total number of guards on roads in Kingdom Wierdo is smaller than or equal to $N^2$. [i]Remark[/i]: Proving that the number of guards does not exceed $cN^2$ for some $c > 1$ independent of $N$ will be scored based on the value of $c$. [i]Proposed by usjl[/i]

Determine a subset $ A\subset \mathbb{N}^*$ having $ 5$ different elements, so that the sum of the squares of its elements equals their product. Do not simply post the subset, show how you found it.

If $a,b,c \neq 0$, prove that $\frac{a^2+b^2}{c^2} +\frac{b^2+c^2}{a^2} +\frac{c^2+a^2}{b^2} \geq 6$.

Given a tetrahedron $VABC$ with edges $VA$, $VB$ and $VC$ perpendicular any two of them. The sum of the lengths of the tetrahedron's edges is $3p$. Find the maximal volume of $VABC$.

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}.\]

Find all triples $(x,y,z)$ of real numbers such that \[x^2+y^2+z^2\le 6+\min (x^2-\frac{8}{x^4},y^2-\frac{8}{y^4},z^2-\frac{8}{z^4}).\]

(a) Find all real numbers $p$ for which the inequality $$x_1^2+x_2^2+x_3^2\ge p(x_1x_2+x_2x_3)$$ is true for all real numbers $x_1,x_2,x_3$. (b) Find all real numbers $q$ for which the inequality $$x_1^2+x_2^2+x_3^2+x_4^2\ge q(x_1x_2+x_2x_3+x_3x_4)$$ is true for all real numbers $x_1,x_2,x_3,x_4$. [i]I. Tonov[/i]

Let $P(x)=x^n+a_1x^{n-1}+\ldots+a_n$ ($n\ge2$) be a polynomial with integer coefficients having $n$ real roots $b_1,\ldots,b_n$. Prove that for $x_0\ge\max\{b_1,\ldots,b_n\}$, $$P(x_0+1)\left(\frac1{x_0-b_1}+\ldots+\frac1{x_0-b_n}\right)\ge2n^2.$$

The positive real numbers $a,b,c,d$ satisfy the equality $$a+bc+cd+db+\frac{1}{ab^2c^2d^2}=18.$$ Find the maximum possible value of $a$.

Let $x,y$ and $z$ be non-negative real numbers satisfying the equation $x+y+z=xyz$. Prove that $2(x^2+y^2+z^2)\geq3(x+y+z)$.

Determine all positive real $M$ such that for any positive reals $a,b,c$, at least one of $a + \dfrac{M}{ab}, b + \dfrac{M}{bc}, c + \dfrac{M}{ca}$ is greater than or equal to $1+M$.

If $a,b,c$ are positive real numbers such that $a+b+c=abc$ prove that $$\frac{abc}{3\sqrt{2}}\left ( \sum_{cyc}\frac{\sqrt{a^3+b^3}}{ab+1} \right )\geq \sum_{cyc}\frac{a}{a^2+1}$$