Two circles $O_1$ and $O_2$ intersect at $A,B$. Bisector of outer angle $\angle O_1AO_2$ intersects $O_1$ at $C$, $O_2$ at $D$. $P$ is a point on $\odot(BCD)$, $CP\cap O_1=E,DP\cap O_2=F$. Prove that $PE=PF$.

The number of sets of two or more consecutive positive integers whose sum is 100 is $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

What is the maximum number of rational points that can lie on a circle in $ \mathbb{R}^2$ whose center is not a rational point? (A [i]rational point[/i] is a point both of whose coordinates are rational numbers.)

Find all non-negative integers $n$ such that there are $a,b \in \mathbb Z$ satisfying $n^2=a+b$ and $n^3=a^2+b^2$. [i]Lucian Dragomir[/i]

Let $a_1, \dots, a_n, b_1, \dots, b_n$ be $2n$ positive integers such that the $n+1$ products \[a_1 a_2 a_3 \cdots a_n, b_1 a_2 a_3 \cdots a_n, b_1 b_2 a_3 \cdots a_n, \dots, b_1 b_2 b_3 \cdots b_n\] form a strictly increasing arithmetic progression in that order. Determine the smallest possible integer that could be the common difference of such an arithmetic progression.

Let $f(x)$ be a continuous function such that $f(2x^2-1)=2xf(x)$ for all $x$. Show that $f(x)=0$ for $-1\le x \le 1$.

Does there exist an infinite sequence of integers \(a_0\), \(a_1\), \(a_2\), \(\ldots\) such that \(a_0\ne0\) and, for any integer \(n\ge0\), the polynomial \[P_n(x)=\sum_{k=0}^na_kx^k\] has \(n\) distinct real roots? [i]Proposed by Amol Rama and Espen Slettnes[/i]

It is given the function $f: \left(\mathbb{R} - \{0\}\right) \to \mathbb{R}$ such that $f(x)=x+\frac{1}{x}$. Is this function injective ? Justify your answer.

Triangle $ ABC$, with sides of length $ 5$, $ 6$, and $ 7$, has one vertex on the positive $ x$-axis, one on the positive $ y$-axis, and one on the positive $ z$-axis. Let $ O$ be the origin. What is the volume of tetrahedron $ OABC$? $ \textbf{(A)}\ \sqrt{85} \qquad \textbf{(B)}\ \sqrt{90} \qquad \textbf{(C)}\ \sqrt{95} \qquad \textbf{(D)}\ 10 \qquad \textbf{(E)}\ \sqrt{105}$

Let $ x_1, \ldots, x_n$ be $ n>1$ real numbers satisfying $ A\equal{}\left |\sum^n_{i\equal{}1}x_i\right |\not \equal{}0$ and $ B\equal{}\max_{1\leq i<j\leq n}|x_j\minus{}x_i|\not \equal{}0$. Prove that for any $ n$ vectors $ \vec{\alpha_i}$ in the plane, there exists a permutation $ (k_1, \ldots, k_n)$ of the numbers $ (1, \ldots, n)$ such that \[ \left |\sum_{i\equal{}1}^nx_{k_i}\vec{\alpha_i}\right | \geq \dfrac{AB}{2A\plus{}B}\max_{1\leq i\leq n}|\alpha_i|.\]

Determine all primes $p$, for which there exist positive integers $m, n$, such that $p=m^2+n^2$ and $p|m^3+n^3+8mn$.

Show that if $m$ and $n$ are relatively prime positive integers, then $\phi( 5^m -1) \neq 5^{n}-1$.

On the plane three different points $P, Q$, and $R$ are chosen. It is known that however one chooses another point $X$ on the plane, the point $P$ is always either closer to $X$ than the point $Q$ or closer to $X$ than the point $R$. Prove that the point $P$ lies on the line segment $QR$.

Let $ABC$ be an isosceles triangle in which $\angle BAC=120^\circ,$ $D$ be the midpoint of $BC,$ $DE$ be the altitude of triangle $ADC,$ and $M$ be the midpoint of $DE.$ Prove that $BM=3AM.$

For each integer $n$, determine the smallest real number $M_n$ such that \[\frac{1}{a_1}+\frac{a_1}{a_2}+\frac{a_2}{a_3}+\dots+\frac{a_{n-1}}{a_n} \le M_n\] for any $n$-tuple $(a_1,a_2,\dots,a_n)$ of integers such that $1<a_1<a_2<\dots<a_n$.

Let $ABC$ be a triangle with $AB \ne AC$ and incenter $I$. The incircle touches $BC$ at $D$. Let $M$ be the midpoint of $BC$ . Show that the line $IM$ bisects segment $AD$ .

[u]Chessboards [/u] Joe B. is playing with some chess pieces on a $6\times 6$ chessboard. Help him find out some things. [b]p1.[/b] Joe B. first places the black king in one corner of the board. In how many of the $35$ remaining squares can he place a white bishop so that it does not check the black king? [b]p2.[/b] Joe B. then places a white king in the opposite corner of the board. How many total ways can he place one black bishop and one white bishop so that neither checks the king of the opposite color? [b]p3.[/b] Joe B. now clears the board. How many ways can he place $3$ white rooks and $3$ black rooks on the board so that no two rooks of opposite color can attack each other? [b]p4.[/b] Joe B. is frustrated with chess. He breaks the board, leaving a $4\times 4$ board, and throws $3$ black knights and $3$ white kings at the board. Miraculously, they all land in distinct squares! What is the expected number of checks in the resulting position? (Note that a knight can administer multiple checks and a king can be checked by multiple knights.) [b]p5.[/b] Suppose that at some point Joe B. has placed $2$ black knights on the original board, but gets bored of chess. He now decides to cover the $34$ remaining squares with $17$ dominos so that no two overlap and the dominos cover the entire rest of the board. For how many initial arrangements of the two pieces is this possible? Note: Chess is a game played with pieces of two colors, black and white, that players can move between squares on a rectangular grid. Some of the pieces move in the following ways: $\bullet$ Bishop: This piece can move any number of squares diagonally if there are no other pieces along its path. $\bullet$ Rook: This piece can move any number of squares either vertically or horizontally if there are no other pieces along its path. $\bullet$ Knight: This piece can move either two squares along a row and one square along a column or two squares along a column and one square along a row. $\bullet$ King: This piece can move to any open adjacent square (including diagonally). If a piece can move to a square occupied by a king of the opposite color, we say that it is checking the king. If a piece moves to a square occupied by another piece, this is called attacking.

Prove that for all positive real numbers $a,b,c$, \[ \frac{a}{\sqrt{a^2 + 8bc}} + \frac{b}{\sqrt{b^2 + 8ca}} + \frac{c}{\sqrt{c^2 + 8ab}} \geq 1. \]

It is well-known that a quadratic equation has no more than 2 roots. Is it possible for the equation $\lfloor x^2\rfloor+px+q=0$ with $p\neq 0$ to have more than 100 roots? [i]Alexey Tolpygo[/i]

Let $n \ge 2$ and let $x_1, x_2, ..., x_n$ be real numbers satisfying $x_1 +x_2 +...+x_n \ge 0$ and $x_1^2+x_2^2+...+x_n^2=1$. Let $M = max \{x_1, x_2,... , x_n\}$. Show that $M \ge \frac{1}{\sqrt{n(n-1)}}$ (1) .When does equality hold in (1)?

In $\vartriangle ABC$, $\angle ABC = 75^o$ and $\angle BAC$ is obtuse. Points $D$ and $E$ are on $AC$ and $BC$, respectively, such that $\frac{AB}{BC} = \frac{DE}{EC}$ and $\angle DEC = \angle EDC$. Compute $\angle DEC$ in degrees.

Let $f:[0,1]\to\mathbb{R}$ be a continuous function and let $\{a_n\}_n$, $\{b_n\}_n$ be sequences of reals such that \[ \lim_{n\to\infty} \int^1_0 | f(x) - a_nx - b_n | dx = 0 . \] Prove that: a) The sequences $\{a_n\}_n$, $\{b_n\}_n$ are convergent; b) The function $f$ is linear.

Let $ABCD$ be a convex quadrilateral such that the circle with diameter $AB$ is tangent to the line $CD$, and the circle with diameter $CD$ is tangent to the line $AB$. Prove that the two intersection points of these circles and the point $AC \cap BD$ are collinear.

Let $x\geq 5, y\geq 6, z\geq 7$ such that $x^2+y^2+z^2\geq 125$. Find the minimum value of $x+y+z$.

Two concentric circles are divided by $n$ radii into $2n$ parts. Two parts are called neighbors (of each other) if they share either a common side or a common arc. Initially, there are $4n + 1$ frogs inside the parts. At each second, if there are three or more frogs inside one part, then three of the frogs in the part will jump to its neighbors, with one to each neighbor. Prove that in a finite amount of time, for any part either there are frogs in the part or there are frogs in each of its neighbors