Solve equation $(3a-bc)(3b-ac)(3c-ab)=1000$ in integers. (V.Brayman)

In 11 cells of a square grid there live hedgehogs. Every hedgehog divides the number of hedgehogs in its row by the number of hedgehogs in its column. Is it possible that all the hedgehogs get distinct numbers? (V.Brayman)

Let $\omega$ be the circumcircle of a triangle $ABC$ ($AB>AC$), $E$ be the midpoint of the arc $AC$ which does not contain point $B,$ аnd $F$ the midpoint of the arc $AB$ which does not contain point $C.$ Lines $AF$ and $BE$ meet at point $P,$ line $CF$ and $AE$ meet at point $R,$ and the tangent to $\omega$ at point $A$ meets line $BC$ at point $Q.$ Prove that points $P,Q,R$ are collinear. (M. Kurskiy)

Find all collections of $63$ integer numbers such that the square of each number is equal to the sum of all other numbers, and not all the numbers are equal. (O. Rudenko)

Bilbo composes a number triangle of zeroes and ones in such a way: he fills the topmost row with any $n$ digits, and in other rows he always writes $0$ under consecutive equal digits and writes $1$ under consecutive distinct digits. (An example of a triangle for $n=5$ is shown below.) In how many ways can Bilbo fill the topmost row for $n=100$ so that each of $n$ rows of the triangle contains even number of ones?\[\begin{smallmatrix}1\,0\,1\,1\,0\\1\,1\,0\,1\\0\,1\,1\\1\,0\\1\end{smallmatrix}\](O. Rudenko and V. Brayman)

Is it possible to mark four points on the plane so that the distances between any point and three other points form an arithmetic progression? (V. Brayman)

In several cells of a square grid there live hedgehogs. Every hedgehog multiplies the number of hedgehogs in its row by the number of hedgehogs in its column. Is it possible that all the hedgehogs get distinct numbers?

Let $AD$ be the altitude, $AE$ be the median, and $O$ be the circumcenter of a triangle $ABC.$ Points $X$ and $Y$ are selected inside the triangle such that $\angle BAX=\angle CAY,$ $OX\perp AX,$ and $OY\perp AY.$ Prove that points $D,E,X,Y$ are concyclic. (M. Kurskiy)

Frodo composes a number triangle of zeroes and ones in such a way: he fills the topmost row with any $n$ digits, and in other rows he always writes $0$ under consecutive equal digits and writes $1$ under consecutive distinct digits. (An example of a triangle for $n=5$ is shown below.) In how many ways can Frodo fill the topmost row for $n=100$ so that each of $n$ rows of the triangle contains odd number of ones?\[\begin{smallmatrix}1\,0\,1\,1\,0\\1\,1\,0\,1\\0\,1\,1\\1\,0\\1\end{smallmatrix}\](O. Rudenko and V. Brayman)

Let $a,b,c\ge0$ and $a+b+c=3.$ Prove that $(3a-bc)(3b-ac)(3c-ab)\le8.$ (O. Rudenko)

Is it true that for every $n\ge 2021$ there exist $n$ integer numbers such that the square of each number is equal to the sum of all other numbers, and not all the numbers are equal? (O. Rudenko)

Let $\omega$ be the circumcircle of a triangle $ABC$ (${AB\ne AC}$), $I$ be the incenter, $P$ be the point on $\omega$ for which $\angle API=90^\circ,$ $S$ be the intersection point of lines $AP$ and $BC,$ $W$ be the intersection point of line $AI$ and $\omega.$ Line which passes through point $W$ orthogonally to $AW$ meets $AP$ and $BC$ at points $D$ and $E$ respectively. Prove that $SD=IE.$ (Ye. Azarov)