Dürer's $n \times m$ garden is surgically divided into $n \times m$ unit squares, and in the middle of one of these squares, he planted his favourite petunia. Dürer's gardener struggles with a mole, trying to drive him out of the magnificent garden, so he builds an underground wall on the edge of the garden. The only problem is that the mole managed to stay inside the walls.. When the mole meets a wall, it changes it's direction as if it was "reflected", that is, proceeding his route in the direction that includes the same angle with the wall as his direction before. The mole starts beneath the petunia, in a direction that includes a $45^o$ angle with the walls. Is it possible for the mole to cross the petunia in a direction perpendicular to it's original direction? (Think in terms of $n,m$.)

Suppose that $ p_1,p_2,p_3,q_1,q_2,q_3$ are six points in the plane and that the distance between $ p_i$ and $ q_j$ ($ i,j \equal{} 1,2,3$) is $ i \plus{} j$. Show that the six points are collinear.

For how many positive integers $n\le100$ is it true that $10n$ has exactly three times as many positive divisors as $n$ has?

Players $A$ and $B$ play a "paintful" game on the real line. Player $A$ has a pot of paint with four units of black ink. A quantity $p$ of this ink suffices to blacken a (closed) real interval of length $p$. In every round, player $A$ picks some positive integer $m$ and provides $1/2^m $ units of ink from the pot. Player $B$ then picks an integer $k$ and blackens the interval from $k/2^m$ to $(k+1)/2^m$ (some parts of this interval may have been blackened before). The goal of player $A$ is to reach a situation where the pot is empty and the interval $[0,1]$ is not completely blackened. Decide whether there exists a strategy for player $A$ to win in a finite number of moves.

$p$ is a prime. Find the largest integer $d$ such that $p^d$ divides $p^4!$.

Given a triangle $ ABC$ with angle $ C \geq 60^{\circ}$. Prove that: $ \left(a \plus{} b\right) \cdot \left(\frac {1}{a} \plus{} \frac {1}{b} \plus{} \frac {1}{c} \right) \geq 4 \plus{} \frac {1}{\sin\left(\frac {C}{2}\right)}.$

Find a way of arranging $n$ girls and $n$ boys around a round table for which $d_n-c_n$ is maximum, where dn is the number of girls sitting between two boys and $c_n$ is the number of boys sitting between two girls.

Circles $\omega_1$ and $\omega_2$ meet at points $A$ and $B$. Let points $K_1$ and $K_2 $ of $\omega_1$ and $\omega_2$ respectively be such that $K_1A$ touches $\omega_2$, and $K_2A$ touches $\omega_1$. The circumcircle of triangle $K_1BK_2$ meets lines $AK_1$ and $AK_2$ for the second time at points $L_1$ and $L_2$ respectively. Prove that $L_1$ and $L_2$ are equidistant from line $AB$.

Two triangles $ABC$ and $DEF$ have the same incircle. If a circle passes through $A,B,C,D,E$ prove that it also passes through $F$.

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