We say that $1\leq a\leq101$ is a quadratic polynomial residue modulo $101$ with respect to a quadratic polynomial $f(x)$ with integer coefficients if there exists an integer $b$ such that $101 \mid a-f(b)$. For a quadratic polynomial $f$, we define its quadratic residue set as the set of quadratic residues modulo $101$ with respect to $f(x)$. Compute the number of quadratic residue sets. [i]Proposed by Michael Ren[/i]

Prove that for $\forall$ $x,y,z\in \mathbb{R}^+$ the following inequality is true: $\frac{x}{y+z}+\frac{25y}{z+x}+\frac{4z}{x+y}>2$.

What is the largest possible number of vertices one can have in a graph that satisfies the following conditions: each vertex is connected to exactly $3$ other vertices, and there always exists a path of length less than or equal to $2$ between any two vertices?

Let $f(x) = 4x - x^{2}$. Give $x_{0}$, consider the sequence defined by $x_{n} = f(x_{n-1})$ for all $n \ge 1$. For how many real numbers $x_{0}$ will the sequence $x_{0}, x_{1}, x_{2}, \ldots$ take on only a finite number of different values? $ \textbf{(A)}\ \text{0}\qquad\textbf{(B)}\ \text{1 or 2}\qquad\textbf{(C)}\ \text{3, 4, 5 or 6}\qquad\textbf{(D)}\ \text{more than 6 but finitely many}\qquad\textbf{(E)}\ \text{infinitely many} $

An $n$-mino is a connected figure made by connecting $n$ $1 \times 1 $ squares. Two polyminos are the same if moving the first we can reach the second. For a polymino $P$ ,let $|P|$ be the number of $1 \times 1$ squares in it and $\partial P$ be number of squares out of $P$ such that each of the squares have at least on edge in common with a square from $P$. (a) Prove that for every $x \in (0,1)$:\[\sum_P x^{|P|}(1-x)^{\partial P}=1\] The sum is on all different polyminos. (b) Prove that for every polymino $P$, $\partial P \leq 2|P|+2$ (c) Prove that the number of $n$-minos is less than $6.75^n$. [i]Proposed by Kasra Alishahi[/i]

In the triangle $ABC$, $X$ lies on the side $BC$, $Y$ on the side $CA$, and $Z$ on the side $AB$ with $YX \| AB, ZY \| BC$, and $XZ \| CA$. Show that $X,Y$, and $Z$ are the midpoints of the respective sides of $ABC$.

$AB$ and $CD$ are two fixed parallel chords of the circle $S$. $M$ is a variable point on the circle. $Q$ is the intersection of the lines $MD$ and $AB$. $X$ is the circumcenter of the triangle $MCQ$. Find the locus of $X$. What happens to $X$ as $M$ tends to (1) $D$, (2) $C$? Find a point $E$ outside the plane of $S$ such that the circumcenter of the tetrahedron $MCQE$ has the same locus as $X$.

Let $ABC$ be a triangle with $\angle BAC =60^\circ$. $A'$ is the symmetric point of $A$ wrt $\overline{BC}$. $D$ is the point in $\overline{AC}$ such that $\overline{AB}=\overline{AD}$. $H$ is the orthocenter of triangle $ABC$. $l$ is the external angle bisector of $\angle BAC$. $\{M\}=\overline{A'D}\cap l$,$\{N\}=\overline{CH} \cap l$. Show that $\overline{AM}=\overline{AN}$.

A quadratic polynomial $p(x)$ with integer coefficients satisfies $p(41) = 42$. For some integers $a, b > 41$, $p(a) = 13$ and $p(b) = 73$. Compute the value of $p(1)$. [i]Proposed by Aaron Lin[/i]

Let $n$ be a positive integer. Suppose that the following simultaneous equations $$\begin{cases} \sin x_1 + \sin x_2+ ...+ \sin x_n = 0 \\ \sin x_1 + 2\sin x_2+ ...+ n \sin x_n = 100 \end{cases}$$ has a solution, where $x_1 x_2,.., x_n$ are the unknowns. Find the smallest possible positive integer $n$. Justify your answer.

An integer $a$ is given. Find all real-valued functions $f (x)$ defined on integers $x \ge a$, satisfying the equation $f (x+y) = f (x) f (y)$ for all $x,y \ge a$ with $x + y \ge a$.

Let $A$ be a subset with seven elements of the set $\{1,2,3, ...,26\}$. Show that there are two distinct elements of $A$, having the same sum of their elements.

Let $ P(z) \equal{} z^3 \plus{} az^2 \plus{} bz \plus{} c$, where $ a$, $ b$, and $ c$ are real. There exists a complex number $ w$ such that the three roots of $ P(z)$ are $ w \plus{} 3i$, $ w \plus{} 9i$, and $ 2w \minus{} 4$, where $ i^2 \equal{} \minus{} 1$. Find $ |a \plus{} b \plus{} c|$.

We are given $100$ strictly increasing sequences of positive integers: $A_{i}= (a_{1}^{(i)}, a_{2}^{(i)},...), i = 1, 2,..., 100$. For $1 \leq r, s \leq 100$ we define the following quantities: $f_{r}(u)=$ the number of elements of $A_{r}$ not exceeding $n$; $f_{r,s}(u) =$ the number of elements of $A_{r}\cap A_{s}$ not exceeding $n$. Suppose that $f_{r}(n) \geq\frac{1}{2}n$ for all $r$ and $n$. Prove that there exists a pair of indices $(r, s)$ with $r \not = s$ such that $f_{r,s}(n) \geq\frac{8n}{33}$ for at least five distinct $n-s$ with $1 \leq n < 19920.$

A convex hexagon $ABCDEF$ is given, with each two opposite sides of different lengths and parallel ($AB \parallel DE$, $BC \parallel EF$ and $CD \parallel FA$). If $|AE| = |BD|$ and $|BF| = |CE|$, prove that the hexagon $ABCDEF$ is cyclic.

Let $ABC$ be an acute-angled triangle with $AB \neq AC$, circumcentre $O$ and circumcircle $\Gamma$. Let the tangents to $\Gamma$ at $B$ and $C$ meet each other at $D$, and let the line $AO$ intersect $BC$ at $E$. Denote the midpoint of $BC$ by $M$ and let $AM$ meet $\Gamma$ again at $N \neq A$. Finally, let $F \neq A$ be a point on $\Gamma$ such that $A, M, E$ and $F$ are concyclic. Prove that $FN$ bisects the segment $MD$.

How many ways can you color the squares of a $ 2 \times 2008$ grid in 3 colors such that no two squares of the same color share an edge?

Let $A$ and $B$ be points on the same branch of the hyperbola $xy=1.$ Suppose that $P$ is a point lying between $A$ and $B$ on this hyperbola, such that the area of the triangle $APB$ is as large as possible. Show that the region bounded by the hyperbola and the chord $AP$ has the same area as the region bounded by the hyperbola and the chord $PB.$

Let $n$ be a positive integer. Let $(a, b, c)$ be a random ordered triple of nonnegative integers such that $a + b + c = n$, chosen uniformly at random from among all such triples. Let $M_n$ be the expected value (average value) of the largest of $a$, $b$, and $c$. As $n$ approaches infinity, what value does $\frac{M_n}{n}$ approach?

Determine, with proof, the maximum and minimum among the numbers $$\sqrt5 - \lfloor \sqrt5 \rfloor, 2\sqrt5 - \lfloor 2\sqrt5 \rfloor, 3\sqrt5 - \lfloor 3 \sqrt5\rfloor, ..., 2013\sqrt5 - \lfloor 2013\sqrt5\rfloor, 2014\sqrt5 - \lfloor 2014\sqrt5\rfloor $$

Find all integer solutions to $2 x^4 + 1 = y^2.$

For each prime number $p$, determine the number of residue classes modulo $p$ which can be represented as $a^2+b^2$ modulo $p$, where $a$ and $b$ are arbitrary integers. [i](Daniel Holmes)[/i]

Let $h \ge 3$ be an integer and $X$ the set of all positive integers that are greater than or equal to $2h$. Let $S$ be a nonempty subset of $X$ such that the following two conditions hold: [list] [*]if $a + b \in S$ with $a \ge h, b \ge h$, then $ab \in S$; [*]if $ab \in S$ with $a \ge h, b \ge h$, then $a + b \in S$.[/list] Prove that $S = X$.

Prove that \[ \left(\frac{6}{5}\right)^{\sqrt{3}}>\left(\frac{5}{4}\right)^{\sqrt{2}}. \]

A $15$-inch-long stick has four marks on it, dividing it into five segments of length $1,2,3, 4$, and $5$ inches (although not neccessarily in that order) to make a “ruler.” Here is an example. [img]https://cdn.artofproblemsolving.com/attachments/0/e/065d42b36083453f3586970125bedbc804b8a1.png[/img] Using this ruler, you could measure $8$ inches (between the marks $B$ and $D$) and $11$ inches (between the end of the ruler at $A$ and the mark at $E$), but there’s no way you could measure $12$ inches. Prove that it is impossible to place the four marks on the stick such that the five segments have length $1,2,3, 4$, and $5$ inches, and such that every integer distance from $1$ inch through $15$ inches could be measured.