Let $\mathbb{Z}[x]$ denote the set of single-variable polynomials in $x$ with integer coefficients. Find all functions $\theta : \mathbb{Z}[x] \to \mathbb{Z}[x]$ (i.e. functions taking polynomials to polynomials) such that [list] [*] for any polynomials $p, q \in \mathbb{Z}[x]$, $\theta(p + q) = \theta(p) + \theta(q)$; [*] for any polynomial $p \in \mathbb{Z}[x]$, $p$ has an integer root if and only if $\theta(p)$ does. [/list] [i]Carl Schildkraut[/i]

In a triangular pyramid $SABC$ one of the plane angles with vertex $S$ is a right angle and the orthogonal projection of $S$ on the base plane $ABC$ coincides with the orthocenter of the triangle $ABC$. Let $SA=m$, $SB=n$, $SC=p$, $r$ is the inradius of $ABC$. $H$ is the height of the pyramid and $r_1,r_2,r_3$ are radii of the incircles of the intersections of the pyramid with the plane passing through $SA,SB,SC$ and the height of the pyramid. Prove that (a) $m^2+n^2+p^2\ge18r^2$; (b) $\frac{r_1}H,\frac{r_2}H,\frac{r_3}H$ are in the range $(0.4,0.5)$.

Rectangle $ ABCD$ and a semicircle with diameter $ AB$ are coplanar and have nonoverlapping interiors. Let $ \mathcal{R}$ denote the region enclosed by the semicircle and the rectangle. Line $ \ell$ meets the semicircle, segment $ AB$, and segment $ CD$ at distinct points $ N$, $ U$, and $ T$, respectively. Line $ \ell$ divides region $ \mathcal{R}$ into two regions with areas in the ratio $ 1: 2$. Suppose that $ AU \equal{} 84$, $ AN \equal{} 126$, and $ UB \equal{} 168$. Then $ DA$ can be represented as $ m\sqrt {n}$, where $ m$ and $ n$ are positive integers and $ n$ is not divisible by the square of any prime. Find $ m \plus{} n$.

Let $d(n)$ denote the number of positive divisors of $n$. For any given integer $a \geq 3$, define a sequence $\{a_i\}_{i=0}^\infty$ satisfying [list] [*] $a_{0}=a$, and [*] $a_{n+1}=a_{n}+(-1)^{n} d(a_{n})$ for each integer $n \geq 0$. [/list] For example, if $a=275$, the sequence would be \[275, \overline{281,279,285,277,279,273}.\] Prove that for each positive integer $k$ there exists a positive integer $N$ such that if such a sequence has period $2k$ and all terms of the sequence are greater than $N$ then all terms of the sequence have the same parity. [i]Proposed by Navid[/i]

A triangle has sides $a, b, c$ with longest side $c$, and circumradius $R$. Show that if $a^2 + b^2 = 2cR$, then the triangle is right-angled.

Find the minimum value of $\frac{xy}{z} + \frac{yz}{x} +\frac{ zx}{y}$ for positive reals $x, y, z$ with $x^2 + y^2 + z^2 = 1$.

Find the greatest $n$ such that $(z+1)^n = z^n + 1$ has all its non-zero roots in the unitary circumference, e.g. $(\alpha+1)^n = \alpha^n + 1, \alpha \neq 0$ implies $|\alpha| = 1.$

Prove that if $ p$ is a prime number, then $ 7p+3^{p}-4$ is not a perfect square.

Let $a \in \mathbb{N}$ such that $a + n^2$ can be expressed as the sum of two squares for all $n \in \mathbb{N}$. Prove that $a$ is the square of a natural number.

Find the total number of different integer values the function \[f(x) = \lfloor x\rfloor+\lfloor 2x\rfloor+\left\lfloor \frac{5x}{3}\right\rfloor+\lfloor 3x\rfloor+\lfloor 4x\rfloor\] takes for real numbers $x$ with $0 \leq x \leq 100$.

$ a_1, a_2, \cdots, a_n$ is a sequence of real numbers, and $ b_1, b_2, \cdots, b_n$ are real numbers that satisfy the condition $ 1 \ge b_1 \ge b_2 \ge \cdots \ge b_n \ge 0$. Prove that there exists a natural number $ k \le n$ that satisifes $ |a_1b_1 \plus{} a_2b_2 \plus{} \cdots \plus{} a_nb_n| \le |a_1 \plus{} a_2 \plus{} \cdots \plus{} a_k|$

Evaluate $$\lim_{n\to\infty}\left(\frac{1+\frac13+\ldots+\frac1{2n+1}}{\ln\sqrt n}\right)^{\ln\sqrt n}$$ [i]Proposed by Ángel Plaza[/i]

For positive integer $k>1$, let $f(k)$ be the number of ways of factoring $k$ into product of positive integers greater than $1$ (The order of factors are not countered, for example $f(12)=4$, as $12$ can be factored in these $4$ ways: $12,2\cdot 6,3\cdot 4, 2\cdot 2\cdot 3$. Prove: If $n$ is a positive integer greater than $1$, $p$ is a prime factor of $n$, then $f(n)\leq \frac{n}{p}$

A number of $17$ workers stand in a row. Every contiguous group of at least $2$ workers is a $\textit{brigade}$. The chief wants to assign each brigade a leader (which is a member of the brigade) so that each worker’s number of assignments is divisible by $4$. Prove that the number of such ways to assign the leaders is divisible by $17$. [i]Mikhail Antipov, Russia[/i]

In an acute-angled triangle $ABC$, $M$ and $N$ are points on the sides $AC$ and $BC$ respectively, and $K$ the midpoint of $MN$. The circumcircles of triangles $ACN$ and $BCM$ meet again at a point $D$. Prove that the line $CD$ contains the circumcenter $O$ of $\triangle ABC$ if and only if $K$ is on the perpendicular bisector of $AB.$

A circle is inscribed in a unit square, and a diagonal of the square is drawn. Find the total length of the segments of the diagonal not contained within the circle.

If $x$ and $y$ are positive numbers, prove the inequality $\frac{x}{x^4 +y^2 }+\frac{y}{x^2 +y^4} \le \frac{1}{xy}$ .

Let $\mathbb{Z}^+$ be the set of positive integers. Determine all functions $f : \mathbb{Z}^+\to\mathbb{Z}^+$ such that $a^2+f(a)f(b)$ is divisible by $f(a)+b$ for all positive integers $a,b$.

Define $\triangle ABC$ with incenter $I$ and $AB=5$, $BC=12$, $CA=13$. A circle $\omega$ centered at $I$ intersects $ABC$ at $6$ points. The green marked angles sum to $180^\circ.$ Find $\omega$'s area divided by $\pi.$

In $ \triangle{ABC}$ with $ AB = 12$, $ BC = 13$, and $ AC = 15$, let $ M$ be a point on $ \overline{AC}$ such that the incircles of $ \triangle{ABM}$ and $ \triangle{BCM}$ have equal radii. Let $ p$ and $ q$ be positive relatively prime integers such that $ \tfrac{AM}{CM} = \tfrac{p}{q}$. Find $ p + q$.

The positive integers $a, b$ and $c$ satisfy that the three fractions $\frac{b}{a}$, $\frac{c + 100}{b}$ and $\frac{a + b + 169}{2c + 200}$ are all integers. Determine all possible values of $a$.

Let $ABCD$ be a cyclic quadrilateral with center $O$ with $AB > CD$ and $BC > AD$. Let $M$ and $N$ be the midpoint of sides $AD$ and $BC$, respectively, and let $X$ and $Y$ be on $AB$ and $CD$, respectively, such that $AX \cdot CY = BX \cdot DY = 20000$, and $AX \le CY$. Let lines $AD$ and $BC$ hit at $P$, and let lines $AB$ and $CD$ hit at $Q$. The circumcircles of $\triangle MNP$ and $\triangle XYQ$ hit at a point $R$ that is on the opposite side of $CD$ as $O$. Let $R_1$ be the midpoint of $PQ$ and $B$, $D$, and $R$ be collinear. Let $O_1$ be the circumcenter of $\triangle BPQ$. Let the lines $BO_1$ and $DR_1$ intersect at a point $I$. If $BP \cdot BQ = 823875$, $AB=429$, and $BC=495$, then $IR=\frac{a\sqrt{b}}{c}$ where $a$, $b$, and $c$ are positive integers, $b$ is not divisible by the square of a prime, and $\gcd(a,c) = 1$. Find the value of $a+b+c$. [i]Proposed by Kevin Zhao[/i]

Let $ABC$ be an acute triangle with circumcircle $\omega$ and orthocenter $H$. Suppose the tangent to the circumcircle of $\triangle HBC$ at $H$ intersects $\omega$ at points $X$ and $Y$ with $HA=3$, $HX=2$, $HY=6$. The area of $\triangle ABC$ can be written as $m\sqrt n$, where $m$ and $n$ are positive integers, and $n$ is not divisible by the square of any prime. Find $m+n$.

For $n$ an odd positive integer, the unit squares of an $n\times n$ chessboard are coloured alternately black and white, with the four corners coloured black. A [i]tromino[/i] is an $L$-shape formed by three connected unit squares. $(a)$ For which values of $n$ is it possible to cover all the black squares with non-overlapping trominoes lying entirely on the chessboard? $(b)$ When it is possible, find the minimum number of trominoes needed.

Find all distinct prime numbers $p,q,r,s$ such that $1-\frac{1}{p} - \frac{1}{q} -\frac{1}{r} - \frac{1}{s} =\frac{1}{pqrs}$