$\{a_n\}$ is an infinite, strictly increasing sequence of positive integers and $a_{a_n}\leq a_n+a_{n+3}$ for all $n\geq 1$. Prove that, there are infinitely many triples $(k,l,m)$ of positive integers such that $k<l<m$ and $a_k+a_m=2a_l$

A sphere is touched by all the four sides of a (space) quadrilateral. Prove that all the four touching points are in the same plane.

As shown in the figure, two circles $\Gamma_1$ and $\Gamma_2$ on the plane intersect at two points $A$ and $B$. The two rays passing through $A$, $\ell_1$ and $\ell_2$ intersect $\Gamma_1$ at points $D$ and $E$ respectively, and $\Gamma_2$ at points $F$ and $C$ respectively (where $E$ and $F$ lie on line segments $AC$ and $AD$ respectively, and neither of them coincides with the endpoints). It is known that the three lines $AB$, $CF$ and $DE$ have a common point, the circumscribed circle of $\vartriangle AEF$ intersects $AB$ at point $G$, the straight line $EG$ intersects the circle $\Gamma_1$ at point $P$, the straight line $FG$ intersects the circle $\Gamma_2$ at point $Q$. Let the symmetric points of $C$ and $D$ wrt the straight line $AB$ be $C'$ and $D'$ respectively. If $PD'$ and $QC'$ intersect at point$ J$, prove that $J$ lies on the straight line $AB$. [img]https://cdn.artofproblemsolving.com/attachments/3/7/eb3acdbad52750a6879b4b6955dfdb7de19ed3.png[/img]

Let $f: (0,+\infty)\rightarrow (0,+\infty)$ be a function satisfying the following condition: for arbitrary positive real numbers $x$ and $y$, we have $f(xy)\le f(x)f(y)$. Show that for arbitrary positive real number $x$ and natural number $n$, inequality $f(x^n)\le f(x)f(x^2)^{\dfrac{1}{2}}\dots f(x^n)^{\dfrac{1}{n}}$ holds.

Each of $A$, $B$, $C$, $D$, $E$, and $F$ knows a piece of gossip. They communicate by telephone via a central switchboard, which can connect only two of them at a time. During a conversation, each side tells the other everything he or she knows at that point. Determine the minimum number of calls for everyone to know all six pieces of gossip.

In a board of $2000\times2001$ squares with integer coordinates $(x,y)$, $0\leq{x}\leq1999$ and $0\leq{y}\leq2000$. A ship in the table moves in the following way: before a move, the ship is in position $(x,y)$ and has a velocity of $(h,v)$ where $x,y,h,v$ are integers. The ship chooses new velocity $(h^\prime,v^\prime)$ such that $h^\prime-h,v^\prime-v\in\{-1,0,1\}$. The new position of the ship will be $(x^\prime,y^\prime)$ where $x^\prime$ is the remainder of the division of $x+h^\prime$ by $2000$ and $y^\prime$ is the remainder of the division of $y+v^\prime$ by $2001$. There are two ships on the board: The Martian ship and the Human trying to capture it. Initially each ship is in a different square and has velocity $(0,0)$. The Human is the first to move; thereafter they continue moving alternatively. Is there a strategy for the Human to capture the Martian, independent of the initial positions and the Martian’s moves? [i]Note[/i]: The Human catches the Martian ship by reaching the same position as the Martian ship after the same move.

Find the least positive integer which is a multiple of $13$ and all its digits are the same. [i](Adapted from Gazeta Matematică 1/1982, Florin Nicolăită)[/i]

On the board are written $n$ natural numbers, $n\in \mathbb{N}$. In one move it is possible to choose two equal written numbers and increase one by $1$ and decrease the other by $1$. Prove that in this the game cannot be played more than $\frac{n^3}{6}$ moves.

Let $0\le a\le b\le c$ be real numbers. Prove that \[(a+3b)(b+4c)(c+2a)\ge 60abc \]

[b]1.[/b] Let $k$ be an arbitrary cardinality. Show that there exists a tournament $T_k = (V_n , E_n)$ such that for any coloring $f: E_n \to k$ of the edge set $E_n$, there are three different vertices $x_0 , x_1 , x_2 \in V_n$ such that $x_0 x_1 , x_1 x_2 , x_2 x_0 \in E_n$ and $\left | \{ f(x_0 x_1), f(x_1 x_2), f(x_2 x_0)\} \right |\leq 2$ (A [i]tounament[/i] is a directed graph such that for any vertices $x, y \in V_n, x \neq y$ exactly one of the relations $xy \in E_n$ holds.) ([b]C.19[/b]) [A. Hajnal]

Consider $4n$ points in the plane such that no three of them are collinear ($n\geq 1$). Show that the set of centroids of all the triangles formed by any three of these points contains at least $4n$ elements. [i]Radu Bumbăcea[/i]

Prove that for any $p>2$ prime number, there exists only one positive number $n$ that makes the equation $n^2-np$ a perfect square of a positive integer

Points $T,P,H$ lie on the side $BC,AC,AB$ respectively of triangle $ABC$, so that $BP$ and $AT$ are angle bisectors and $CH$ is an altitude of $ABC$. Given that the midpoint of $CH$ belongs to the segment $PT,$ find the value of $\cos A + \cos B$ I. Voronovich

For any positive integer $n$, define the subset $S_n$ of natural numbers as follow $$ S_n = \left\{x^2+ny^2 : x,y \in \mathbb{Z} \right\}.$$ Find all positive integers $n$ such that there exists an element of $S_n$ which [u]doesn't belong[/u] to any of the sets $S_1, S_2,\dots,S_{n-1}$. [i]Proposed by Yahya Motevassel[/i]

A rectangle with a diagonal of length $ x$ is twice as long as it is wide. What is the area of the rectangle? $ \textbf{(A)}\ \frac14x^2 \qquad \textbf{(B)}\ \frac25x^2 \qquad \textbf{(C)}\ \frac12x^2 \qquad \textbf{(D)}\ x^2 \qquad \textbf{(E)}\ \frac32x^2$

On the side $AB$ of a triangle $ABC$ is chosen a point $P$. Let $Q$ be the midpoint of $BC$ and let $CP$ and $AQ$ intersect at $R$. If $AB + AP = CP$, prove that $CR = AB$.

Let $ABC$ be a triangle. Construct three circles $k_1$, $k_2$, and $k_3$ with the same radius such that they intersect each other at a common point $O$ inside the triangle $ABC$ and $k_1\cap k_2=\{A,O\}$, $k_2 \cap k_3=\{B,O\}$, $k_3\cap k_1=\{C,O\}$. Let $t_a$ be a common tangent of circles $k_1$ and $k_2$ such that $A$ is closer to $t_a$ than $O$. Define $t_b$ and $t_c$ similarly. Those three tangents determine a triangle $MNP$ such that the triangle $ABC$ is inside the triangle $MNP$. Prove that the area of $MNP$ is at least $9$ times the area of $ABC$.

We are given five equal-looking weights of pairwise distinct masses. For any three weights $A$, $B$, $C$, we can check by a measuring if $m(A) < m(B) < m(C)$, where $m(X)$ denotes the mass of a weight $X$ (the answer is [i]yes[/i] or [i]no[/i].) Can we always arrange the masses of the weights in the increasing order with at most nine measurings?

Integers $a$ and $b$ are randomly chosen without replacement from the set of integers with absolute value not exceeding $10$. What is the probability that the polynomial $x^3 + ax^2 + bx + 6$ has $3$ distinct integer roots? $\textbf{(A)} \frac{1}{240} \qquad \textbf{(B)} \frac{1}{221} \qquad \textbf{(C)} \frac{1}{105} \qquad \textbf{(D)} \frac{1}{84} \qquad \textbf{(E)} \frac{1}{63}$.

(F.Nilov) Given quadrilateral $ ABCD$. Find the locus of points such that their projections to the lines $ AB$, $ BC$, $ CD$, $ DA$ form a quadrilateral with perpendicular diagonals.

Let $ABC$ be a triangle with circumcircle $\omega$ and let $\Omega_A$ be the $A$-excircle. Let $X$ and $Y$ be the intersection points of $\omega$ and $\Omega_A$. Let $P$ and $Q$ be the projections of $A$ onto the tangent lines to $\Omega_A$ at $X$ and $Y$ respectively. The tangent line at $P$ to the circumcircle of the triangle $APX$ intersects the tangent line at $Q$ to the circumcircle of the triangle $AQY$ at a point $R$. Prove that $\overline{AR} \perp \overline{BC}$.

What is the units digit of $13^{2012}$ ? $\textbf{(A)}\hspace{.05in}1 \qquad \textbf{(B)}\hspace{.05in}3 \qquad \textbf{(C)}\hspace{.05in}5 \qquad \textbf{(D)}\hspace{.05in}7 \qquad \textbf{(E)}\hspace{.05in}9 $

There are $100$ cities in Matland. Every road in Matland connects two cities, does not pass through any other city and does not form crossroads with other roads (although roads can go through tunnels one after the other). Driving in Matlandia by road, it is possible to get from any city to any other. Prove that that it is possible to repair some of the roads of Matlandia so that from an odd number of repaired roads would go in each city.

Let $\triangle ABC$ with $\angle BAC=120 ^\circ$. Let $D, E, F$ points on sides $BC, CA, AB$, respectively, such that $AD, BE, CF$ are angle bisectors on $\triangle ABC$. \\ Prove that $\triangle ABC$ is isosceles if and only if $\triangle DEF$ is right-angled isosceles.

A polynomial $A(x)$ is said to be [i]simple[/i] if $A(x)$ is divisible by $x$ but not divisible by $x^2$. Suppose that a polynomial $P(x)$ has a simple polynomial $Q(x)$ such that $P(Q(x))-Q(2x)$ is divisible by $x^2$. Prove that there exists a simple polynomial $R(x)$ such that $P(R(x))-R(2x)$ is divisible by $x^{2023}$.