Let $x, y, z$ be nonzero real numbers such that $ x + y + z = 0$ and $$\frac{1}{x}+\frac{1}{y}+\frac{1}{z}= 1 -xyz + \frac{1}{xyz}.$$ Determine the value of the expression ' $$\frac{x}{(1-xy) (1-xz)}+\frac{y}{(1- yx) (1- yz)}+\frac{z}{(1- zx) (1-zy)}.$$

The numbers $1, 2, 3,\ldots , 64$ are placed on a chessboard, one number in each square. Consider all squares on the chessboard of size $2 \times 2.$ Prove that there are at least three such squares for which the sum of the $4$ numbers contained exceeds $100.$

Prove that every positive integer has a multiple whose decimal representation involves all ten digits.

On a Cartesian plane, $n$ parabolas are drawn, all of which are graphs of quadratic trinomials. No two of them are tangent. They divide the plane into many areas, one of which is above all the parabolas. Prove that the border of this area has no more than $2(n-1)$ corners (i.e. the intersections of a pair of parabolas).

From $1,2,\cdots,14$, take out three numbers $a_1<a_2<a_3$, satisfying that $a_2-a_1\geq3,a_3-a_2\geq3$. Then the number of different ways of taking out numbers is________.

Show that a sequence $(a_n)$ of $+1$ and $-1$ is periodic with period a power of $2$ if and only if $a_n=(-1)^{P(n)}$, where $P$ is an integer-valued polynomial with rational coefficients.

The center of circle $\omega_1$ of radius $6$ lies on circle $\omega_2$ of radius $6$. The circles intersect at points $K$ and $W$. Let point $U$ lie on the major arc $\overarc{KW}$ of $\omega_2$, and point $I$ be the center of the largest circle that can be inscribed in $\triangle KWU$. If $KI+WI=11$, find $KI\cdot WI$. [i]Proposed by Bradley Guo[/i]

Find all integers $n \ge 2$ for which $\sqrt[n]{3^n+ 4^n+5^n+8^n+10^n}$ is an integer.

A plane has a special point $O$ called the origin. Let $P$ be a set of 2021 points in the plane such that [list] [*] no three points in $P$ lie on a line and [*] no two points in $P$ lie on a line through the origin. [/list] A triangle with vertices in $P$ is [i]fat[/i] if $O$ is strictly inside the triangle. Find the maximum number of fat triangles.

Phillip is trying to make a two-dimensional donut, but in a fun way: He is trying to make a donut shaped in a way that the inner circle of the donut is inscribed inside a pentagon, and the outer circle of the donut circumscribes the same pentagon. This pentagon has a side length of $6$. The area of Phillip's donut is of the form $a \pi$. Find $a$. (Note that $\sin 54^o= \frac{\sqrt5+1}{4}$ )

Some lottery is played as follows. A lottery participant buys a card with $10$ numbered cells. He has the right to cross out any $4$ of these $10$ cells. Then a drawing occurs, during which some $7$ out of $10$ cells become winning. The player wins when all $4$ squares he crosses out are winning. The question arises, what is the smallest number of cards that can be used so that, if filled out correctly, at least one of these cards will win in any case? We do not suggest that you answer this question (we ourselves do not know the answer), although, of course, we will be very glad if you do and will evaluate this achievement accordingly. The task is; to indicate a certain number $n$ and a method of filling n cards that guarantees at least one win. The smaller $n$, the higher the rating of the work.

Let $ABC$ be an acute triangle with circumcircle $\Gamma$. Let $\ell$ be a tangent line to $\Gamma$, and let $\ell_a, \ell_b$ and $\ell_c$ be the lines obtained by reflecting $\ell$ in the lines $BC$, $CA$ and $AB$, respectively. Show that the circumcircle of the triangle determined by the lines $\ell_a, \ell_b$ and $\ell_c$ is tangent to the circle $\Gamma$. [i]Proposed by Japan[/i]

There are 5 coins placed flat on a table according to the figure. What is the order of the coins from top to bottom? [asy] size(100); defaultpen(linewidth(.8pt)+fontsize(8pt)); draw(arc((0,1), 1.2, 25, 214)); draw(arc((.951,.309), 1.2, 0, 360)); draw(arc((.588,-.809), 1.2, 132, 370)); draw(arc((-.588,-.809), 1.2, 75, 300)); draw(arc((-.951,.309), 1.2, 96, 228)); label("$A$",(0,1),NW); label("$B$",(-1.1,.309),NW); label("$C$",(.951,.309),E); label("$D$",(-.588,-.809),W); label("$E$",(.588,-.809),S);[/asy] $ \textbf{(A)}\ (C, A, E, D, B) \qquad \textbf{(B)}\ (C, A, D, E, B) \qquad \textbf{(C)}\ (C, D, E, A, B) \\ [1ex] \textbf{(D)}\ (C, E, A, D, B) \qquad \textbf{(E)}\ (C, E, D, A, B)$

Let $x, y, z$ be real numbers that are greater than or equal to $0$ and less than or equal to $\frac{1}{2}$ [list] [*] (a) Determine the minimum possible value of \[x+y+z-xy-yz-zx\] and determine all triples $(x,y,z)$ for which this minimum is obtained. [*] (b) Determine the maximum possible value of \[x+y+z-xy-yz-zx\] and determine all triples $(x,y,z)$ for which this maximum is obtained.[/list]

Suppose a $n\times n$ real matrix $A$ satisfies $\text{tr}(A)=2018$, $\text{rank}(A)=1$. Prove that $A^2=2018 A$.

We have 19 triminos (2 x 2 squares without one unit square) and infinite amount of 2 x 2 squares. Find the greatest odd number $n$ for which a square $n$ x $n$ can be covered with the given figures.

Find all nonnegative integers $(x,y,z,u)$ with satisfy the following equation: $2^x + 3^y + 5^z = 7^u.$

Let $M=\{0,1,2,\dots,2022\}$ and let $f:M\times M\to M$ such that for any $a,b\in M$, \[f(a,f(b,a))=b\] and $f(x,x)\neq x$ for each $x\in M$. How many possible functions $f$ are there $\pmod{1000}$?

Alice and Bob take turns alternatively on a $2020\times2020$ board with Alice starting the game. In every move each person colours a cell that have not been coloured yet and will be rewarded with as many points as the coloured cells in the same row and column. When the table is coloured completely, the points determine the winner. Who has the wining strategy and what is the maximum difference he/she can grantees? [i]Proposed by Seyed Reza Hosseini[/i]

Let $a,b$ be real numbers satisfying $a^{2} + b^{2} = 3ab = 75$ and $a>b$. Compute $a^{3}-b^{3}$.

For $a,b,c$ positive reals find the minimum value of \[ \frac{a^2+b^2}{c^2+ab}+\frac{b^2+c^2}{a^2+bc}+\frac{c^2+a^2}{b^2+ca}. \]

Let $n$ be a positive integer. Define a chameleon to be any sequence of $3n$ letters, with exactly $n$ occurrences of each of the letters $a, b,$ and $c$. Define a swap to be the transposition of two adjacent letters in a chameleon. Prove that for any chameleon $X$ , there exists a chameleon $Y$ such that $X$ cannot be changed to $Y$ using fewer than $3n^2/2$ swaps.

A clockmaker wants to design a clock such that the area swept by each hand (second, minute, and hour) in one minute is the same (all hands move continuously). What is the length of the hour hand divided by the length of the second hand?

The sides and diagonals of a regular $n$-gon $R$ are colored in $k$ colors so that: (i) For each color $a$ and any two vertices $A$,$B$ of $R$ , the segment $AB$ is of color $a$ or there is a vertex $C$ such that $AC$ and $BC$ are of color $a$. (ii) The sides of any triangle with vertices at vertices of $R$ are colored in at most two colors. Prove that $k\leq 2$.

The edges of a graph with $2n$ vertices ($n \ge 4$) are colored in blue and red such that there is no blue triangle and there is no red complete subgraph with $n$ vertices. Find the least possible number of blue edges.