Function $F(x)=|\cos^2x+2\sin x\cos x-\sin^2x+Ax+B|$, where $A,B$ are two real numbers, $x\in[0,\frac{3}{2}\pi]$. $M$ is the maximun value of $F(x)$. Find the minumum value of $M$.

Denote the set of all positive integers by $\mathbb{N}$, and the set of all ordered positive integers by $\mathbb{N}^2$. For all non-negative integers $k$, define [i]good functions of order k[/i] recursively for all non-negative integers $k$, among all functions from $\mathbb{N}^2$ to $\mathbb{N}$ as follows: (i) The functions $f(a,b)=a$ and $f(a,b)=b$ are both good functions of order $0$. (ii) If $f(a,b)$ and $g(a,b)$ are good functions of orders $p$ and $q$, respectively, then $\gcd(f(a,b),g(a,b))$ is a good function of order $p+q$, while $f(a,b)g(a,b)$ is a good function of order $p+q+1$. Prove that, if $f(a,b)$ is a good function of order $k\leq \binom{n}{3}$ for some positive integer $n\geq 3$, then there exist a positive integer $t\leq \binom{n}{2}$ and $t$ pairs of non-negative integers $(x_1,y_1),\ldots,(x_n,y_n)$ such that $$f(a,b)=\gcd(a^{x_1}b^{y_1},\ldots,a^{x_t}b^{y_t})$$ holds for all positive integers $a$ and $b$. [i]Proposed by usjl[/i]

The hypotenuse $AB$ of a right-angled triangle $ABC$ touches the corresponding excircle $\omega$ at point $T$. Point $S$ is symmetrical $T$ relative to the bisector of angle $C$, $CH$ is the height of the triangle. Prove that the circumcircle of triangle $CSH$ touches the circle $\omega$.

Let $ f: Z \to Z$ be such that $ f(1) \equal{} 1, f(2) \equal{} 20, f(\minus{}4) \equal{} \minus{}4$ and $ f(x\plus{}y) \equal{} f(x) \plus{}f(y)\plus{}axy(x\plus{}y)\plus{}bxy\plus{}c(x\plus{}y)\plus{}4 \forall x,y \in Z$, where $ a,b,c$ are constants. (a) Find a formula for $ f(x)$, where $ x$ is any integer. (b) If $ f(x) \geq mx^2\plus{}(5m\plus{}1)x\plus{}4m$ for all non-negative integers $ x$, find the greatest possible value of $ m$.

Square $ABCD$ has side length $4$. Points $E$ and $F$ are the midpoints of sides $AB$ and $CD$, respectively. Eight $1$ by $2$ rectangles are placed inside the square so that no two of the eight rectangles overlap (see diagram). If the arrangement of eight rectangles is chosen randomly, then there are relatively prime positive integers $m$ and $n$ so that $\tfrac{m}{n}$ is the probability that none of the rectangles crosses the line segment $EF$ (as in the arrangement on the right). Find $m + n$. [asy] size(200); defaultpen(linewidth(0.8)+fontsize(10pt)); real r = 7; path square=origin--(4,0)--(4,4)--(0,4)--cycle; draw(square^^shift((r,0))*square,linewidth(1)); draw((1,4)--(1,0)^^(3,4)--(3,0)^^(0,2)--(1,2)^^(1,3)--(3,3)^^(1,1)--(3,1)^^(2,3)--(2,1)^^(3,2)--(4,2)); draw(shift((r,0))*((2,4)--(2,0)^^(0,2)--(4,2)^^(0,1)--(4,1)^^(0,3)--(2,3)^^(3,4)--(3,2))); label("A",(4,4),NE); label("A",(4+r,4),NE); label("B",(0,4),NW); label("B",(r,4),NW); label("C",(0,0),SW); label("C",(r,0),SW); label("D",(4,0),SE); label("D",(4+r,0),SE); label("E",(2,4),N); label("E",(2+r,4),N); label("F",(2,0),S); label("F",(2+r,0),S); [/asy]

Let $n$ be a positive integer having at least two different prime factors. Show that there exists a permutation $a_1, a_2, \dots , a_n$ of the integers $1, 2, \dots , n$ such that \[\sum_{k=1}^{n} k \cdot \cos \frac{2 \pi a_k}{n}=0.\]

In a planar coordinate system we got four pieces on positions with coordinates. You can make a move according to the following rule: You can move a piece to a new position if there is one of the other pieces in the middle of the old and new position. Initially the four pieces have positions $ \{(0,0),(0,1),(1,0),(1,1)\}$. Given a finite number of moves can you yield the configuration $ \{(0,0), (1,1), (3,0), (2, \minus{} 1)\}$ ?

Let $ABCD$ be a cyclic quadrilateral inscribed in circle $O$, where $AC\perp BD$. $M,N$ are the midpoint of arc $ADC,ABC$. $DO$ and $AN$ intersect each other at $G$, the line passes through $G$ and parellel to $NC$ intersect $CD$ at $K$. Prove that $AK\perp BM$.

Suppose $ABC$ is a triangle with $M$ the midpoint of $BC$. Suppose that $AM$ intersects the incircle at $K,L$. We draw parallel line from $K$ and $L$ to $BC$ and name their second intersection point with incircle $X$ and $Y$. Suppose that $AX$ and $AY$ intersect $BC$ at $P$ and $Q$. Prove that $BP=CQ$.

Estimate the value of $e^f$ , where $f = e^e$ .

Prove that any positive integer can be represented as a sum of Fibonacci numbers, no two of which are consecutive.

Find all possible values of integer $n > 3$ such that there is a convex $n$-gon in which, each diagonal is the perpendicular bisector of at least one other diagonal. Proposed by Mahdi Etesamifard

Let $ABC$ be a triangle with $m(\widehat{ABC}) = 90^{\circ}$. The circle with diameter $AB$ intersects the side $[AC]$ at $D$. The tangent to the circle at $D$ meets $BC$ at $E$. If $|EC| =2$, then what is $|AC|^2 - |AE|^2$ ? $\textbf{(A)}\ 18 \qquad\textbf{(B)}\ 16 \qquad\textbf{(C)}\ 12 \qquad\textbf{(E)}\ 10 \qquad\textbf{(E)}\ \text{None}$

The circle is inscribed in a triangle, inscribed in a semicircle. Find the marked angle $a$. [img]https://cdn.artofproblemsolving.com/attachments/8/e/334c8662377155086e9211da3589145f460b52.png[/img]

Consider a sequence $T_0, T_1, \dots$ of polynomials defined recursively by $T_0(x) = 2$, $T_1(x)=x$, and $T_{n+2}(x) = xT_{n+1}(x) - T_n(x)$ for each nonnegative integer $n$. Let $L_n$ be the sequence of Lucas Numbers, defined by $L_0 = 2$, $L_1 = 1$, and $L_{n+2} = L_n+L_{n+1}$ for every nonnegative integer $n$. Find the remainder when $ T_0\left( L_0 \right) + T_1 \left( L_2 \right) + T_2 \left( L_4 \right) + \dots + T_{359} \left( L_{718} \right)$ is divided by $359$. [i]Proposed by Yang Liu[/i]

Let us have an infinite grid of unit squares. We write in every unit square a real number, such that the absolute value of the sum of the numbers from any $n*n$ square is less or equal than $1$. Prove that the absolute value of the sum of the numbers from any $m*n$ rectangular is less or equal than $4$.