In every cell of a table with $n$ rows and $m$ columns is written one of the letters $a$, $b$, $c$. Every two rows of the table have the same letter in at most $k\geq 0$ positions and every two columns coincide at most $k$ positions. Find $m$, $n$, $k$ if \[\frac{2mn+6k}{3(m+n)}\geq k+1\]

The lengths of the sides of a triangle are 6, 8 and 10 units. Prove that there is exactly one straight line which simultaneously bisects the area and perimeter of the triangle.

Find all pairs of integers $(a, b)$ such that $$a^2 + ab - b = 2018.$$

In a simple graph, there are two disjoint set of vertices $A$ and $B$ where $A$ has $k$ and $B$ has $2016$ vertices. Four numbers are written to each vertex using the colors red, green, blue and black. There is no any edge at the beginning. For each vertex in $A$, we first choose a color and then draw all edges from this vertex to the vertices in $B$ having a larger number with the chosen color. It is known that for each vertex in $B$, the set of vertices in $A$ connected to this vertex are different. Find the minimal possible value of $k$.

A convex quadrilateral $ABCD$ is inscribed in a circle with center $O$. The diagonals $AC$, $BD$ of $ABCD$ meet at $P$. Circumcircles of $\triangle ABP$ and $\triangle CDP$ meet at $P$ and $Q$ ($O,P,Q$ are pairwise distinct). Show that $\angle OQP=90^{\circ}$.

Let $p$ be a prime number. All natural numbers from $1$ to $p$ are written in a row in ascending order. Find all $p$ such that this sequence can be split into several blocks of consecutive numbers, such that every block has the same sum. [i]A. Khrabov[/i]

Let $n\geq3$ be an integer. We say that an arrangement of the numbers $1$, $2$, $\dots$, $n^2$ in a $n \times n$ table is [i]row-valid[/i] if the numbers in each row can be permuted to form an arithmetic progression, and [i]column-valid[/i] if the numbers in each column can be permuted to form an arithmetic progression. For what values of $n$ is it possible to transform any row-valid arrangement into a column-valid arrangement by permuting the numbers in each row?

Let $\triangle ABC$ have side lengths $AB=7$, $BC=8$, and $CA=9$. Let $D$ be the projection from $A$ to $\overline{BC}$ and $D'$ be the reflection of $D$ over the perpendicular bisector of $\overline{BC}$. Let $P$ and $Q$ be distinct points on the line through $D'$ parallel to $\overline{AC}$ such that $\angle APB = \angle AQB = 90^{\circ}$. The value of $AP+AQ$ can be written as $\tfrac{a+b\sqrt{c}}{d}$, where $a$, $b$, $c$, and $d$ are positive integers such that $b$ and $d$ are relatively prime, and $c$ is not divisible by the square of any prime. Find $a+b+c+d$. [i]Proposed by i3435[/i]

Given two directly congruent triangles $ABC$ and $A'B'C'$ in a plane, assume that the circles with centers $C$ and $C'$ and radii $CA$ and $C'A'$ intersect. Denote by $\mathcal M$ the transformation that maps $\triangle ABC$ to $\triangle A'B'C'$. Prove that $\mathcal M$ can be expressed as a composition of at most three rotations in the following way: The first rotation has the center in one of $A,B,C$ and maps $\triangle ABC$ to $\triangle A_1B_1C_1$; The second rotation has the center in one of $A_1,B_1,C_1$, and maps $\triangle A_1B_1C_1$ to $\triangle A_2B_2C_2$; The third rotation has the center in one of $A_2,B_2,C_2$ and maps $\triangle A_2B_2C_2$ to $\triangle A'B'C'$.

Let $AK$, $BL$ and $CM$ be the angle bisectors of a triangle $ABC$, with $K$ on $BC$. Let $P$ and $Q$ be the points on the lines $BL$ and $CM$ respectively such that $AP = PK$ and $AQ = QK$. Prove that $\angle PAQ = 90^o -\frac12 \angle B AC.$ (I Sharygin)

Given an odd integer $n \geq 3$. Let $V$ be the set of vertices of a regular $n$-gon, and $P$ be the set of all regular polygons formed by points in $V$. For instance, when $n=15$, $P$ consists of $1$ regular $15$-gon, $3$ regular pentagons, and $5$ regular triangles. Initially, all points in $V$ are uncolored. Two players, $A$ and $B$, play a game where they take turns coloring an uncolored point, with player $A$ starting and coloring points red, and player $B$ coloring points blue. The game ends when all points are colored. A regular polygon in $P$ is called $\textit{good}$ if it has more red points than blue points. Find the largest positive integer $k$ such that no matter how player $B$ plays, player $A$ can ensure that there are at least $k$ $\textit{good}$ polygons.

Outside of the trapezoid $ABCD$ with the smaller base $AB$ are constructed the squares $ADEF$ and $BCGH$. Prove that the perpendicular bisector of $AB$ passes through the midpoint of $FH$.

We represent the number line $R$ as the union of two non-empty sets $A, B$ different from $R$. Prove that one of the sets $A, B$ does not have the following property: the difference of any elements of the set belongs to the same set.

A game is played by two contestants A and B, each one having ten chips numbered from 1 to 10. The board of game consists of two numbered rows, from 1 to 1492 on the first row and from 1 to 1989 on the second. At the $n$-th turn, $n=1,2,\ldots,10$, A puts his chip numbered $n$ in any empty cell, and B puts his chip numbered $n$ in any empty cell on the row not containing the chip numbered $n$ from A. B wins the game if, after the 10th turn, both rows show the numbers of the chips in the same relative order. Otherwise, A wins. [list=a] [*] Which player has a winning strategy? [*] Suppose now both players has $k$ chips numbered 1 to $k$. Which player has a winning strategy? [*] Suppose further the rows are the set $\mathbb{Q}$ of rationals and the set $\mathbb{Z}$ of integers. Which player has a winning strategy? [/list]

The point $P$ lies inside $\vartriangle ABC$ so that $\vartriangle BPC$ is isosceles, and angle $P$ is a right angle. Furthermore both $\vartriangle BAN$ and $\vartriangle CAM$ are isosceles with a right angle at $A$, and both are outside $\vartriangle ABC$. Show that $\vartriangle MNP$ is isosceles and right-angled. [img]https://1.bp.blogspot.com/-i9twOChu774/XzcBLP-RIXI/AAAAAAAAMXA/n5TJCOJypeMVW28-9GDG4st5C47yhvTCgCLcBGAsYHQ/s0/2005%2BMohr%2Bp3.png[/img]

Acute triangle $ABC$ is inscribed in a circle with center $O$. The reflections of $O$ across the three altitudes of the triangle are called $U$, $V$, $W$: $U$ over the altitude from $A$, $V$ over the altitude from $B$, and $W$ over the altitude from $C$. Let $\ell_A$ be a line through $A$ parallel to $VW$, and define $\ell_B$, $\ell_C$ similarly. Prove that the three lines $\ell_A$, $\ell_B$, $\ell_C$ are concurrent.

Let $R$ be a ring of characteristic zero. Let $e,f,g\in R$ be idempotent elements (an element $x$ is called idempotent if $x^2=x$) satisfying $e+f+g=0$. Show that $e=f=g=0$.

Let $ABCD$ be a tetrahedron with $AB=CD=1300$, $BC=AD=1400$, and $CA=BD=1500$. Let $O$ and $I$ be the centers of the circumscribed sphere and inscribed sphere of $ABCD$, respectively. Compute the smallest integer greater than the length of $OI$. [i] Proposed by Michael Ren [/i]

A finite sequence of numbers $(a_1,\cdots,a_n)$ is said to be alternating if $$a_1>a_2~,~a_2<a_3~,~a_3>a_4~,~a_4<a_5~,~\cdots$$ $$\text{or ~}~~a_1<a_2~,~a_2>a_3~,~a_3<a_4~,~a_4>a_5~,~\cdots$$ How many alternating sequences of length $5$ , with distinct numbers $a_1,\cdots,a_5$ can be formed such that $a_i\in\{1,2,\cdots,20\}$ for $i=1,\cdots,5$ ?

Consider a complete graph of $2020$ vertices. What is the least number of edges that need to be marked such that each triangle ($3$-vertex subgraph) has an odd number of marked edges?

Let $x$, $y$, $z$ be real numbers such that $x+y+z \ne 0$. Find the minimum value of $\frac{|x|+|x+4y|+|y+7z|+2|z|}{|x+y+z|}$

Let $ABC$ be a triangle with $AB = 8, AC = 12,$ and $BC = 5.$ Let $M$ be the second intersection of the internal angle bisector of $\angle BAC$ with the circumcircle of $ABC.$ Let $\omega$ be the circle centered at $M$ tangent to $AB$ and $AC.$ The tangents to $\omega$ from $B$ and $C,$ other than $AB$ and $AC$ respectively, intersect at a point $D.$ Compute $AD.$

Let's call a number of the form $x^3+y^2$ with natural $x, y$ [i]successful[/i]. Are there infinitely many natural $m$ such that among the numbers from $m + 1$ to $m + 2016^2$ exactly 2017 are successful?

Numbers $1, 2, 3, . . . , 100$ are arranged in a circle in some order. A [i]good pair[/i] is a pair of numbers of the same parity, between which there are exactly $3$ numbers. What is the smallest possible number good pairs?

Consider a $100\times 100$ square unit lattice $\textbf{L}$ (hence $\textbf{L}$ has $10000$ points). Suppose $\mathcal{F}$ is a set of polygons such that all vertices of polygons in $\mathcal{F}$ lie in $\textbf{L}$ and every point in $\textbf{L}$ is the vertex of exactly one polygon in $\mathcal{F}.$ Find the maximum possible sum of the areas of the polygons in $\mathcal{F}.$ [i]Michael Ren and Ankan Bhattacharya, USA[/i]