Let $p_1, p_2, \ldots, p_{42}$ be $42$ pairwise distinct prime numbers. Show that the sum \[\sum_{j=1}^{42}\frac{1}{p_j^2+1}\] is not a unit fraction $\frac{1}{n^2}$ of some integer square number.

In the triangle $ABC$, variable points $D, E, F$ are on the sides[lines] $BC, CA, AB$ respectively so the triangle $DFE$ is similar to the triangle $ABC$ in this order. Circumcircles of $BDF$ and $CDE$ intersect respectively the circumcircle of $ABC$ at $P$ and $Q$ for the second time. Prove that the circumcircle of $DPQ$ passes through a fixed point.

Medians $AM$ and $BE$ of a triangle $ABC$ intersect at $O$. The points $O, M, E, C$ lie on one circle. Find the length of $AB$ if $BE = AM =3$.

Segment $AB$ is both a diameter of a circle of radius 1 and a side of an equilateral triangle $ABC$. The circle also intersects $AC$ and $BD$ at points $D$ and $E$, respectively. The length of $AE$ is $\displaystyle \text{(A)} \ \frac{3}{2} \qquad \text{(B)} \ \frac{5}{3} \qquad \text{(C)} \ \frac{\sqrt 3}{2} \qquad \text{(D)} \ \sqrt{3} \qquad \text{(E)} \ \frac{2 + \sqrt 3}{2}$

Let $ABC$ be an acute triangle with $AB<AC$. Let $D, E,$ and $F$ be the feet of the perpendiculars from $A, B,$ and $C$ to the opposite sides, respectively. Let $P$ be the foot of the perpendicular from $F$ to line $DE$. Line $FP$ and the circumcircle of triangle $BDF$ meet again at $Q$. Show that $\angle PBQ = \angle PAD$.

An segment $S$ of length $50$ is covered by several segments of length $1$ , all of them contained in $S$. If any of these unit segments were removed, $S$ would no longer be completely covered. Find the maximum number of unit segments with this property. Clarification: Assume that the segments include their endpoints.

Determine the locus of vertices of triangles which have prescribed orthocenter and center of circumcircle.

The Y2K Game is played on a $1 \times 2000$ grid as follows. Two players in turn write either an S or an O in an empty square. The first player who produces three consecutive boxes that spell SOS wins. If all boxes are filled without producing SOS then the game is a draw. Prove that the second player has a winning strategy.

Suppose that $T\in \mathbb N$ is given. Find all functions $f:\mathbb Z \to \mathbb C$ such that, for all $m\in \mathbb Z$ we have $f(m+T)=f(m)$ and: $$\forall a,b,c \in \mathbb Z: f(a)\overline{f(a+b)f(a+c)}f(a+b+c)=1.$$ Where $\overline{a}$ is the complex conjugate of $a$.

Joe and Penny play a game. Initially there are $5000$ stones in a pile, and the two players remove stones from the pile by making a sequence of moves. On the $k$-th move, any number of stones between $1$ and $k$ inclusive may be removed. Joe makes the odd-numbered moves and Penny makes the even-numbered moves. The player who removes the very last stone is the winner. Who wins if both players play perfectly?

The quadrilateral ABCD is circumscribed by a circle C and K, L, M, N are the tangent points of C with the sides AB, BC, CD, DA. Let S be the point of intersection of the lines KM and LN. If the SKBL quadrilateral is cyclic, prove that the quadrilateral SNDM is also cyclic.

Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all $m,n\in\mathbb{N}$, \[(2^m+1)f(n)f(2^mn)=2^mf(n)^2+f(2^mn)^2+(2^m-1)^2n. \]

Consider the points $A_1$ and $A_2$ on the side $AB$ of the square $ABCD$ taken in such a way that $|AB| = 3 |AA_1| $ and $|AB| = 4 |A_2B|$, similarly consider points $B_1$ and $B_2, C_1$ and $C_2, D_1$ and $D_2$ respectively on the sides $BC$, $CD$ and $DA$. The intersection point of straight lines $D_2A_1$ and $A_2B_1$ is $E$, the intersection point of straight lines $A_2B_1$ and $B_2C_1$ is $F$, the intersection point of straight lines $B_2C_1$ and $C_2D_1$ is $G$ and the intersection point of straight lines $C_2D_1$ and $D_2A_1$ is $H$. Find the area of the square $EFGH$, knowing that the area of $ABCD$ is $1$.

In trapezoid $ ABCD$, $ \overline{AB}$ and $ \overline{CD}$ are perpendicular to $ \overline{AD}$, with $ AB\plus{}CD\equal{}BC$, $ AB<CD$, and $ AD\equal{}7$. What is $ AB\cdot CD$? $ \textbf{(A)}\ 12 \qquad \textbf{(B)}\ 12.25 \qquad \textbf{(C)}\ 12.5 \qquad \textbf{(D)}\ 12.75 \qquad \textbf{(E)}\ 13$

Arthur and Renate play a game on a $7 \times 7$ board. Arthur has two red tiles, initially placed on the cells in the bottom left and the upper right corner. Renate has two black tiles, initially placed on the cells in the bottom right and the upper left corner. In a move, a player can choose one of his two tiles and move them to a horizontally or vertically adjacent cell. The players alternate, with Arthur beginning. Arthur wins when both of his tiles are in horizontally or vertically adjacent cells after some number of moves. Can Renate prevent him from winning?

Let $ABC$ be a triangle right in $C$ and the points $D, E$ on the sides $BC$ and $CA$ respectively, such that $\frac{BD}{AC} =\frac{AE}{CD} = k$. Lines $BE$ and $AD$ intersect at $O$. Show that the angle $\angle BOD = 60^o$ if and only if $k =\sqrt3$.

Ed has five identical green marbles and a large supply of identical red marbles. He arranges the green marbles and some of the red marbles in a row and finds that the number of marbles whose right hand neighbor is the same color as themselves equals the number of marbles whose right hand neighbor is the other color. An example of such an arrangement is GGRRRGGRG. Let $m$ be the maximum number of red marbles for which Ed can make such an arrangement, and let $N$ be the number of ways in which Ed can arrange the $m+5$ marbles to satisfy the requirement. Find the remainder when $N$ is divided by 1000.

Two boys $A$ and $B$ start at the same time to ride from Port Jervis to Poughkeepsie, $60$ miles away. $A$ travels $4$ miles an hour slower than $B$. $B$ reaches Poughkeepsie and at once turns back meeting $A$ $12$ miles from Poughkeepsie. The rate of $A$ was: $\textbf{(A)}\ 4\text{ mph}\qquad \textbf{(B)}\ 8\text{ mph} \qquad \textbf{(C)}\ 12\text{ mph} \qquad \textbf{(D)}\ 16\text{ mph} \qquad \textbf{(E)}\ 20\text{ mph}$

Let $k$ be the incircle and let $l$ be the circumcircle of the triangle $ABC$. Prove that for each point $A'$ of the circle $l$, there exists a triangle $(A'B'C')$, inscribed in the circle $l$ and circumscribed about the circle $k.$

Members of the Rockham Soccer League buy socks and T-shirts. Socks cost $ \$4$ per pair and each T-shirt costs $ \$5$ more than a pair of socks. Each member needs one pair of socks and a shirt for home games and another pair of socks and a shirt for away games. If the total cost is $ \$2366$, how many members are in the League? $ \textbf{(A)}\ 77 \qquad \textbf{(B)}\ 91 \qquad \textbf{(C)}\ 143 \qquad \textbf{(D)}\ 182 \qquad \textbf{(E)}\ 286$

There are given integers $a$ and $b$ such that $a$ is different from $0$ and the number $3+ a +b^2$ is divisible by $6a$. Prove that $a$ is negative.

[list=a] [*]The sum of several numbers is equal to one. Can the sum of their cubes be greater than one? [*]The same question as before, for numbers not exceeding one. [*]Can it happen that the series $a_1+a_2+\cdots$ converges, but the series $a_1^3+a_2^3+\cdots$ diverges? [/list]

Find the maximum value of $k$ such that \[\frac{xy}{\sqrt{(x^2 + y^2)(3x^2 + y^2)}}\leq \frac{1}{k}\] holds for all positive numbers $x$ and $y.$

For any prime number $p>2,$ and an integer $a$ and $b,$ if $1+\frac{1}{2^3}+\frac{1}{3^3}+\cdots+\frac{1}{(p-1)^3}=\frac{a}{b},$ prove that $a$ is divisible by $p.$

The kingdom of Anisotropy consists of $n$ cities. For every two cities there exists exactly one direct one-way road between them. We say that a [i]path from $X$ to $Y$[/i] is a sequence of roads such that one can move from $X$ to $Y$ along this sequence without returning to an already visited city. A collection of paths is called [i]diverse[/i] if no road belongs to two or more paths in the collection. Let $A$ and $B$ be two distinct cities in Anisotropy. Let $N_{AB}$ denote the maximal number of paths in a diverse collection of paths from $A$ to $B$. Similarly, let $N_{BA}$ denote the maximal number of paths in a diverse collection of paths from $B$ to $A$. Prove that the equality $N_{AB} = N_{BA}$ holds if and only if the number of roads going out from $A$ is the same as the number of roads going out from $B$. [i]Proposed by Warut Suksompong, Thailand[/i]