A straight line is drawn across an $8\times 8$ chessboard. It is said to [i]pierce [/i]a square if it passes through an interior point of the square. At most how many of the $64$ squares can this line [i]pierce[/i]?

Circle $k$ and its diameter $AB$ are given. Find the locus of the centers of circles inscribed in the triangles having one vertex on $AB$ and two other vertices on $k.$

Compute the smallest integer $n > 72$ that has the same set of prime divisors as $72.$

Point $D$ is on the hypotenuse $BC$ of right-angled triangle $ABC$. The inradii of triangles $ADB$ and $ADC$ are equal. Prove that $S_{ABC} = AD^2$, where $S$ is the area function.

Let $A=\frac{2^2+3\cdot 2 + 1}{3! \cdot 4!} + \frac{3^2+3\cdot 3 + 1}{4! \cdot 5!} + \frac{4^2+3\cdot 4 + 1}{5! \cdot 6!} + \dots + \frac{10^2+3\cdot 10 + 1}{11! \cdot 12!}$. What is the remainder when $11!\cdot 12! \cdot A$ is divided by $11$? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 8 \qquad\textbf{(E)}\ 10 $

Triangle $ABC$ is inscribed in circle $\omega$. A circle with chord $BC$ intersects segments $AB$ and $AC$ again at $S$ and $R$, respectively. Segments $BR$ and $CS$ meet at $L$, and rays $LR$ and $LS$ intersect $\omega$ at $D$ and $E$, respectively. The internal angle bisector of $\angle BDE$ meets line $ER$ at $K$. Prove that if $BE = BR$, then $\angle ELK = \tfrac{1}{2} \angle BCD$. [i]Proposed by Evan Chen[/i]

Show that if $x_1+x_2+x_3 = 0$ for real numbers $x_1,x_2,x_3$, then $x_1x_2+x_2x_3+x_3x_1\le 0$. Find all $n \ge 4$ for which $x_1+x_2+...+x_n = 0$ implies $x_1x_2+x_2x_3+...+x_{n-1}x_n+x_nx_1 \le 0$.

On a chessboard $8\times 8$, $n>6$ Knights are placed so that for any 6 Knights there are two Knights that attack each other. Find the greatest possible value of $n$.

3.Let ABCD be a parallelogram with side AB longer than AD and acute angle $\angle DAB$. The bisector of ∠DAB meets side CD at L and line BC at K. If O is the circumcenter of triangle LCK, prove that the points B,C,O,D lie on a circle.

[b]Problem 2[/b] Consider the infinite chessboard whose rows and columns are indexed by positive integers. Is it possible to put a single positive rational number into each cell of the chessboard so that each positive rational number appears exactly once and the sum of every row and of every column is finite?

Circles $S,S_1,S_2$ are given in a plane. $S_1$ and $S_2$ touch each other externally, and both touch $S$ internally at $A_1$ and $A_2$ respectively. The common internal tangent to $S_1$ and $S_2$ meets $S$ at $P$ and $Q.$ Let $B_1$ and $B_2$ be the intersections of $PA_1$ and $PA_2$ with $S_1$ and $S_2$, respectively. Prove that $B_1B_2$ is a common tangent to $S_1,S_2$

Let $a_{1},a_{2},...,a_{1999}$ be a sequence of nonnegative integers such that for any $i,j$ with $i+j\leq 1999$ , $a_{i}+a_{j}\leq a_{i+j}\leq a_{i}+a_{j}+1$. Prove that there exists a real number $x$ such that $a_{n}=[nx]\forall n$.

Find integer solutions of the equation $8x^3 - 4 = y(6x - y^2)$

suppose that $G<S_n$ is a subgroup of permutations of $\{1,...,n\}$ with this property that for every $e\neq g\in G$ there exist exactly one $k\in \{1,...,n\}$ such that $g.k=k$. prove that there exist one $k\in \{1,...,n\}$ such that for every $g\in G$ we have $g.k=k$.(20 points)

For a positive integer $n$, if $n$ is a product of two different primes and $n \equiv 2 \pmod 3$, then $n$ is called "special number." For example, $14, 26, 35, 38$ is only special numbers among positive integers $1$ to $50$. Prove that for any finite set $S$ with special numbers, there exist two sets $A, B$ such that [list] [*] $A \cap B = \emptyset, A \cup B = S$ [*] $||A| - |B|| \leq 1$ [*] For all primes $p$, the difference between number of elements in $A$ which is multiple of $p$ and number of elements in $B$ which is multiple of $p$ is less than or equal to $1$. [/list]

prove that for almost every real number $\alpha \in [0,1]$ there exists natural number $n_{\alpha} \in \mathbb N$ such that the inequality $|\alpha-\frac{p}{q}|\le \frac{1}{q^n}$ for natural $n\ge n_{\alpha}$ and rational $\frac{p}{q}$ has no answers.

Let $B$ be a $1 \times 2 \times 4$ box (rectangular parallelepiped). Let $R$ be the set of points that are within distance 3 of some point in $B$. (Note that $R$ contains $B$.) What is the volume of $R$?

Let $\mathcal{P}$ be the set of all polynomials $p(x)=x^4+2x^2+mx+n$, where $m$ and $n$ range over the positive reals. There exists a unique $p(x) \in \mathcal{P}$ such that $p(x)$ has a real root, $m$ is minimized, and $p(1)=99$. Find $n$. [i]Proposed by [b]AOPS12142015[/b][/i]

a) Two seventh graders and several eightth graders take part in a chess tournament. The two seventh graders together scored eight points. The scores of eightth graders are equal. How many eightth graders took part in the tournament? b) Ninth and tenth graders participated in a chess tournament. There were ten times as many tenth graders as ninth graders. The total score of tenth graders was $4.5$ times that of the ninth graders. What was the ninth graders score? Note: According to the rules of a chess tournament, each of the tournament participants ra plays one game with each of them. If one of the players wins the game, then he gets one point, and his opponent gets zero points. In case of a tie, the players receive 1/2 point.

In Tlaxcala, there is a transportation system that works through buses that travel from one city to another in one direction . A set $S$ of cities is said [i]beautiful[/i] if it contains at least three different cities and from each city $A$ in $S$ at least two buses depart, each one goes directly to a different city in $S$ and none of them is $A$ (if there is a direct bus from $A$ to a city $B$ in $S$, there is not necessarily a direct bus from $B$ to $A$). Show that if there exists a beautiful set of cities $S$, then there exists a beautiful $T$ subset of $S$, such that for any two cities in $T$, you can get from one to another by taking buses that only pass through cities in $T$. Note: A bus goes directly from one city to another if it does not pass through any other city.

Let $n$ be a positive integer. E. Chen and E. Chen play a game on the $n^2$ points of an $n \times n$ lattice grid. They alternately mark points on the grid such that no player marks a point that is on or inside a non-degenerate triangle formed by three marked points. Each point can be marked only once. The game ends when no player can make a move, and the last player to make a move wins. Determine the number of values of $n$ between $1$ and $2013$ (inclusive) for which the first player can guarantee a win, regardless of the moves that the second player makes. [i]Ray Li[/i]

Find all prime numbers that do not have a multiple ending in $2015$.

(a) Does there exist a polynomial $ P(x)$ with coefficients in integers, such that $ P(d) \equal{} \frac{2008}{d}$ holds for all positive divisors of $ 2008$? (b) For which positive integers $ n$ does a polynomial $ P(x)$ with coefficients in integers exists, such that $ P(d) \equal{} \frac{n}{d}$ holds for all positive divisors of $ n$?

Let $p$ a prime number, $p\geq 5$. Find the number of polynomials of the form \[ x^p + px^k + p x^l + 1, \quad k > l, \quad k, l \in \left\{1,2,\dots,p-1\right\}, \] which are irreducible in $\mathbb{Z}[X]$. [i]Valentin Vornicu[/i]

Determine all pairs $(m,n)$ of integers with $n \ge m$ satisfying the equation \[n^3+m^3-nm(n+m)=2023.\]