BALTIC-WAY 2019

For all non-negative real numbers $x,y,z$ with $x \geq y$ , prove the inequality $$\frac{x^3-y^3+z^3+1}{6}\geq (x-y)\sqrt{xyz}.$$

Let $(F_n)$ be the sequence defined recursively by $F_1=F_2=1$ and $F_{n+1}=F_n+F_{n-1}$ for $n\geq 2$ . Find all pairs of positive integers $(x,y)$ such that $$5F_x-3F_y=1.$$

Find all functions $f:\mathbb{R}\to\mathbb{R}$ such that $$f(xf(y)-y^2)=(y+1)f(x-y)$$ holds for all $x,y\in\mathbb{R}$ .

Alice and Bob play the following game. They write the expressions $x + y$ , $x - y$ , $x^2+xy+y^2$ and $x^2-xy+y^2$ each on a separate card. The four cards are shuffled and placed face down on a table. One of the cards is turned over, revealing the expression written on it, after which Alice chooses any two of the four cards, and gives the other two to Bob. All cards are then revealed. Now Alice picks one of the variables $x$ and $y$ , assigns a real value to it, and tells Bob what value she assigned and to which variable. Then Bob assigns a real value to the other variable.

Finally, they both evaluate the product of the expressions on their two cards. Whoever gets the larger result, wins. Which player, if any, has a winning strategy?

There are $2019$ cities in the country of Balticwayland. Some pairs of cities are connected by non-intersecting bidirectional roads, each road connecting exactly 2 cities. It is known that for every pair of cities $A$ and $B$ it is possible to drive from $A$ to $B$ using at most $2$ roads. There are $62$ cops trying to catch a robber. The cops and robber all know each others' locations at all times. Each night, the robber can choose to stay in her current city or move to a neighbouring city via a direct road. Each day, each cop has the same choice of staying or moving, and they coordinate their actions. The robber is caught if she is in the same city as a cop at any time. Prove that the cops can always catch the robber

There are $2019$ points given in the plane. A child wants to draw $k$ (closed) discs in such a manner, that for any two distinct points there exists a disc that contains exactly one of these two points. What is the minimal $k$ , such that for any initial configuration of points it is possible to draw $k$ discs with the above property?

Let $ABC$ be a triangle with $AB = AC$ . Let $M$ be the midpoint of $BC$ . Let the circles with diameters $AC$ and $BM$ intersect at points $M$ and $P$ . Let $MP$ intersect $AB$ at $Q$ . Let $R$ be a point on $AP$ such that $QR \parallel BP$ . Prove that $CP$ bisects $\angle RCB$ .

Let $ABC$ be a triangle and $H$ its orthocenter. Let $D$ be a point lying on the segment $AC$ and let $E$ be the point on the line $BC$ such that $BC\perp DE$ . Prove that $EH\perp BD$ if and only if $BD$ bisects $AE$ .

Let $ABCDEF$ be a convex hexagon in which $AB=AF$ , $BC=CD$ , $DE=EF$ and $\angle ABC = \angle EFA = 90^{\circ}$ . Prove that $AD\perp CE$ .

Let $ABC$ be a triangle with $\angle ABC = 90^{\circ}$ , and let $H$ be the foot of the altitude from $B$ . The points $M$ and $N$ are the midpoints of the segments $AH$ and $CH$ , respectively. Let $P$ and $Q$ be the second points of intersection of the circumcircle of the triangle $ABC$ with the lines $BM$ and $BN$ , respectively. The segments $AQ$ and $CP$ intersect at the point $R$ . Prove that the line $BR$ passes through the midpoint of the segment $MN$ .

For a positive integer $N$ , let $f(N)$ be the number of ordered pairs of positive integers $(a,b)$ such that the number $$\frac{ab}{a+b}$$ is a divisor of $N$ . Prove that $f(N)$ is always a perfect square.

Let $p$ be an odd prime. Show that for every integer $c$ , there exists an integer $a$ such that $$a^{\frac{p+1}{2}} + (a+c)^{\frac{p+1}{2}} \equiv c\pmod p.$$

Let $a,b$ , and $c$ be odd positive integers such that $a$ is not a perfect square and $$a^2+a+1 = 3(b^2+b+1)(c^2+c+1).$$ Prove that at least one of the numbers $b^2+b+1$ and $c^2+c+1$ is composite.

Prove that the equation $7^x=1+y^2+z^2$ has no solutions over positive integers.

Let us consider a polynomial $P(x)$ with integers coefficients satisfying $$P(-1)=-4,\ P(-3)=-40,\text{ and } P(-5)=-156.$$ What is the largest possible number of integers $x$ satisfying $$P(P(x))=x^2?$$