Show that for each prime $p \geq 7$, there exist a positive integer $n$ and integers $x_{i}$, $y_{i}$ $(i = 1, . . . , n)$, not divisible by $p$, such that $x_{i}^{2}+ y_{i}^{2}\equiv x_{i+1}^{2}\pmod{p}$ where $x_{n+1} = x_{1}$

On all three sides of a right triangle $ABC$ external squares are constructed; their centers denoted by $D$, $E$, $F$. Show that the ratio of the area of triangle $DEF$ to the area of triangle $ABC$ is: a) [i](2 points)[/i] greater than $1$; b) [i](2 points)[/i] at least $2$.

Prove that if $\frac{AC}{BC}=\frac{AB + BC}{AC}$ in a triangle $ABC$ , then $\angle B = 2 \angle A$ .

Let $p > 2$ be a prime number. $\mathbb{F}_p[x]$ is defined as the set of polynomials in $x$ with coefficients in $\mathbb{F}_p$ (the integers modulo $p$ with usual addition and subtraction), so that two polynomials are equal if and only if the coefficients of $x^k$ are equal in $\mathbb{F}_p$ for each nonnegative integer $k$. For example, $(x+2)(2x+3) = 2x^2 + 2x + 1$ in $\mathbb{F}_5[x]$ because the corresponding coefficients are equal modulo 5. Let $f, g \in \mathbb{F}_p[x]$. The pair $(f, g)$ is called [i]compositional[/i] if \[f(g(x)) \equiv x^{p^2} - x\] in $\mathbb{F}_p[x]$. Find, with proof, the number of compositional pairs.

Let $n \geq 2$ be a natural number, and let $\left( a_{1};\;a_{2};\;...;\;a_{n}\right)$ be a permutation of $\left(1;\;2;\;...;\;n\right)$. For any integer $k$ with $1 \leq k \leq n$, we place $a_k$ raisins on the position $k$ of the real number axis. [The real number axis is the $x$-axis of a Cartesian coordinate system.] Now, we place three children A, B, C on the positions $x_A$, $x_B$, $x_C$, each of the numbers $x_A$, $x_B$, $x_C$ being an element of $\left\{1;\;2;\;...;\;n\right\}$. [It is not forbidden to place different children on the same place!] For any $k$, the $a_k$ raisins placed on the position $k$ are equally handed out to those children whose positions are next to $k$. [So, if there is only one child lying next to $k$, then he gets the raisin. If there are two children lying next to $k$ (either both on the same position or symmetric with respect to $k$), then each of them gets one half of the raisin. Etc..] After all raisins are distributed, a child is unhappy if he could have received more raisins than he actually has received if he had moved to another place (while the other children would rest on their places). For which $n$ does there exist a configuration $\left( a_{1};\;a_{2};\;...;\;a_{n}\right)$ and numbers $x_A$, $x_B$, $x_C$, such that all three children are happy?

Find all value of parameter $a$ such that equations $x^2-ax+1=0$ and $x^2-x+a=0$ have at least one same solution. For this value $a$ find same solution of this equations(real or imaginary).

What is the maximum possible value of $5-|6x-80|$ over all integers $x$? $\textbf{(A) }{-}1\qquad\textbf{(B) }0\qquad\textbf{(C) }1\qquad\textbf{(D) }3\qquad\textbf{(E) }5$

Let $ABC$ be an acute-angled triangle. $M ,N$ are any two points on the sides $AB , AC$ respectively. The circles with the diameters $BN$ and $CM$ intersect at points $P$ and $Q$. Show that the points $P, Q$ and the orthocenter of the triangle $ABC$ lie on a straight line.

Let $D, E, F$, be the touchpoints of the incircle in triangle $ABC$ with sides $BC, CA, AB$, respectively, . Also, let $AD$ and $EF$ intersect at $P$. Prove that $$\frac{AP}{AD} \ge 1 - \frac{BC}{AB + CA}$$.

Do there exist non-zero reals $a$, $b$, $c$ such that, for any $n>3$, there exists a polynomial $P_{n}(x) = x^{n}+\dots+a x^{2}+bx+c$, which has exactly $n$ (not necessary distinct) integral roots? [i]N. Agakhanov, I. Bogdanov[/i]

$k_1, k_2, k_3$ are three circles. $k_2$ and $k_3$ touch externally at $P$, $k_3$ and $k_1$ touch externally at $Q$, and $k_1$ and $k_2$ touch externally at $R$. The line $PQ$ meets $k_1$ again at $S$, the line $PR$ meets $k_1$ again at $T$. The line $RS$ meets $k_2$ again at $U$, and the line $QT$ meets $k_3$ again at $V$. Show that $P, U, V$ are collinear.

Prove that in acute-angled traingle ABC if $r$ is inradius and $R$ is radius of circumcircle then: \[a^2+b^2+c^2\geq 4(R+r)^2\]

Find all positive integers $n$ such that $A=2^{n+2}(2^n-1)-8\cdot 3^n +1$ is a perfect square.

Two persons, A and B, set up an incantation contest in which they spell incantations (i.e. a finite sequence of letters) alternately. They must obey the following rules: i) Any incantation can appear no more than once; ii) Except for the first incantation, any incantation must be obtained by permuting the letters of the last one before it, or deleting one letter from the last incantation before it; iii)The first person who cannot spell an incantation loses the contest. Answer the following questions: a) If A says '$STAGEPREIMO$' first, then who will win? b) Let $M$ be the set of all possible incantations whose lengths (i.e. the numbers of letters in them) are $2009$ and containing only four letters $A,B,C,D$, each of them appearing at least once. Find the first incantation (arranged in dictionary order) in $M$ such that A has a winning strategy by starting with it.

Prove that if positive reals $x,y$ satisfy $x+y= 3$, $x,y \ge 1$ then $$9(x- 1)(y- 1) + (y^2 + y+ 1)(x + 1) + (x^2-x+ 1)(y- 1) \ge 9$$

In a five term arithmetic sequence, the first term is $2020$ and the last term is $4040.$ Find the second term of the sequence. [i]Proposed by Ada Tsui[/i]

Let $a$ and $b$ be two circles, intersecting in two distinct points $Y$ and $Z$. A circle $k$ touches the circles $a$ and $b$ externally in the points $A$ and $B$. Show that the angular bisectors of the angles $\angle ZAY$ and $\angle YBZ$ intersect on the line $YZ$.

a)Prove that any matrix $A\in \mathcal{M}_4(\mathbb{C})$ can be written as a sum of four matrices $B_1,B_2,B_3,B_4\in \mathcal{M}_4(\mathbb{C})$ with the rank equal to $1$. b)$I_4$ can't be written as a sum of less than four matrices with the rank equal to $1$. [i]Manuela Prajea & Ion Savu[/i]

For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$ [i]Proposed by Shahjalal Shohag, Bangladesh[/i]

Consider the sequences $(a_n), (b_n)$ defined by \[a_1=3, \quad b_1=100 , \quad a_{n+1}=3^{a_n} , \quad b_{n+1}=100^{b_n} \] Find the smallest integer $m$ for which $b_m > a_{100}.$

For every positive integer $k>1$ prove that there exist a real number $x$ so that for every positive integer $n<1398$: $$\left\{x^n\right\}<\left\{x^{n-1}\right\} \Longleftrightarrow k\mid n.$$ [i]Proposed by Mohammad Amin Sharifi[/i]

Factor $(b - c)^3 + (c - a)^3 + (a - b)^3$.

Let $E, F$ be two distinct points inside a parallelogram $ABCD$ . Determine the maximum possible number of triangles having the same area with three vertices from points $A, B, C, D, E, F$.

Let $ABCD$ be a cyclic quadrilateral whose side $AB$ is at the same time the diameter of the circle. The lines $AC$ and $BD$ intersect at point $E$ and the extensions of lines $AD$ and $BC$ intersect at point $F$. Segment $EF$ intersects the circle at $G$ and the extension of segment $EF$ intersects $AB$ at $H$. Show that if $G$ is the midpoint of $FH$, then $E$ is the midpoint of $GH$.

Find all functions $f: \mathbb{R} \to \mathbb{R}$ such that $f(x+y) = \max(f(x),y) + \min(f(y),x)$. [i]George Xing.[/i]