Stoyan and Nikolai have two $100\times 100$ chess boards. Both of them number each cell with the numbers $1$ to $10000$ in some way. Is it possible that for every two numbers $a$ and $b$, which share a common side in Nikolai's board, these two numbers are at a knight's move distance in Stoyan's board (that is, a knight can move from one of the cells to the other one with a move)? [i]Nikolai Beluhov[/i]

It is known that $\odot O$ is the circumcircle of $\vartriangle ABC$ wwith diameter $AB$. The tangents of $\odot O$ at points $B$ and $C$ intersect at $P$ . The line perpendicular to $PA$ at point $A$ intersects the extension of $BC$ at point $D$. Extend $DP$ at length $PE = PB$. If $\angle ADP = 40^o$ , find the measure of $\angle E$.

From $2008 \times 2008$ square we remove one corner cell $1 \times 1$. Is number of ways to divide this figure to corners from $3$ cells odd or even ?

[b](a)[/b] Determine if exist an integer $n$ such that $n^2 -k$ has exactly $10$ positive divisors for each $k = 1, 2, 3.$ [b](b) [/b]Show that the number of positive divisors of $n^2 -4$ is not $10$ for any integer $n.$

$\triangle KWU$ is an equilateral triangle with side length $12$. Point $P$ lies on minor arc $\overarc{WU}$ of the circumcircle of $\triangle KWU$. If $\overline{KP} = 13$, find the length of the altitude from $P$ onto $\overline{WU}$. [i]Proposed by Bradley Guo[/i]

A simple calculator is given to you. (It contains 8 digits and only does the operations +,-,*,/,$ \sqrt{\mbox{}}$) How can you find $ 3^{\sqrt{2}}$ with accuracy of 6 digits.

Prove that there exist infinitely many positive integers $x,y,z$ for which the sum of the digits in the decimal representation of $~4x^4+y^4-z^2+4xyz$ $~$ is at most $2$. (Proposed by Gerhard Woeginger, Austria)

Consider the lattice of all algebraically closed subfields of the complex field $ \mathbb{C}$ whose transcendency degree (over $ \mathbb{Q}$) is finite. Prove that this lattice is not modular. [i]L. Babai[/i]

Consider the triangle $\triangle ABC$ with $AB \not = AC$. Let point $O$ be the circumcenter of $\triangle ABC$. Let the angle bisector of $\angle BAC$ intersect $BC$ at point $D$. Let $E$ be the reflection of point $D$ across the midpoint of the segment $BC$. The lines perpendicular to $BC$ in points $D,E$ intersect the lines $AO,AD$ at the points $X,Y$ respectively. Prove that the quadrilateral $B,X,C,Y$ is cyclic.

Jerry is bored one day, so he makes an array of Cocoa pebbles. He makes 8 equal rows with the pebbles remaining in a box. When Kramer drops by and eats one, Jerry yells at him until Kramer realizes he can make 9 equal rows with the remaining pebbles. After Kramer eats another, he finds he can make 10 equal rows with the remaining pebbles. Find the smallest number of pebbles that were in the box in the beginning.

Find the eighth term of the sequence $1440,$ $1716,$ $1848,\ldots,$ whose terms are formed by multiplying the corresponding terms of two arithmetic sequences.

In a triangle $ABC$, the angle bisector of $\widehat{ABC}$ meets $[AC]$ at $D$, and the angle bisector of $\widehat{BCA}$ meets $[AB]$ at $E$. Let $X$ be the intersection of the lines $BD$ and $CE$ where $|BX|=\sqrt 3|XD|$ ve $|XE|=(\sqrt 3 - 1)|XC|$. Find the angles of triangle $ABC$.

Let $n\ge 2$ be an integer. $a_1,a_2,\dotsc,a_n$ are arbitrarily chosen positive integers with $(a_1,a_2,\dotsc,a_n)=1$. Let $A=a_1+a_2+\dotsb+a_n$ and $(A,a_i)=d_i$. Let $(a_2,a_3,\dotsc,a_n)=D_1, (a_1,a_3,\dotsc,a_n)=D_2,\dotsc, (a_1,a_2,\dotsc,a_{n-1})=D_n$. Find the minimum of $\prod\limits_{i=1}^n\dfrac{A-a_i}{d_iD_i}$

Let $x_1,x_2,\ldots,x_n$ be positive real numbers such that \[ x_1+\frac{1}{x_2} = x_2+\frac{1}{x_3} = x_3+\frac{1}{x_4} = \dots = x_{n-1}+\frac{1}{x_n} = x_n+\frac{1}{x_1}. \] Prove that $x_1=x_2=x_3=\dots=x_n$.

Andy the Ant lives on a coordinate plane and is currently at $(-20, 20)$ facing east (that is, in the positive $x$-direction). Andy moves $1$ unit and then turns $90^{\circ}$ degrees left. From there, Andy moves $2$ units (north) and then turns $90^{\circ}$ degrees left. He then moves $3$ units (west) and again turns $90^{\circ}$ degrees left. Andy continues his progress, increasing his distance each time by $1$ unit and always turning left. What is the location of the point at which Andy makes the $2020$th left turn? $\textbf{(A)}\ (-1030, -994)\qquad\textbf{(B)}\ (-1030, -990)\qquad\textbf{(C)}\ (-1026, -994)\qquad\textbf{(D)}\ (-1026, -990)\qquad\textbf{(E)}\ (-1022, -994)$

Let the roots of \[x^{2022}-7x^{2021}+8x^2+4x+2\] be $r_1,r_2,\dots,r_{2022}$, the roots of \[x^{2022}-8x^{2021}+27x^2+9x+3\] be $s_1,s_2,\dots,s_{2022}$, and the roots of \[x^{2022}-9x^{2021}+64x^2+16x+4\] be $t_1,t_2,\dots,t_{2022}$. Compute the value of \[\sum_{1\le i,j\le2022}r_is_j+\sum_{1\le i,j\le2022}s_it_j+\sum_{1\le i,j\le2022}t_ir_j.\]

Tim is participating in the following three math contests. On each contest his score is the number of correct answers. $\bullet$ The Local Area Inspirational Math Exam consists of 15 problems. $\bullet$ The Further Away Regional Math League has 10 problems. $\bullet$ The Distance-Optimized Math Open has 50 problems. For every positive integer $n$, Tim knows the answer to the $n$th problems on each contest (which are pairwise distinct), if they exist; however, these answers have been randomly permuted so that he does not know which answer corresponds to which contest. Unaware of the shuffling, he competes with his modified answers. Compute the expected value of the sum of his scores on all three contests. [i]Proposed by Evan Chen[/i]

Given six consecutive positive integers, prove that there exists a prime such that one and only one of these six integers is divisible by this prime.

Find the limit, when $n$ tends to the infinity, of $$\frac{\sum_{k=0}^{n} {{2n} \choose {2k}} 3^k} {\sum_{k=0}^{n-1} {{2n} \choose {2k+1}} 3^k}$$

Quadrilateral $ABCD$ is a trapezoid, $AD = 15$, $AB = 50$, $BC = 20$, and the altitude is $12$. What is the area of the trapezoid? [asy] pair A,B,C,D; A=(3,20); B=(35,20); C=(47,0); D=(0,0); draw(A--B--C--D--cycle); dot((0,0)); dot((3,20)); dot((35,20)); dot((47,0)); label("A",A,N); label("B",B,N); label("C",C,S); label("D",D,S); draw((19,20)--(19,0)); dot((19,20)); dot((19,0)); draw((19,3)--(22,3)--(22,0)); label("12",(21,10),E); label("50",(19,22),N); label("15",(1,10),W); label("20",(41,12),E);[/asy] $ \textbf{(A)}600\qquad\textbf{(B)}650\qquad\textbf{(C)}700\qquad\textbf{(D)}750\qquad\textbf{(E)}800 $

Prove that if $n$ and $k$ are positive integers such that $1<k<n-1$,Then the binomial coefficient $\binom nk$ is divisible by at least two different primes.

The parallelogram $ABCD$ has $AB=a,AD=1,$ $\angle BAD=A$, and the triangle $ABD$ has all angles acute. Prove that circles radius $1$ and center $A,B,C,D$ cover the parallelogram if and only \[a\le\cos A+\sqrt3\sin A.\]

For every positive integer $x$, let $k(x)$ denote the number of composite numbers that do not exceed $x$. Find all positive integers $n$ for which $(k (n))! $ lcm $(1, 2,..., n)> (n - 1) !$ .

Find the natural number $A$ such that there are $A$ integer solutions to $x+y\geq A$ where $0\leq x \leq 6$ and $0\leq y \leq 7$. [i]Proposed by David Tang[/i]

(a) Let $\gcd(m, k) = 1$. Prove that there exist integers $a_1, a_2, . . . , a_m$ and $b_1, b_2, . . . , b_k$ such that each product $a_ib_j$ ($i = 1, 2, \cdots ,m; \ j = 1, 2, \cdots, k$) gives a different residue when divided by $mk.$ (b) Let $\gcd(m, k) > 1$. Prove that for any integers $a_1, a_2, . . . , a_m$ and $b_1, b_2, . . . , b_k$ there must be two products $a_ib_j$ and $a_sb_t$ ($(i, j) \neq (s, t)$) that give the same residue when divided by $mk.$ [i]Proposed by Hungary.[/i]