In a classroom there are $20$ rows of $22$ desks each $(22$ desks have noone in front of them). The $440$ contestants of a certain regional math contest are going to sit at the desks. Before the exam, the organizers left some amount of sweets on each desk, which amount can be any positive integer. When the students go into the room, just before sitting down they look at the desk behind them, the one on the left and the one diagonally opposite to the right of theirs, thus seeing how many sweets each one has; if there is no desk in any of these directions, they simply ignore that position. Then they sit and watch their own sweets. A student gets angry if any of the desks he saw has more than one candy more than his. The organizers managed to distribute the sweets in such a way that no student gets angry. Prove that there are $8$ students with the same amount of sweets.

Let $ABCD$ be a parallelogram. A line through $C$ crosses the side $AB$ at an interior point $X$, and the line $AD$ at $Y$. The tangents of the circle $AXY$ at $X$ and $Y$, respectively, cross at $T$. Prove that the circumcircles of triangles $ABD$ and $TXY$ intersect at two points, one lying on the line $AT$ and the other one lying on the line $CT$.

In a plane, 2014 lines are distributed in 3 groups. in every group all the lines are parallel between themselves. What is the maximum number of triangles that can be formed, such that every side of such triangle lie on one of the lines?

A finite sequence $x_1,\dots,x_r$ of positive integers is a [i]palindrome[/i] if $x_i=x_{r+1-i}$ for all integers $1 \le i \le r$. Let $a_1,a_2,\dots$ be an infinite sequence of positive integers. For a positive integer $j \ge 2$, denote by $a[j]$ the finite subsequence $a_1,a_2,\dots,a_{j-1}$. Suppose that there exists a strictly increasing infinite sequence $b_1,b_2,\dots$ of positive integers such that for every positive integer $n$, the subsequence $a[b_n]$ is a palindrome and $b_{n+2} \le b_{n+1}+b_n$. Prove that there exists a positive integer $T$ such that $a_i=a_{i+T}$ for every positive integer $i$.

Let $ABC$ be an acute-angled triangle with $AC>BC$ and circumcircle $\omega$. Suppose that $P$ is a point on $\omega$ such that $AP=AC$ and that $P$ is an interior point on the shorter arc $BC$ of $\omega$. Let $Q$ be the intersection point of the lines $AP$ and $BC$. Furthermore, suppose that $R$ is a point on $\omega$ such that $QA=QR$ and $R$ is an interior point of the shorter arc $AC$ of $\omega$. Finally, let $S$ be the point of intersection of the line $BC$ with the perpendicular bisector of the side $AB$. Prove that the points $P, Q, R$ and $S$ are concyclic. [i]Proposed by Patrik Bak, Slovakia[/i]

There exists a certain right triangle with the smallest area in the $2$D coordinate plane such that all of its vertices have integer coordinates but none of its sides are parallel to the $x$- or $y$-axis. Additionally, all of its sides have distinct, integer lengths. What is the area of this triangle?

A triangle has sides of length $9$, $40$, and $41$. What is its area?

Determine whether there exists a polynomial $f(x_1, x_2)$ with two variables, with integer coefficients, and two points $A=(a_1, a_2)$ and $B=(b_1, b_2)$ in the plane, satisfying the following conditions: (i) $A$ is an integer point (i.e $a_1$ and $a_2$ are integers); (ii) $|a_1-b_1|+|a_2-b_2|=2010$; (iii) $f(n_1, n_2)>f(a_1, a_2)$ for all integer points $(n_1, n_2)$ in the plane other than $A$; (iv) $f(x_1, x_2)>f(b_1, b_2)$ for all integer points $(x_1, x_2)$ in the plane other than $B$. [i]Massimo Gobbino, Italy[/i]

Let $\triangle ABC$ be a triangle such that the angle bisector of $\triangle BAC,$ the median from $B$ to side $AC,$ and the perpendicular bisector of $AB$ intersect at a single point $X.$ If $AX = 5$ and $AC = 12,$ compute $a+b$ where $BC^2=\tfrac{a}{b}$ and $a,b$ are coprime positive integers. .

Help me, plz! : Solve, in integers, the equation 16x + 1 = (x^2 - y^2)^2 ?

There is a grid of height $2$ stretching infinitely in one direction. Between any two edge-adjacent cells of the grid, there is a door that is locked with probability $\frac12$ independent of all other doors. Philip starts in a corner of the grid (in the starred cell). Compute the expected number of cells that Philip can reach, assuming he can only travel between cells if the door between them is unlocked. [img]https://cdn.artofproblemsolving.com/attachments/f/d/fbf9998270e16055f02539bb532b1577a6f92a.png[/img]

Danielle draws a point $O$ on the plane and a set of points $\mathcal P = \{P_0, P_1, \ldots , P_{2022}\}$ such that $$\angle{P_0OP_1} = \angle{P_1OP_2} = \cdots = \angle{P_{2021}OP_{2022}} = \alpha, \hspace{5pt} 0 < \alpha < \pi,$$where the angles are measured counterclockwise and for $0 \leq n \leq 2022$, $OP_n = r^n$, where $r > 1$ is a given real number. Then, obtain new sets of points in the plane by iterating the following process: given a set of points $\{A_0, A_1, \ldots , A_n\}$ in the plane, it is built a new set of points $\{B_0, B_1, \ldots , B_{n-1}\}$ such that $A_kA_{k+1}B_k$ is an equilateral triangle oriented clockwise for $0 \leq k \leq n - 1$. After carrying out the process $2022$ times from the set $P$, Danielle obtains a single point $X$. If the distance from $X$ to point $O$ is $d$, show that $$(r-1)^{2022} \leq d \leq (r+1)^{2022}.$$

Let $n$ be a positive integer. Consider $n^2+1$ (closed, i.e. including endpoints) segments on a single line. Show that at least one of the following statements holds: a) there are $n+1$ segments with non-empty intersection, b) there are $n+1$ segments among which two of them are disjoint.

Show that if a unit square is partitioned into two sets, then the diameter (least upper bound of the distances between pairs of points) of one of the sets is not less than $\sqrt{5} \slash 2.$ Show also that no larger number will do.

Evaluate $(2-\sec^2{1^\circ})(2-\sec^2{2^\circ})(2-\sec^2{3^\circ})\cdots(2-\sec^2{89^\circ}).$

Let $I$ be the incenter of a nonisosceles triangle $ABC$. Prove that there exists a unique pair of points $M$, $N$ lying on the sides $AC$, $BC$ respectively, such that $\angle AIM = \angle BIN$ and $MN|| AB$.

Find all functions $ f: \mathbb {R} \rightarrow \mathbb {R} $ satisfying the equality $ f (x ^ 2-y ^ 2) = (x-y) (f (x) + f (y)) $ for any $ x, y \in \mathbb {R} $.

Let $\alpha$ be a root of the equation $x^3-5x+3=0$ and let $f(x)$ be a polynomial with rational coefficients. Prove that if $f(\alpha)$ be the root of equation above, then $f(f(\alpha))$ is a root, too.

Emperor Zorg wishes to found a colony on a new planet. Each of the $n$ cities that he will establish there will have to speak exactly one of the Empire's $2020$ official languages. Some towns in the colony will be connected by a direct air link, each link can be taken in both directions. The emperor fixed the cost of the ticket for each connection to $1$ galactic credit. He wishes that, given any two cities speaking the same language, it is always possible to travel from one to the other via these air links, and that the cheapest trip between these two cities costs exactly $2020$ galactic credits. For what values of $n$ can Emperor Zorg fulfill his dream?

On the diagonal $AC$ of a convex quadrilateral $ABCD$ is chosen such a point $K$ such that $KD = DC$, $\angle BAC = \frac12 \angle KDC$, $\angle DAC = \frac12 \angle KBC$. Prove that $\angle KDA = \angle BCA$ or $\angle KDA = \angle KBA$.

Numbers $\frac{49}{1}, \frac{49}{2}, ... , \frac{49}{97}$ are writen on a blackboard. Each time, we can replace two numbers (like $a, b$) with $2ab-a-b+1$. After $96$ times doing that prenominate action, one number will be left on the board. Find all the possible values fot that number.

Given an integer \( n \geq 1 \), Jo-Ané alternately writes crosses (\( \mathcal{X} \)) and circles (\( \mathcal{O}\)) in the cells of a square grid with \( 2n + 1 \) rows and \( 2n + 1 \) columns: she first writes a cross in a cell, then a circle in a second cell, then a cross in a third cell, and so on. When the table is completely filled, her score is calculated as the sum \( \mathcal{X}+ \mathcal{O} \), where \( \mathcal{X} \) is the number of rows containing more crosses than circles and \( \mathcal{O} \) is the number of columns containing more circles than crosses. Determine, in terms of \( n \), the highest possible score that Jo-Ané can obtain..

Consider $13$ weights of integer mass (in grams). It is known that any $6$ of them may be placed onto two pans of a balance achieving equilibrium. Prove that all the weights are of equal mass.

In an acute-angled triangle \(ABC\), \(H\) be the orthocenter of it and \(D\) be any point on the side \(BC\). The points \(E, F\) are on the segments \(AB, AC\), respectively, such that the points \(A, B, D, F\) and \(A, C, D, E\) are cyclic. The segments \(BF\) and \(CE\) intersect at \(P.\) \(L\) is a point on \(HA\) such that \(LC\) is tangent to the circumcircle of triangle \(PBC\) at \(C.\) \(BH\) and \(CP\) intersect at \(X\). Prove that the points \(D, X, \) and \(L\) lie on the same line. [i]Proposed by Theoklitos Parayiou, Cyprus [/i]

Non-zero real numbers $a, b, c$ satisfy the condition $\frac{1}{a}+\frac{2}{b}+\frac{3}{c}= 0$. Determine the value of $w =\frac{3b + 2c}{6a}+\frac{2c + 6a}{3b}+\frac{6a + 3b}{2c}$ .