Call admissible a set $A$ of integers that has the following property: If $x,y \in A$ (possibly $x=y$) then $x^2+kxy+y^2 \in A$ for every integer $k$. Determine all pairs $m,n$ of nonzero integers such that the only admissible set containing both $m$ and $n$ is the set of all integers. [i]Proposed by Warut Suksompong, Thailand[/i]

Seventeen football fans were planning to go to Korea to watch the World Cup football match. They selected 17 matches. The conditions of the admission tickets they booked were such that - One person should book at most one admission ticket for one match; - At most one match was same in the tickets booked by every two persons; - There was one person who booked six tickets. How many tickets did those football fans book at most?

Find the smallest positive integer that uses exactly two different digits when written in decimal notation and is divisible by all the numbers from $1$ to $9$.

Given an acute triangle $ABC$ such that $\angle C< \angle B< \angle A$. Let $I$ be the incenter of $ABC$. Let $M$ be the midpoint of the smaller arc $BC$, $N$ be the midpoint of the segment $BC$ and let $E$ be a point such that $NE=NI$. The line $ME$ intersects circumcircle of $ABC$ at $Q$ (different from $A, B$, and $C$). Prove that [b](i)[/b] The point $Q$ is on the smaller arc $AC$ of circumcircle of $ABC$. [b](ii)[/b] $BQ=AQ+CQ$

[b]a) [/b]Is the number $ 1111\cdots11$ (with $ 2010$ ones) a prime number? [b]b)[/b] Prove that every prime factor of $ 1111\cdots11$ (with $ 2011$ ones) is of the form $ 4022j\plus{}1$ where $ j$ is a natural number.

Physicists at Princeton are trying to analyze atom entanglement using the following experiment. Originally there is one atom in the space and it starts splitting according to the following procedure. If after $n$ minutes there are atoms $a_1, \dots, a_N$, in the following minute every atom $a_i$ splits into four new atoms, $a_i^{(1)},a_i^{(2)},a_i^{(3)},a_i^{(4)}$. Atoms $a_i^{(j)}$ and $a_k^{(j)}$ are entangled if and only the atoms $a_i$ and $a_k$ were entangled after $n$ minutes. Moreover, atoms $a_i^{(j)}$ and $a_k^{(j+1)}$ are entangled for all $1 \le i$, $k \le N$ and $j = 1$, $2$, $3$. Therefore, after one minute there is $4$ atoms, after two minutes there are $16$ atoms and so on. Physicists are now interested in the number of unordered quadruplets of atoms $\{b_1, b_2, b_3, b_4\}$ among which there is an odd number of entanglements. What is the number of such quadruplets after $3$ minutes? [i]Remark[/i]. Note that atom entanglement is not transitive. In other words, if atoms $a_i$, $a_j$ are entangled and if $a_j$, $a_k$ are entangled, this does not necessarily mean that $a_i$ and $a_k$ are entangled.

Let $n$ be a positive integer. Prove that $a(n) = n^5 +5^n$ is divisible by $11$ if and only if $b(n) = n^5 · 5^n +1$ is divisible by $11$. [i](Walther Janous)[/i]

$ \frac{3 \times 5}{9 \times 11} \times \frac{7 \times 9 \times 11}{3 \times 5 \times 7}\equal{}$ \[ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 0 \qquad \textbf{(C)}\ 49 \qquad \textbf{(D)}\ \frac{1}{49} \qquad \textbf{(E)}\ 50 \]

Let $P$ be a cyclic polygon with circumcenter $O$ that does not lie on any diagonal, and let $S$ be the set of points on 2D plane containing $P$ and $O$. The $\textit{Matcha Sweep Game}$ is a game between two players $A$ and $B$, with $A$ going first, such that each choosing a nonempty subset $T$ of points in $S$ that has not been previously chosen, and such that if $T$ has at least $3$ vertices then $T$ forms a convex polygon. The game ends with all points have been chosen, with the player picking the last point wins. For which polygons $P$ can $A$ guarantee a win? [i]Proposed by Anzo Teh Zhao Yang[/i]

We say the set $ \{1,2,\ldots,3k\}$ has property $ D$ if it can be partitioned into disjoint triples so that in each of them a number equals the sum of the other two. (a) Prove that $ \{1,2,\ldots,3324\}$ has property $ D$. (b) Prove that $ \{1,2,\ldots,3309\}$ hasn't property $ D$.

Let $ A,B$ be different points on a parabola. Prove that we can find $ P_1,P_2,\dots,P_{n}$ between $ A,B$ on the parabola such that area of the convex polygon $ AP_1P_2\dots P_nB$ is maximum. In this case prove that the ratio of $ S(AP_1P_2\dots P_nB)$ to the sector between $ A$ and $ B$ doesn't depend on $ A$ and $ B$, and only depends on $ n$.

Denote by $ M(r,f)$ the maximum modulus on the circle $ |z|\equal{}r$ of the transcendent entire function $ f(z)$, and by $ M_n(r,f)$ that of the $ nth$ partial sum of the power series of $ f(z)$. Prove that the existence of an entire function $ f_0(z)$ and a corresponding sequence of positive numbers $ r_1<r_2<...\rightarrow \plus{}\infty$ such that \[ \limsup_{n\rightarrow\infty} \frac{M_n(r_n,f_0)}{M(r_n,f_0)}\equal{}\plus{}\infty\] [P. Turan]

If $ABC$ is acute triangle, prove distance from each vertex to corresponding excentre is less than sum of two greatest side of triangle

Let $P(x)$ be a polynomial of degree at most $2018$ such that $P(i)=\binom{2018}i$ for all integer $i$ such that $0\le i\le 2018$. Find the largest nonnegative integer $n$ such that $2^n\mid P(2020)$. [i]Proposed by Michael Ren

In a $10$ by $10$ square grid (which we call “the bay”) you are requested to place ten “ships”: one $1$ by $4$ ship, two $1$ by $3$ ships, three $1$ by $2$ ships and four $1$ by $1$ ships. The ships may not have common points (even corners) but may touch the “shore” of the bay. Prove that (a) by placing the ships one after the other arbitrarily but in the order indicated above, it is always possible to complete the process; (b) by placing the ships in reverse order (beginning with the smaller ones), it is possible to reach a situation where the next ship cannot be placed (give an example). (KN Ignatjev)

The tangents at $A$ and $B$ to the circumcircle of the acute triangle $ABC$ intersect the tangent at $C$ at the points $D$ and $E$, respectively. The line $AE$ intersects $BC$ at $P$ and the line $BD$ intersects $AC$ at $R$. Let $Q$ and $S$ be the midpoints of the segments $AP$ and $BR$ respectively. Prove that $\angle ABQ=\angle BAS$.

An urn contains marbles of four colors: red, white, blue, and green. When four marbles are drawn without replacement, the following events are equally likely: (a) the selection of four red marbles; (b) the selection of one white and three red marbles; (c) the selection of one white, one blue, and two red marbles; and (d) the selection of one marble of each color. What is the smallest number of marbles satisfying the given condition? $\text{(A)}\ 19 \qquad \text{(B)}\ 21 \qquad \text{(C)}\ 46 \qquad \text{(D)}\ 69\qquad \text{(E)}\ \text{more than 69}$

Wesyu is a farmer, and she's building a cao (a relative of the cow) pasture. Shw starts with a triangle $A_0A_1A_2$ where angle $A_0$ is $90^\circ$, angle $A_1$ is $60^\circ$, and $A_0A_1$ is $1$. She then extends the pasture. FIrst, she extends $A_2A_0$ to $A_3$ such that $A_3A_0=\dfrac12A_2A_0$ and the new pasture is triangle $A_1A_2A_3$. Next, she extends $A_3A_1$ to $A_4$ such that $A_4A_1=\dfrac16A_3A_1$. She continues, each time extending $A_nA_{n-2}$ to $A_{n+1}$ such that $A_{n+1}A_{n-2}=\dfrac1{2^n-2}A_nA_{n-2}$. What is the smallest $K$ such that her pasture never exceeds an area of $K$?

Given a segment $AB$ of length $2003$ in a coordinate plane, determine the maximal number of unit squares with vertices in the lattice points whose intersection with the given segment is non-empty.

The sequences $a_1, a_2, a_3,...$ and $b_1, b_2, b_3,... $suffices for all positive integers $n$ of the following recursion: $a_{n+1} = a_n - b_n$ and $b_{n+1} = 2b_n$, if $a_n \ge b_n$, $a_{n+1} = 2a_n$ and $b_{n+1} = b_n - a_n$, if $a_n < b_n$. For which pairs $(a_1, b_1)$ of positive real initial terms is there an index $k$ with $a_k = 0$?

Find all functions $f$ of two variables, whose arguments $x,y$ and values $f(x,y)$ are positive integers, satisfying the following conditions (for all positive integers $x$ and $y$): \begin{align*} f(x,x)& =x,\\ f(x,y)& =f(y,x),\\ (x+y)f(x,y)& =yf(x,x+y).\end{align*}

A line $l$ is drawn through the intersection point $H$ of altitudes of acute-angle triangles. Prove that symmetric images $l_a, l_b, l_c$ of $l$ with respect to the sides $BC,CA,AB$ have one point in common, which lies on the circumcircle of $ABC.$

The diagonals of a cyclic quadrilateral $ABCD$ intersect at $E$. Let $F$ and $G$ be the midpoints of $AB$ and $CD$ respectively. Prove that the lines through $E,F$ and $G$ perpendicular to $AD,BD$ and $AC$, respectively, intersect in a single point.

If $a$,$b$,$c$ are positive reals, prove that $$\frac{a+bc}{a+a^2}+\frac{b+ca}{b+b^2}+\frac{c+ab}{c+c^2} \geq 3$$

Let $n$ be a positive integer. Given is a subset $A$ of $\{0,1,...,5^n\}$ with $4n+2$ elements. Prove that there exist three elements $a<b<c$ from $A$ such that $c+2a>3b$. [i]Proposed by Dominik Burek and Tomasz Ciesla, Poland[/i]