Let $E$ be an ellipse with foci $A$ and $B$. Suppose there exists a parabola $P$ such that $\bullet$ $P$ passes through $A$ and $B$, $\bullet$ the focus $F$ of $P$ lies on $E$, $\bullet$ the orthocenter $H$ of $\vartriangle F AB$ lies on the directrix of $P$. If the major and minor axes of $E$ have lengths $50$ and $14$, respectively, compute $AH^2 + BH^2$.

Incircle of $\triangle ABC$ touch $AC$ at $D$. $BD$ intersect incircle at $E$. Points $F,G$ on incircle are such points, that $FE \parallel BC,GE \parallel AB$. $I_1,I_2$ are incenters of $DEF,DEG$. Prove that $I_1I_2 \perp $ bisector of $\angle ABC$

On a $999\times 999$ board a [i]limp rook[/i] can move in the following way: From any square it can move to any of its adjacent squares, i.e. a square having a common side with it, and every move must be a turn, i.e. the directions of any two consecutive moves must be perpendicular. A [i]non-intersecting route[/i] of the limp rook consists of a sequence of pairwise different squares that the limp rook can visit in that order by an admissible sequence of moves. Such a non-intersecting route is called [i]cyclic[/i], if the limp rook can, after reaching the last square of the route, move directly to the first square of the route and start over. How many squares does the longest possible cyclic, non-intersecting route of a limp rook visit? [i]Proposed by Nikolay Beluhov, Bulgaria[/i]

[b]9.[/b] Lep $p$ be a connected non-closed broken line without self-intersection in the plane $\varphi $. Prove that if $v$ is a non-zero vector in $\varphi $ and $p$ has a commom point with the broken line $p+v$, then $p$ has a common point with the broken line $p+\alpha v$ too, where $\alpha =\frac{1}{n}$ and $n$ is a positive integer. Does a similar statemente hold for other positive values of $\alpha$? ($p+v$ denotes the broken line obtained from $p$ through displacemente by the vector $v$.) [b](G. 1)[/b]

Let $p>q$ be primes, such that $240 \nmid p^4-q^4$. Find the maximal value of $\frac{q} {p}$.

Prove the following theorem: If two triangles have a common angle, then the sum of the sines of the angles will be larger in that triangle where the difference of the remaining two angles is smaller. On the basis of this theorem, determine the shape of that triangle for which the sum of the sines of its angles is a maximum.

Incircle of $ABC$ tangent $AB,AC,BC$ in $C_1,B_1,A_1$. $AA_1$ intersect incircle in $E$. $N$ is midpoint $B_1A_1$. $M$ is symmetric to $N$ relatively $AA_1$. Prove that $\angle EMC= 90$

In the right triangle $ABC,$ $CF$ is the altitude based on the hypotenuse $AB.$ The circle centered at $B$ and passing through $F$ and the circle with centre $A$ and the same radius intersect at a point of $CB.$ Determine the ratio $FB : BC.$

Let $P(x)$ be a quadratic polynomial with real coefficients. Suppose that $P(1) = 20, P(-1) = 22,$ and $P(P(0)) = 400.$ Compute the largest possible value of $P(10).$

Find all positive integers of form abcd such that $$\overline{abcd} = a^{a+b+c+d} - a^{-a+b-c+d} + a$$

For a finite non empty set of primes $P$, let $m(P)$ denote the largest possible number of consecutive positive integers, each of which is divisible by at least one member of $P$. (i) Show that $|P|\le m(P)$, with equality if and only if $\min(P)>|P|$. (ii) Show that $m(P)<(|P|+1)(2^{|P|}-1)$. (The number $|P|$ is the size of set $P$) [i]Dan Schwarz, Romania[/i]

For primes $a, b,c$ that satisfy the following, calculate $abc$. $\bullet$ $b + 8$ is a multiple of $a$, $\bullet$ $b^2 - 1$ is a multiple of $a$ and $c$ $\bullet$ $b + c = a^2 - 1$.

Let $a_1 < a_2 < a_3 < a_4$ be positive integers such that the following conditions hold: -$\gcd(a_i,a_j)>1$ holds for all integers $1\le i < j\le 4$. -$\gcd(a_i,a_j,a_k)=1$ holds for all integers $1\le i < j < k\le 4$. Find the smallest possible value of $a_4$. [i]Proposed by James Lin[/i]

Integers $n$ and $k$ satisfy $n > 2023k^3$. Kingdom Kitty has $n$ cities, with at most one road between each pair of cities. It is known that the total number of roads in the kingdom is at least $2n^{3/2}$. Prove that we can choose $3k + 1$ cities such that the total number of roads with both ends being a chosen city is at least $4k$.

There are an even number of points in a plane. No three of them lie on one straight line. Half of the points are red, the other half are blue. Prove that there exists a connecting line of a red and a blue point such that in each of the half-planes bounded by that line the number of red points is equal to the number of blue points.

Let $\alpha,\beta,\gamma$ be the angles of a triangle opposite to its sides with lengths $a,b,c$ respectively. Prove the inequality \[a\left(\frac{1}{\beta}+\frac{1}{\gamma}\right)+b\left(\frac{1}{\gamma}+\frac{1}{\alpha}\right)+c\left(\frac{1}{\alpha}+\frac{1}{\beta}\right)\ge2\left(\frac{a}{\alpha}+\frac{b}{\beta}+\frac{c}{\gamma}\right)\]