There exists a polynomial $P$ of degree $5$ with the following property: if $z$ is a complex number such that $z^5+2004z=1$, then $P(z^2)=0$. Calculate the quotient $\tfrac{P(1)}{P(-1)}$.

In-circle of $ABC$ with center $I$ touch $AB$ and $AC$ at $P$ and $Q$ respectively. $BI$ and $CI$ intersect $PQ$ at $K$ and $L$ respectively. Prove, that circumcircle of $ILK$ touch incircle of $ABC$ iff $|AB|+|AC|=3|BC|$.

a) Find all integers that can divide both the numerator and denominator of the ratio $\frac{5m + 6}{8m + 7}$ for an integer $m$. b) Let $a, b, c, d, m$ be integers. Prove that if the numerator and denominator of the ratio $\frac{am + b}{cm+ d}$ are both divisible by $k$, then so is $ad - bc$.

An integer between 1000 and 9999, inclusive, is called balanced if the sum of its two leftmost digits equals the sum of its two rightmost digits. How many balanced integers are there?

Alice and Bob are builders; Charlie is a destroyer. Alice can build a car in $20$ hours and Bob can build a car in $10$ hours, while Charlie destroys a car in $40$ hours. If Alice and Bob are working together on a car Charlie is destroying, how many hours will it take for Alice and Bob to finish building the car?

Find all pairs of twice differentiable functions $f,g \colon \mathbb{R} \to \mathbb{R}$, with their second derivative being continuous, such that the following holds for all $x,y \in \mathbb{R}$: \[(f(x)-g(y))(f'(x)-g'(y))(f''(x)-g''(y))=0\]

The mean, median, and mode of the $7$ data values $60, 100, x, 40, 50, 200, 90$ are all equal to $x$. What is the value of $x$? $\textbf{(A)}\ 50 \qquad\textbf{(B)}\ 60 \qquad\textbf{(C)}\ 75 \qquad\textbf{(D)}\ 90 \qquad\textbf{(E)}\ 100$

For how many integers $n$, with $2 \leq n \leq 80$, is $\frac{(n-1)n(n+1)}{8}$ equal to an integer? $ \mathrm{(A) \ } 10 \qquad \mathrm{(B) \ } 20 \qquad \mathrm {(C) \ } 39 \qquad \mathrm{(D) \ } 49 \qquad \mathrm{(E) \ } 59$

Suppose that $p(n)$ is the number of ways to express $n$ as a sum of some naturall numbers (the two representations $4=1+1+2$ and $4=1+2+1$ are considered the same). Prove that for an infinite number of $n$'s $p(n)$ is even and for an infinite number of $n$'s $p(n)$ is odd.

Define $f (n) = n + 1$ if $n = p^k > 1$ is a power of a prime number, and $f (n) =p_1^{k_1}+... + p_r^{k_r}$ for natural numbers $n = p_1^{k_1}... p_r^{k_r}$ ($r > 1, k_i > 0$). Given $m > 1$, we construct the sequence $a_0 = m, a_{j+1} = f (a_j)$ for $j \ge 0$ and denote by $g(m)$ the smallest term in this sequence. For each $m > 1$, determine $g(m)$.

Let $a_1,a_2,...,a_9 \ge - 1$ and $a^3_1+a^3_2+...+a^3_9= 0$. Determine the maximal value of $M = a_1 + a_2 + ... + a_9$.

Prove that there exists an absolute constant $c$ such that any set $H$ of $n$ points of the plane in general position can be coloured with $c\log n$ colours in such a way that any disk of the plane containing at least one point of $H$ intersects some colour class of $H$ in exactly one point.

Let $n$ and $m$ be positive integers in the range $[1, 10^{10}]$. Let $R$ be the rectangle with corners at $(0, 0), (n, 0), (n, m), (0, m)$ in the coordinate plane. A simple non-self-intersecting quadrilateral with vertices at integer coordinates is called [i]far-reaching[/i] if each of its vertices lie on or inside $R$, but each side of $R$ contains at least one vertex of the quadrilateral. Show that there is a far-reaching quadrilateral with area at most $10^6$.

In the triangle $ABC$ on the sides $AB$ and $AC$ outward constructed equilateral triangles $ABD$ and $ACE$. The segments $CD$ and $BE$ intersect at point $F$. It turns out that point $A$ is the center of the circle inscribed in triangle $ DEF$. Find the angle $BAC$. (Rozhkova Maria)

Let $P_1P_2\dotsb P_{100}$ be a cyclic $100$-gon and let $P_i = P_{i+100}$ for all $i$. Define $Q_i$ as the intersection of diagonals $\overline{P_{i-2}P_{i+1}}$ and $\overline{P_{i-1}P_{i+2}}$ for all integers $i$. Suppose there exists a point $P$ satisfying $\overline{PP_i}\perp\overline{P_{i-1}P_{i+1}}$ for all integers $i$. Prove that the points $Q_1,Q_2,\dots, Q_{100}$ are concyclic. [i]Michael Ren[/i]

Given a prime number $p$ and let $\overline{v_1},\overline{v_2},\dotsc ,\overline{v_n}$ be $n$ distinct vectors of length $p$ with integer coordinates in an $\mathbb{R}^3$ Cartesian coordinate system. Suppose that for any $1\leqslant j<k\leqslant n$, there exists an integer $0<\ell <p$ such that all three coordinates of $\overline{v_j} -\ell \cdot \overline{v_k} $ is divisible by $p$. Prove that $n\leqslant 6$.

Let the incircle of an acute triangle $\triangle ABC$ touches $BC,CA$, and $AB$ at points $D,E$, and $F$, respectively. Place point $K$ on the side $AB$ so that $DF$ bisects $\angle ADK$, and place point $L$ on the side $AB$ so that $EF$ bisects $\angle BEL$. [list=a] [*]Prove that $\triangle ALE\sim\triangle AEB$. [*]Prove that $FK=FL$. [/list]

Give the answer about the following propositions $(p),\ (q)$ whether they are true or not. If the answer is true, then give the proof and if the answer is false, then give the proof by giving the counter example. $(p)$ If we can form a triangle such that one of inner angles of the triangle is $60^\circ$ by choosing 3 points from the vertices of a regular $n$-polygon, then $n$ is a multiple of 3. $(q)$ In $\triangle{ABC},\ \triangle{ABD}$, if $AC<AD$ and $BC<BD$, then $\angle{C}>\angle{D}$. 35 points

Find all polynomials $f, g, h$ with real coefficients, such that $f(x)^2+(x+1)g(x)^2=(x^3+x)h(x)^2$

Let $(a_1, a_2,\ldots , a_n)$ be a permutation of $1, 2, \ldots , n,$ where $n  \geq 2.$ For each $k = 1, \ldots , n$, we know that $a_k$ apples are placed at the point $k$ on the real axis. Children named $A,B,C$ are assigned respective points $x_A, x_B, x_C \in \{1, \ldots , n\}.$ For each $k,$ the children whose points are closest to $ k$ divide $a_k$ apples equally among themselves. We call $(x_A, x_B, x_C)$ a [i]stable configuration[/i] if no child’s total share can be increased by assigning a new point to this child and not changing the points of the other two. Determine the values of $n$ for which a stable configuration exists for some distribution $(a_1, \ldots, a_n)$ of the apples.

A computer science teacher has asked his students to write a program that, given a list of $n$ numbers $a_1, a_2, ..., a_n$, calculates the list $b_1, b_2, ..., b_n$ where $b_k$ is the number of times the number $a_k$ appears in the list. So, for example, for the list $1,2,3,1$, the program returns the list $2,1,1,2$. Next, the teacher asked Alexandre to run the program for a list of $2025$ numbers. Then he asked him to apply the program to the resulting list, and so on, until a number greater than or equal to $k$ appears in the list. Find the largest value of $k$ for which, whatever the initial list of $2025$ positive integers $a_1, a_2, ..., a_{2025}$, it is possible for Alexander to do what the teacher asked him to do.

Prove that for $\forall$ $z\in \mathbb{C}$ the following inequality is true: $|z|^2+2|z-1|\geq 1$, where $"="$ is reached when $z=1$.

Let $n$ be positive integer. Define a sequence $\{a_k\}$ by \[a_1=\frac{1}{n(n+1)},\ a_{k+1}=-\frac{1}{k+n+1}+\frac{n}{k}\sum_{i=1}^k a_i\ \ (k=1,\ 2,\ 3,\ \cdots).\] (1) Find $a_2$ and $a_3$. (2) Find the general term $a_k$. (3) Let $b_n=\sum_{k=1}^n \sqrt{a_k}$. Prove that $\lim_{n\to\infty} b_n=\ln 2$. 50 points

Consider the polynomial $p(x)=a_nx^n+\ldots+a_1x+a_0$ with real coefficients such that $0\le a_i\le a_0$ for each $i=1,2,\ldots,n$. If $a$ is the coefficient of $x^{n+1}$ in the polynomial $q(x)=p(x)^2$, prove that $2a\le p(1)^2$.

Find the smallest positive integer $n$ that satisfies the following condition: For every finite set of points on the plane, if for any $n$ points from this set there exist two lines containing all the $n$ points, then there exist two lines containing all points from the set.