Prove that for every prime $p>100$ and every integer $r$, there exist two integers $a$ and $b$ such that $p$ divides $a^2+b^5-r$.

If $S = 6 \times10 000 +5\times 1000+ 4 \times 10+ 3 \times 1$, what is $S$? $\textbf{(A)}\ 6543 \qquad \textbf{(B)}\ 65043 \qquad \textbf{(C)}\ 65431 \qquad \textbf{(D)}\ 65403 \qquad \textbf{(E)}\ 60541$

Given distinct prime numbers $p$ and $q$ and a natural number $n \geq 3$, find all $a \in \mathbb{Z}$ such that the polynomial $f(x) = x^n + ax^{n-1} + pq$ can be factored into 2 integral polynomials of degree at least 1.

Claire takes a square piece of paper and folds it in half four times without unfolding, making an isosceles right triangle each time. After unfolding the paper to form a square again, the creases on the paper would look like

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.$

Given distinct prime numbers $p$ and $q$ and a natural number $n \geq 3$, find all $a \in \mathbb{Z}$ such that the polynomial $f(x) = x^n + ax^{n-1} + pq$ can be factored into 2 integral polynomials of degree at least 1.

We define an operation $\oplus$ on the set $\{0, 1\}$ by \[ 0 \oplus 0 = 0 \,, 0 \oplus 1 = 1 \,, 1 \oplus 0 = 1 \,, 1 \oplus 1 = 0 \,.\] For two natural numbers $a$ and $b$, which are written in base $2$ as $a = (a_1a_2 \ldots a_k)_2$ and $b = (b_1b_2 \ldots b_k)_2$ (possibly with leading 0's), we define $a \oplus b = c$ where $c$ written in base $2$ is $(c_1c_2 \ldots c_k)_2$ with $c_i = a_i \oplus b_i$, for $1 \le i \le k$. For example, we have $7 \oplus 3 = 4$ since $ 7 = (111)_2$ and $3 = (011)_2$. For a natural number $n$, let $f(n) = n \oplus \left[ n/2 \right]$, where $\left[ x \right]$ denotes the largest integer less than or equal to $x$. Prove that $f$ is a bijection on the set of natural numbers.

Bisectors $AA_1$ and $BB_1$ of a right triangle $ABC \ (\angle C=90^\circ )$ meet at a point $I.$ Let $O$ be the circumcenter of triangle $CA_1B_1.$ Prove that $OI \perp AB.$

Prove that if the integers $a_{1}$, $a_{2}$, $\cdots$, $a_{n}$ are all distinct, then the polynomial \[(x-a_{1})^{2}(x-a_{2})^{2}\cdots (x-a_{n})^{2}+1\] cannot be expressed as the product of two nonconstant polynomials with integer coefficients.

Given a circle $(O)$ and two fixed points $B,C$ on $(O),$ and an arbitrary point $A$ on $(O)$ such that the triangle $ABC$ is acute. $M$ lies on ray $AB,$ $N$ lies on ray $AC$ such that $MA=MC$ and $NA=NB.$ Let $P$ be the intersection of $(AMN)$ and $(ABC),$ $P\ne A.$ $MN$ intersects $BC$ at $Q.$ a) Prove that $A,P,Q$ are collinear. b) $D$ is the midpoint of $BC.$ Let $K$ be the intersection of $(M,MA)$ and $(N,NA),$ $K\ne A.$ $d$ is the line passing through $A$ and perpendicular to $AK.$ $E$ is the intersection of $d$ and $BC.$ $(ADE)$ intersects $(O)$ at $F,$ $F\ne A.$ Prove that $AF$ passes through a fixed point.

The pattern of figures $\triangle$ $ \bullet$ $ \square$ $\blacktriangle$ $\circ$ is repeated in the sequence $$\triangle,\bullet, \square, \blacktriangle, \circ, \triangle, \bullet, \square, \blacktriangle, \circ$$ The 214th figure in the sequence is (A) $\triangle$ (B) $\bullet$ (C) $\square$ (D) $\blacktriangle$ (E) $\circ$

Let $ N > M > 1$ be fixed integers. There are $ N$ people playing in a chess tournament; each pair of players plays each other once, with no draws. It turns out that for each sequence of $ M \plus{} 1$ distinct players $ P_0, P_1, \ldots P_M$ such that $ P_{i \minus{} 1}$ beat $ P_i$ for each $ i \equal{} 1, \ldots, M$, player $ P_0$ also beat $ P_M$. Prove that the players can be numbered $ 1,2, \ldots, N$ in such a way that, whenever $ a \geq b \plus{} M \minus{} 1$, player $ a$ beat player $ b$. [i]Gabriel Carroll.[/i]

A large candle is $119$ centimeters tall. It is designed to burn down more quickly when it is first lit and more slowly as it approaches its bottom. Specifically, the candle takes $10$ seconds to burn down the first centimeter from the top, $20$ seconds to burn down the second centimeter, and $10k$ seconds to burn down the $k$-th centimeter. Suppose it takes $T$ seconds for the candle to burn down completely. Then $\tfrac{T}{2}$ seconds after it is lit, the candle's height in centimeters will be $h$. Find $10h$.

Five students named Fred, Gail, Henry, Iggy, and Joan are seated around a circular table in that order. To decide who goes first in a game, they play “countdown”. Henry starts by saying ‘34’, with Iggy saying ‘33’. If they continue to count down in their circular order, who will eventually say ‘1’? $\textbf{(A)}\ \text{Fred} \qquad \textbf{(B)}\ \text{Gail} \qquad \textbf{(C)}\ \text{Henry} \qquad \textbf{(D)}\ \text{Iggy} \qquad \textbf{(E)}\ \text{Joan}$

Consider a sequence $\{a_n\}_{n\geq 0}$ such that $a_{n+1}=a_n-\lfloor{\sqrt{a_n}}\rfloor\ (n\geq 0),\ a_0\geq 0$. (1) If $a_0=24$, then find the smallest $n$ such that $a_n=0$. (2) If $a_0=m^2\ (m=2,\ 3,\ \cdots)$, then for $j$ with $1\leq j\leq m$, express $a_{2j-1},\ a_{2j}$ in terms of $j,\ m$. (3) Let $m\geq 2$ be integer and for integer $p$ with $1\leq p\leq m-1$, let $a\0=m^2-p$. Find $k$ such that $a_k=(m-p)^2$, then find the smallest $n$ such that $a_n=0$.