Suppose that $T\in \mathbb N$ is given. Find all functions $f:\mathbb Z \to \mathbb C$ such that, for all $m\in \mathbb Z$ we have $f(m+T)=f(m)$ and: $$\forall a,b,c \in \mathbb Z: f(a)\overline{f(a+b)f(a+c)}f(a+b+c)=1.$$Where $\overline{a}$ is the complex conjugate of $a$.

Two intelligent people playing a game on the $1403 \times 1403$ table with $1403^2$ cells. The first one in each turn chooses a cell that didn't select before and draws a vertical line segment from the top to the bottom of the cell. The second person in each turn chooses a cell that didn't select before and draws a horizontal line segment from the left to the right of the cell. After $1403^2$ steps the game will be over. The first person gets points equal to the longest verticals line segment and analogously the second person gets point equal to the longest horizonal line segment. At the end the person who gets the more point will win the game. What will be the result of the game?

Consider an acute scalene triangle $\triangle{ABC}$. The interior bisector of $A$ intersects $BC$ at $E$ and the minor arc of $\overarc {BC}$ in circumcircle of $\triangle{ABC}$ at $M$. Suppose that $D$ is a point on the minor arc of $\overarc {BC}$ such that $ED=EM$. $P$ is a point on the line segment of $AD$ such that $\angle ABP=\angle ACP \not= 0$. $O$ is the circumcenter of $\triangle{ABC}$. Prove that $OP \perp AM$.

For a given positive integer number $n$ find all subsets $\{r_0,r_1,\cdots,r_n\}\subset \mathbb{N}$ such that $$ n^n+n^{n-1}+\cdots+1 | n^{r_n}+\cdots+ n^{r_0}. $$ Proposed by Shayan Tayefeh

Let $ABCD$ be a parallelogram and let $AX$ and $AY$ be the altitudes from $A$ to $CB, CD$, respectively. A line $\ell \perp XY$ bisects $AX$ and meets $AB, BC$ at $K, L$. Similarly, a line $d \perp XY$ bisects $AY$ and meets $DA, DC$ at $P, Q$. Show that the circumcircles of $\triangle BKL$ and $\triangle DPQ$ are tangent to each other.

Sequence of positive integers $\{x_k\}_{k\geq 1}$ is given such that $x_1=1$ and for all $n\geq 1$ we have $$x_{n+1}^2+P(n)=x_n x_{n+2}$$where $P(x)$ is a polynomial with non-negative integer coefficients. Prove that $P(x)$ is the constant polynomial. Proposed by Navid Safaei

For positive real numbers $a,b,c,d$ such that $$ \dfrac{a^2}{b+c+d} + \dfrac{b^2}{a+c+d} + \dfrac{c^2}{a+b+d} = \dfrac{3d^2}{a+b+c} $$prove that $$ \dfrac{3}{a}+ \dfrac{3}{b} + \dfrac{3}{c}+ \dfrac{3}{d} \geq \dfrac{16}{a+b+2d} + \dfrac{16}{b+c+2d} + \dfrac{16}{a+c+2d}. $$ Proposed by Mojtaba Zare

A surjective function $g: \mathbb{C} \to \mathbb C$ is given. Find all functions $f: \mathbb{C} \to \mathbb C$ such that for all $x,y\in \mathbb C$ we have $$ |f(x)+g(y)| = | f(y) + g(x)|. $$ Proposed by Mojtaba Zare, Amirabbas Mohammadi

An integer number $n\geq 2$ and real numbers $x_1<x_2<\cdots < x_n$ are given. $f: \mathbb R \to \mathbb R$ is a function defined as $$ f(x) = \left | \dfrac{(x-x_2)(x-x_3)\cdots (x-x_n)}{(x_1-x_2)(x_1-x_3)\cdots (x_1-x_n)} \right | + \cdots + \left | \dfrac{(x-x_1)(x-x_2)\cdots (x-x_{n-1})}{(x_n-x_1)(x_n-x_2)\cdots (x_n-x_{n-1})} \right |. $$Prove that there exists $i\in \{1,2,\cdots,n-1\}$ such that for all $x\in (x_i,x_{i+1})$ one has $f(x)< \sqrt n$. Proposed by Navid Safaei

$n\geq 4$ is an integer number. For any permutation $x_1,x_2,\cdots,x_n$ of the numbers $1,2 \cdots,n$ we write the number $$ x_1+2x_2+\cdots+nx_n $$on the board. Compute the number of total distinct numbers written on the board.

Consider the main diagonal and the cells above it in an \( n \times n \) grid. These cells form what we call a tabular triangle of length \( n \). We want to place a real number in each cell of a tabular triangle of length \( n \) such that for each cell, the sum of the numbers in the cells in the same row and the same column (including itself) is zero. For example, the sum of the cells marked with a circle is zero. It is known that the number in the topmost and leftmost cell is $1.$ Find all possible ways to fill the remaining cells.

$m,n$ are given integer numbers such that $m+n$ is an odd number. Edges of a complete bipartie graph $K_{m,n}$ are labeled by ${-1,1}$ such that the sum of all labels is $0$. Prove that there exists a spanning tree such that the sum of the labels of its edges is equal to $0$.

Let $ABCD$ be a cyclic quadrilateral with circumcircle $\Gamma$. Let $M$ be the midpoint of the arc $ABC$. The circle with center $M$ and radius $MA$ meets $AD, AB$ at $X, Y$. The point $Z \in XY$ with $Z \neq Y$ satisfies $BY=BZ$. Show that $\angle BZD=\angle BCD$.

Let $M$ be the midpoint of the side $BC$ of the $\triangle ABC$. The perpendicular at $A$ to $AM$ meets $(ABC)$ at $K$. The altitudes $BE,CF$ of the triangle $ABC$ meet $AK$ at $P, Q$. Show that the radical axis of the circumcircles of the triangles $PKE, QKF$ is perpendicular to $BC$.

Let $ABC$ be a triangle with altitudes $AD, BE, CF$ and orthocenter $H$. The perpendicular bisector of $HD$ meets $EF$ at $P$ and $N$ is the center of the nine-point circle. Let $L$ be a point on the circumcircle of $ABC$ such that $\angle PLN=90^{\circ}$ and $A, L$ are in distinct sides of the line $PN$. Show that $ANDL$ is cyclic.

Given a sequence $x_1,x_2,x_3,\cdots$ of positive integers, Ali proceed the following algorythm: In the i-th step he markes all rational numbers in the interval $[0,1]$ which have denominator equal to $x_i$. Then he write down the number $a_i$ equal to the length of the smallest interval in $[0,1]$ which both two ends of that is a marked number. Find all sequences $x_1,x_2,x_3,\cdots$ with $x_5=5$ and such that for all $n\in \mathbb N$ we have $$ a_1+a_2+\cdots+a_n= 2-\dfrac{1}{x_n}. $$ Proposed by Mojtaba Zare

For all positive integers $n$ Prove that one can find pairwise coprime integers $a,b,c>n$ such that the set of prime divisors of the numbers $a+b+c$ and $ab+bc+ac$ coincides. Proposed by Mohsen Jamali and Hesam Rajabzadeh

The prime number $p$ and a positive integer $k$ are given. Assume that $P(x)\in \mathbb Z[X]$ is a polynomial with coefficients in the set $\{0,1,\cdots,p-1\}$ with least degree which satisfies the following property: There exists a permutaion of numbers $1,2,\cdots,p-1$ around a circle such that for any $k$ consecutive numbers $a_1,a_2,\cdots,a_k$ one has $$ p | P(a_1)+P(a_2)+\cdots+ P(a_k). $$Prove that $P(x)$ is of the form $ax^d+b$. Proposed by Yahya Motevassel