Given that $2x + 7y = 3$, find $2^{6x + 21y - 4}$. [i]Proposed by Deyuan Li[/i]

Determine all $f:\mathbb{Z}^+ \rightarrow \mathbb{Z}^+$ such that $f(m)\geq m$ and $f(m+n) \mid f(m)+f(n)$ for all $m,n\in \mathbb{Z}^+$

Find the smallest positive integer $n$ or show no such $n$ exists, with the following property: there are infinitely many distinct $n$-tuples of positive rational numbers $(a_1, a_2, \ldots, a_n)$ such that both $$a_1+a_2+\dots +a_n \quad \text{and} \quad \frac{1}{a_1} + \frac{1}{a_2} + \dots + \frac{1}{a_n}$$ are integers.

Let $ABCDEF$ be a convex hexagon such that $AB=BC,CD=DE, EF=FA.$ Prove that $\frac{BC}{BE}+\frac{DE}{DA}+\frac{FA}{FC}\ge\frac{3}{2}$ and find when equality holds.

Let us assume that the series of holomorphic functions $ \sum_{k=1}^{\infty}f_k(z)$ is absolutely convergent for all $ z \in \mathbb{C}$. Let $ H \subseteq \mathbb{C}$ be the set of those points where the above sum funcion is not regular. Prove that $ H$ is nowhere dense but not necessarily countable. [i]L. Kerchy[/i]

A rock travelled through an n x n board, stepping at each turn to the cell neighbouring the previous one by a side, so that each cell was visited once. Bob has put the integer numbers from 1 to n^2 into the cells, corresponding to the order in which the rook has passed them. Let M be the greatest difference of the numbers in neighbouring by side cells. What is the minimal possible value of M?

A large rectangle is tiled by some $1\times1$ tiles. In the center there is a small rectangle tiled by some white tiles. The small rectangle is surrounded by a red border which is five tiles wide. That red border is surrounded by a white border which is five tiles wide. Finally, the white border is surrounded by a red border which is five tiles wide. The resulting pattern is pictured below. In all, $2900$ red tiles are used to tile the large rectangle. Find the perimeter of the large rectangle. [asy] import graph; size(5cm); fill((-5,-5)--(0,-5)--(0,35)--(-5,35)--cycle^^(50,-5)--(55,-5)--(55,35)--(50,35)--cycle,red); fill((0,30)--(0,35)--(50,35)--(50,30)--cycle^^(0,-5)--(0,0)--(50,0)--(50,-5)--cycle,red); fill((-15,-15)--(-10,-15)--(-10,45)--(-15,45)--cycle^^(60,-15)--(65,-15)--(65,45)--(60,45)--cycle,red); fill((-10,40)--(-10,45)--(60,45)--(60,40)--cycle^^(-10,-15)--(-10,-10)--(60,-10)--(60,-15)--cycle,red); fill((-10,-10)--(-5,-10)--(-5,40)--(-10,40)--cycle^^(55,-10)--(60,-10)--(60,40)--(55,40)--cycle,white); fill((-5,35)--(-5,40)--(55,40)--(55,35)--cycle^^(-5,-10)--(-5,-5)--(55,-5)--(55,-10)--cycle,white); for(int i=0;i<16;++i){ draw((-i,-i)--(50+i,-i)--(50+i,30+i)--(-i,30+i)--cycle,linewidth(.5)); } [/asy]

Find all pair of integer numbers $(n,k)$ such that $n$ is not negative and $k$ is greater than $1$, and satisfying that the number: \[ A=17^{2006n}+4.17^{2n}+7.19^{5n} \] can be represented as the product of $k$ consecutive positive integers.

Let $P(x) = x^3 - 2x + 1$ and let $Q(x) = x^3 - 4x^2 + 4x - 1$. Show that if $P(r) = 0$ then $Q(r^2) = 0$.

Given a positive integer $ n$, find the number of $ n$-digit natural numbers consisting of digits 1, 2, 3 in which any two adjacent digits are either distinct or both equal to 3.

Prove that if $ \cos \pi x =\frac{1}{3} $ then $ x $ is an irrational number.

The sequence of positive integers $a_1, a_2, \ldots, a_{2025}$ is defined as follows: $a_1=2^{2024}+1$ and $a_{n+1}$ is the greatest prime factor of $a_n^2-1$ for $1 \leq n \leq 2024$. Find the value of $a_{2024}+a_{2025}$.

if $x,y,z>0$ are postive real numbers such that $x^{2}+y^{2}+z^{2}=x^{2}y^{2}+y^{2}z^{2}+z^{2}x^{2}$ prove that \[((x-y)(y-z)(z-x))^{2}\leq 2((x^{2}-y^{2})^{2}+(y^{2}-z^{2})^{2}+(z^{2}-x^{2})^{2})\]

a) Prove that for $x,y \ge 1$, holds $$x+y - \frac{1}{x}- \frac{1}{y} \ge 2\sqrt{xy} -\frac{2}{\sqrt{xy}}$$ b) Prove that for $a,b,c,d \ge 1$ with $abcd=16$ , holds $$a+b+c+d-\frac{1}{a}-\frac{1}{b}-\frac{1}{c}-\frac{1}{d}\ge 6$$

Let $ a,b,c,d$ be real numbers, such that $ a^2\le 1, a^2 \plus{} b^2\le 5, a^2 \plus{} b^2 \plus{} c^2\le 14, a^2 \plus{} b^2 \plus{} c^2 \plus{} d^2\le 30$. Prove that $ a \plus{} b \plus{} c \plus{} d\le 10$.

The numbers from $1$ to $10$ were divided into two groups so that the product of the numbers in the first group is completely divisible by the product of the numbers in the second. Which the smallest value can be for the quotient of the first product money for the second?

represent a way to calculate $\sum_{k=0}^{\infty}\frac{(-1)^k}{(2k+1)^3}=1-\frac{1}{3^3}+\frac{1}{5^3}-\frac{1}{7^3}+...$.

Prove that if $a,b,c>0$ and $a+b+c=1,$ then $$\frac{bc+a+1}{a^2+1}+\frac{ca+b+1}{b^2+1}+\frac{ab+c+1}{c^2+1}\leq \frac{39}{10}$$

Let $f:A^3\to A$ where $A$ is a nonempty set and $f$ satisfies: (a) for all $x,y\in A$, $f(x,y,y)=x=f(y,y,x)$ and (b) for all $x_1,x_2,x_3,y_1,y_2,y_3,z_1,z_2,z_3\in A$, $$f(f(x_1,x_2,x_3),f(y_1,y_2,y_3),f(z_1,z_2,z_3))=f(f(x_1,y_1,z_1),f(x_2,y_2,z_2),f(x_3,y_3,z_3)).$$ Prove that for an arbitrary fixed $a\in A$, the operation $x+y=f(x,a,y)$ is an Abelian group addition.

Let $\gamma$ be the circumscribed circle about a right-angled triangle $ABC$ with right angle $C$. Let $\delta$ be the circle tangent to the sides $AC$ and $BC$ and tangent to the circle $\gamma$ internally. (a) Find the radius $i$ of $\delta$ in terms of $a$ when $AC$ and $BC$ both have length $a$. (b) Show that the radius $i$ is twice the radius of the inscribed circle of $ABC$.

For a positive integer $k$, let us denote by $u(k)$ the greatest odd divisor of $k$. Prove that, for each $n \in N$, $\frac{1}{2^n} \sum_{k = 1}^{2^n} \frac{u(k)}{k}> \frac{2}{3}$.

Prime $p=n^2 +1$ is given. Find the sets of solutions to the below equation: \[x^2 - (n^2 +1)y^2 = n^2.\] (25 points)

Given several points, not all lying on one straight line. Some number is assigned to every point. It is known, that if a straight line contains two or more points, than the sum of the assigned to those points equals zero. Prove that all the numbers equal to zero.

Let $n,k$ be integers such that $n\geq k\geq3$. Consider $n+1$ points in a plane (there is no three collinear points) and $k$ different colors, then, we color all the segments that connect every two points. We say that an angle is good if its vertex is one of the initial set, and its two sides aren't the same color. Show that there exist a coloration such that the \\ total number of good angles is greater than $n \binom{k}{2} \lfloor(\frac{n}{k})\rfloor^2$

How many ways are there to paint an $m \times n$ board, so that each square is painted blue, white, brown or gold, and in each $2 \times 2$ square there is one square of each color?