Start with a six-digit whole number $X$, and for a new whole number $Y$, by moving the first three digits of $X$ after the last three digits. (For example, if $X = \textbf{154},377$, then $Y = 377,\textbf{154}$.) Show that, when divided by $27$, both $X$ and $Y$ give the same remainder.

A teacher creates a fraction using numbers from $1$ to $12$ (including $12$). He writes some of the numbers on the numerator, and writes $\times$ (multiplication) between each number. Then he writes the rest of the numbers in the denominator and also writes $\times$ between each number. There is at least one number both in numerator and denominator. The teacher ensures that the fraction is equal to the smallest possible integer possible. What is this positive integer, which is also the value of the fraction?

Let $ k>1$ be an integer. Prove that there exists infinitely many natural numbers such as $ n$ such that: \[ n|1^n\plus{}2^n\plus{}\dots\plus{}k^n\]

Let $ N$ be the greatest integer multiple of $ 36$ all of whose digits are even and no two of whose digits are the same. Find the remainder when $ N$ is divided by $ 1000$.

Let $f(m,1)=f(1,n)=1$ for $m\geq 1, n\geq 1$ and let $f(m,n)=f(m-1, n)+ f(m, n-1) +f(m-1 ,n-1)$ for $m>1$ and $n>1$. Also let $$ S(n)= \sum_{a+b=n} f(a,b) \,\,\;\; a\geq 1 \,\, \text{and} \,\; b\geq 1.$$ Prove that $$S(n+2) =S(n) +2S(n+1) \,\, \; \text{for} \, \, n \geq 2.$$

Let $P(X)$ be a nonconstant polynomial with real coefficients such that for every rational number $q{}$ the equation $P(X)=q$ has no irrational solutions. Show that $P(X)$ is a first degree polynomial.

Let $A$ be a non-empty set of integers with the following property: For each $a \in A$, there exist not necessarily distinct integers $b,c \in A$ so that $a=b+c$. (a) Proof that there are examples of sets $A$ fulfilling above property that do not contain $0$ as element. (b) Proof that there exist $a_1,\ldots,a_r \in A$ with $r \ge 1$ and $a_1+\cdots+a_r=0$. (c) Proof that there exist pairwise distinct $a_1,\ldots,a_r$ with $r \ge 1$ and $a_1+\cdots+a_r=0$.

There are six lines in the plane. No two of them are parallel and no point lies on more than three lines. What is the minimum possible number of points that lie on at least two lines?

Let $P(x) = x^{2022} + x^{1011} + 1$. Which of the following polynomials divides $P(x)$? $\textbf{(A)}~x^2 - x + 1\qquad\textbf{(B)}~x^2 + x + 1\qquad\textbf{(C)}~x^4 + 1\qquad\textbf{(D)}~x^6 - x^3 + 1\qquad\textbf{(E)}~x^6 + x^3 + 1$

Let the intersection of the diagonals $AC$ and $BD$ of the convex quadrilateral $ABCD$ be point $E$. Let $M$ be the midpoint of $AE$ and $N$ be the midpoint of $CD$. It's known that $BD$ bisects $\angle ABC$. Prove that $ABCD$ is cyclic if and only if $MBCN$ is cyclic.

The Duke of Squares left to his three sons a square estate, $100\times 100$ square miles, made up of ten thousand $1\times 1$ square mile square plots. The whole estate was divided among his sons as follows. Each son was assigned a point inside the estate. A $1\times 1$ square plot was bequeathed to the son whose assigned point was closest to the center of this square plot. Is it true that, irrespective of the choice of assigned points, each of the regions bequeathed to the sons is connected (that is, there is a path between every two of its points, never leaving the region)?

The distance between Maykop and Belorechensk is $24$ km. Two of three friends need to reach Belorechensk from Maykop and another friend wants to reach Maykop from Belorechensk. They have only one bike, which is initially in Maykop. Each guy may go on foot (with velocity at most $6$ kmph) or on a bike (with velocity at most $18$ kmph). It is forbidden to leave a bike on a road. Prove that all of them may achieve their goals after $2$ hours $40$ minutes. (Only one guy may seat on the bike simultaneously). [i]Folclore[/i]

Solve in the positive real numbers the following system. $$ \left\{\begin{matrix} x^y=2^3\\y^z=3^4\\z^x=2^4 \end{matrix}\right. $$ [i]Aurel Ene[/i]

Let $A=(\alpha_{ij})$ be a $m\,x\,n$ matric and $B=(\beta_{kl})$ be a $n\,x\, m$ matric with $m>n$ . Prove that $D(A\cdot B)=0$.

Let $A_1A_2 . . . A_{12}$ be a regular dodecagon. Equilateral triangles $\vartriangle A_1A_2B_1$, $\vartriangle A_2A_3B_2$, $. . . $, and $\vartriangle A_{12}A_1B_{12}$ are drawn such that points $B_1$, $B_2$,$ . . . $, and B_{12} lie outside dodecagon $A_1A_2 . . . A_{12}$. Then, equilateral triangles $\vartriangle A_1A_2C_1$, $\vartriangle A_2A_3C_2$, $. . .$ , and $\vartriangle A_{12}A_1C_{12}$ are drawn such that points $C_1$, $C_2$, $. . .$ , and $C_{12}$ lie inside dodecagon $A_1A_2 . . . A_{12}$. Compute the ratio of the area of dodecagon $B_1B_2 . . . B_{12}$ to the area of dodecagon $C_1C_2 . . . C_{12}$.

On an infinite grid, a square with four vertices lie at $(m, n)$, $(m-1, n)$, $(m,n-1)$, $(m-1, n-1)$ is denoted as cell $(m,n)$ $(m, n \in Z)$. Some marbles are dropped on some cell. Each cell may have more than one marble or have no marble at all. Consider a "move" can be conducted in one of two following ways: i) Remove one marble from cell $(m,n)$ (if there is marble at that cell), then add one marble to each of cell $(m - 1, n- 2)$ and cell $(m -2, n - 1)$. ii) Remove two marbles from cell $(m,n)$ (if there is marble at that cell), then add one marble to each of cell $(m +1, n - 2)$ and cell $(m - 2, n +1)$. Assume that initially, there are $n$ marbles at the cell $(1,n), (2,n - 1),..., (n, 1)$ (each cell contains one marble). Can we conduct an finite amount of moves such that both cells $(n + 1, n)$ and $(n, n + 1)$ have marbles?

For real numbers $x,y, \in [1,2]$, prove the inequality $3(x + y)\ge 2xy + 4$

Are the following statements true? a) if the four vertices of a rectangle lie on the four sides of a rhombus, then the sides of the rectangle are parallel to the diagonals of the rhombus; b) if the four vertices of a square lie on the four sides of a rhombus that is not a square, then the sides of the square are parallel to the diagonals of the rhombus.

Let be three positive real numbers $ a,b,c. $ Show that the function $ f:\mathbb{R}\longrightarrow\mathbb{R} , $ $$ f(x)=\frac{a^x}{b^x+c^x} +\frac{b^x}{a^x+c^x} +\frac{c^x}{a^x+b^x} , $$ is nondecresing on the interval $ \left[ 0,\infty \right) $ and nonincreasing on the interval $ \left( -\infty ,0 \right] . $

Consider all right triangles with integer side lengths that form an arithmetic sequence. Compute the $2014$th smallest perimeter of all such right triangles.

Let $ ABC$ be an acute triangle, $ AD,BE,CZ$ its altitudes and $ H$ its orthocenter. Let $ AI,A \Theta$ be the internal and external bisectors of angle $ A$. Let $ M,N$ be the midpoints of $ BC,AH$, respectively. Prove that: (a) $MN$ is perpendicular to $EZ$ (b) if $ MN$ cuts the segments $ AI,A \Theta$ at the points $ K,L$, then $ KL\equal{}AH$

Let $ a,b,c$ be non-zero real numbers satisfying \[ \dfrac{1}{a}\plus{}\dfrac{1}{b}\plus{}\dfrac{1}{c}\equal{}\dfrac{1}{a\plus{}b\plus{}c}.\] Find all integers $ n$ such that \[ \dfrac{1}{a^n}\plus{}\dfrac{1}{b^n}\plus{}\dfrac{1}{c^n}\equal{}\dfrac{1}{a^n\plus{}b^n\plus{}c^n}.\]

[b]p1.[/b] Suppose that $20\%$ of a number is $17$. Find $20\%$ of $17\%$ of the number. [b]p2.[/b] Let $A, B, C, D$ represent the numbers $1$ through $4$ in some order, with $A \ne 1$. Find the maximum possible value of $\frac{\log_A B}{C +D}$. Here, $\log_A B$ is the unique real number $X$ such that $A^X = B$. [b]p3. [/b]There are six points in a plane, no four of which are collinear. A line is formed connecting every pair of points. Find the smallest possible number of distinct lines formed. [b]p4.[/b] Let $a,b,c$ be real numbers which satisfy $$\frac{2017}{a}= a(b +c), \frac{2017}{b}= b(a +c), \frac{2017}{c}= c(a +b).$$ Find the sum of all possible values of $abc$. [b]p5.[/b] Let $a$ and $b$ be complex numbers such that $ab + a +b = (a +b +1)(a +b +3)$. Find all possible values of $\frac{a+1}{b+1}$. [b]p6.[/b] Let $\vartriangle ABC$ be a triangle. Let $X,Y,Z$ be points on lines $BC$, $CA$, and $AB$, respectively, such that $X$ lies on segment $BC$, $B$ lies on segment $AY$ , and $C$ lies on segment $AZ$. Suppose that the circumcircle of $\vartriangle XYZ$ is tangent to lines $AB$, $BC$, and $CA$ with center $I_A$. If $AB = 20$ and $I_AC = AC = 17$ then compute the length of segment $BC$. [b]p7. [/b]An ant makes $4034$ moves on a coordinate plane, beginning at the point $(0, 0)$ and ending at $(2017, 2017)$. Each move consists of moving one unit in a direction parallel to one of the axes. Suppose that the ant stays within the region $|x - y| \le 2$. Let N be the number of paths the ant can take. Find the remainder when $N$ is divided by $1000$. [b]p8.[/b] A $10$ digit positive integer $\overline{a_9a_8a_7...a_1a_0}$ with $a_9$ nonzero is called [i]deceptive [/i] if there exist distinct indices $i > j$ such that $\overline{a_i a_j} = 37$. Find the number of deceptive positive integers. [b]p9.[/b] A circle passing through the points $(2, 0)$ and $(1, 7)$ is tangent to the $y$-axis at $(0, r )$. Find all possible values of $ r$. [b]p10.[/b] An ellipse with major and minor axes $20$ and $17$, respectively, is inscribed in a square whose diagonals coincide with the axes of the ellipse. Find the area of the square. PS. You had better use hide for answers.

Inscribe an equilateral triangle of minimum side in a given acute-angled triangle $ABC$ (one vertex on each side).

Let $p_{1}$, $p_{2}$, ..., $p_{k}$ be different prime numbers. Determine the number of positive integers of the form $p_{1}^{\alpha_{1}}p_{2}^{\alpha_{2}}...p_{k}^{\alpha_{k}}$, $\alpha_{i}$ $\in$ $\mathbb{N}$ for which $\alpha_{1} \alpha_{2}...\alpha_{k}=p_{1}p_{2}...p_{k}$.