$ P(x)$ is a quadratic trinomial. What maximum number of terms equal to the sum of the two preceding terms can occur in the sequence $ P(1)$, $ P(2)$, $ P(3)$, $ \dots?$ [i]Proposed by A. Golovanov[/i]

On the legs $AC$ and $BC$ of an isosceles right-angled triangle with a right angle $C$, points $D$ and $E$ are taken, respectively, so that $CD = CE$. Perpendiculars on line $AE$ from points $C$ and $D$ intersect segment $AB$ at points $P$ and $Q$, respectively. Prove that $BP = PQ$.

Simon expands factored polynomials with his favorite AI, ChatSFFT. However, he has not paid for a premium ChatSFFT account, so when he goes to expand $(m - a)(n - b),$ where $a, b, m, n$ are integers, ChatSFFT returns the sum of the two factors instead of the product. However, when Simon plugs in certain pairs of integer values for $m$ and $n,$ he realizes that the value of ChatSFFT’s result is the same as the real result in terms of $a$ and $b$. How many such pairs are there?

In the interior of a square $ABCD$ we construct the equilateral triangles $ABK, BCL, CDM, DAN.$ Prove that the midpoints of the four segments $KL, LM, MN, NK$ and the midpoints of the eight segments $AK, BK, BL, CL, CM, DM, DN, AN$ are the 12 vertices of a regular dodecagon.

Find all integers $ k$ such that for infinitely many integers $ n \ge 3$ the polynomial \[ P(x) =x^{n+ 1}+ kx^n - 870x^2 + 1945x + 1995\] can be reduced into two polynomials with integer coefficients.

Let $k$ be a fixed positive integer. The $n$th derivative of $\tfrac{1}{x^k-1}$ has the form $\tfrac{P_n(x)}{(x^k-1)^{n+1}}$, where $P_n(x)$ is a polynomial. Find $P_n(1)$.

For an integer $n>2$, the tuple $(1, 2, \ldots, n)$ is written on a blackboard. On each turn, one can choose two numbers from the tuple such that their sum is a perfect square and swap them to obtain a new tuple. Find all integers $n > 2$ for which all permutations of $\{1, 2,\ldots, n\}$ can appear on the blackboard in this way.

A lattice point in the coordinate plane with origin $O$ is called invisible if the segment $OA$ contains a lattice point other than $O,A$. Let $L$ be a positive integer. Show that there exists a square with side length $L$ and sides parallel to the coordinate axes, such that all points in the square are invisible.

Given a tetrahedron $ABCD$ and inside the tetrahedron points $K, L, M, N$ that do not lie on a plane. Denote also the centroids of $P$, $Q$, $R$, $S$ of the tetrahedrons $KBCD$, $ALCD$, $ABMD$, $ABCN$ do not lie on a plane. Let $T$ be the centroid of the tetrahedron ABCD, $T_o$ be the centroid of the tetrahedron $PQRS$ and $T_1$ be the centroid of the tetrahedron $KLMN$. a) Prove that the points $T, T_0, T_1$ lie in one straight line. b) Determine the ratio $|T_0T| : |T_0 T_1|$.

Let $P(x)$ be a polynomial with integer coefficients that has at least one rational root. Let $n$ be a positive integer. Alan and Allan are playing a game. First, Alan writes down $n$ integers at $n$ different locations on a board. Then Allan may make moves of the following kind: choose a position that has integer $a$ written, then choose a different position that has integer $b$ written, then at the first position erase $a$ and in its place write $a+P(b)$. After any nonnegative number of moves, Allan may choose to end the game. Once Allan ends the game, his score is the number of times the mode (most common element) of the integers on the board appears. Find, in terms of $P(x)$ and $n$, the maximum score Allan can guarantee. [i]Henrick Rabinovitz[/i]

Sixty points, of which thirty are coloured red, twenty are coloured blue and ten are coloured green, are marked on a circle. These points divide the circle into sixty arcs. Each of these arcs is assigned a number according to the colours of its endpoints: an arc between a red and a green point is assigned a number $1$, an arc between a red and a blue point is assigned a number $2$, and an arc between a blue and a green point is assigned a number $3$. The arcs between two points of the same colour are assigned a number $0$. What is the greatest possible sum of all the numbers assigned to the arcs?

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?$$

$ \angle BAC \equal{} 80{}^\circ$, $ \left|AB\right| \equal{} \left|AC\right|$, $ K\in \left[AB\right]$, $ L\in \left[AB\right.$, $ \left|AB\right|^{2} \equal{} \left|AK\right|\cdot \left|AL\right|$, $ \left|BL\right| \equal{} \left|BC\right|$, $ \angle KCB \equal{} ?$ $\textbf{(A)}\ 20^\circ \qquad\textbf{(B)}\ 25^\circ \qquad\textbf{(C)}\ 30^\circ \qquad\textbf{(D)}\ 35^\circ \qquad\textbf{(E)}\ 40^\circ$

Find all functions $f:\mathbb R\to\mathbb R$ so that the following relation holds for all $x, y\in\mathbb R$. $$f(f(x)f(y)-1) = xy - 1$$

Amy, Beth, and Jo listen to four different songs and discuss which ones they like. No song is liked by all three. Furthermore, for each of the three pairs of the girls, there is at least one song liked by those two girls but disliked by the third. In how many different ways is this possible? $ \textbf{(A)}\ 108\qquad\textbf{(B)}\ 132\qquad\textbf{(C)}\ 671\qquad\textbf{(D)}\ 846\qquad\textbf{(E)}\ 1105 $

$2020*N$ is a perfect cube. If $N$ can be expressed as $2^a*5^b*101^c,$ find the least possible value of $a+b+c$ such that $a,b,c$ are all positive integers and not necessarily distinct. [i]Proposed by Ephram Chun[/i]

Given some monic polynomials $P_1, \ldots, P_n$ with real coefficients, for any real number $y$, let $S_y$ be the set of real number $x$ such that $y = P_i(x)$ for some $i = 1, 2, ..., n$. If the sets $S_{y_1}, S_{y_2}$ have the same size for any two real numbers $y_1, y_2$, show that $P_1, \ldots, P_n$ have the same degree. [i] Proposed by usjl[/i]

If $a$ and $b$ are selected uniformly from $\{0,1,\ldots,511\}$ without replacement, the expected number of $1$'s in the binary representation of $a+b$ can be written in simplest from as $\tfrac{m}{n}$. Compute $m+n$.

Johnny writes down quadratic equation \[ax^2 + bx + c = 0.\] with positive integer coefficients $a, b, c$. Then Pete changes one, two, or none “$+$” signs to “$-$”. Johnny wins, if both roots of the (changed) equation are integers. Otherwise (if there are no real roots or at least one of them is not an integer), Pete wins. Can Johnny choose the coefficients in such a way that he will always win?

Three friends A, B and C have a total of $120$ kroner. First, A gives as much money to B as B already has. Next, B gives as many money to C that C already has. In the end, C gives the same amount of money to A as A now has. After these transactions, A, B and C have equal amounts of money. How many money did each of the three companions have originally?

Frankie the Frog starts his morning at the origin in $\mathbb{R}^2$. He decides to go on a leisurely stroll, consisting of $3^1+3^{10}+3^{11}+3^{100}+3^{111}+3^{1000}$ moves, starting with the first move. On the $n$th move, he hops a distance of $$\max\{k\in\mathbb{Z}:3^k|n\}+1,$$ then turns $90^{\circ}$ counterclockwise. What is the square of the distance from his final position to the origin?

$M$ and $N$ are the midpoints of sides $BC$ and $AD$, respectively, of a square $ABCD$. $K$ is an arbitrary point on the extension of the diagonal $AC$ beyond $A$. The segment $KM$ intersects the side $AB$ at some point $L$. Prove that $\angle KNA = \angle LNA$. [i](4 points)[/i]

Let $a,\ b$ real numbers such that $a>1,\ b>1.$ Prove the following inequality. \[\int_{-1}^1 \left(\frac{1+b^{|x|}}{1+a^{x}}+\frac{1+a^{|x|}}{1+b^{x}}\right)\ dx<a+b+2\]

The plane is divided into unit squares. Each box should be be colored in one of $n$ colors , so that if four squares can be covered with an $L$-tetromino, then these squares have four different colors (the $L$-Tetromino may be rotated and be mirrored). Find the smallest value of $n$ for which this is possible.

Mike has two similar pentagons. The first pentagon has a perimeter of $18$ and an area of $8 \frac{7}{16}$ . The second pentagon has a perimeter of $24$. Find the area of the second pentagon.