Find all positive integers $ n$ for which the numbers in the set $ S \equal{} \{1,2, \ldots,n \}$ can be colored red and blue, with the following condition being satisfied: The set $ S \times S \times S$ contains exactly $ 2007$ ordered triples $ \left(x, y, z\right)$ such that: [b](i)[/b] the numbers $ x$, $ y$, $ z$ are of the same color, and [b](ii)[/b] the number $ x \plus{} y \plus{} z$ is divisible by $ n$. [i]Author: Gerhard Wöginger, Netherlands[/i]

The equation $z(z+i)(z+3i)=2002i$ has a zero of the form $a+bi$, where $a$ and $b$ are positive real numbers. Find $a$. $\textbf{(A) }\sqrt{118}\qquad\textbf{(B) }\sqrt{210}\qquad\textbf{(C) }2\sqrt{210}\qquad\textbf{(D) }\sqrt{2002}\qquad\textbf{(E) }100\sqrt2$

For each positive integer $n$ let $p(n)$ be the number of ordered pairs $(x,y)$ of positive integers such that$$\dfrac{1}{x}+\dfrac{1}{y} =\dfrac{1}{n}.$$For example, for $n=2$ the pairs are $(3,6),(4,4),(6,3)$. Therefore $p(2)=3$. a) Determine $p(n)$ for all $n$ and calculate $p(1995)$. b) Determine all pairs $n$ such that $p(n)=3$.

A segment of length $1$ is drawn such that its endpoints lie on a unit circle, dividing the circle into two parts. Compute the area of the larger region.

Consider an $8\times 8$ grid of squares. A rook is placed in the lower left corner, and every minute it moves to a square in the same row or column with equal probability (the rook must move; i.e. it cannot stay in the same square). What is the expected number of minutes until the rook reaches the upper right corner?

Let us consider one variable polynomials with the senior coefficient equal to one. We shall say that two polynomials $P(x)$ and $Q(x)$ commute, if $P(Q(x))=Q(P(x))$ (i.e. we obtain the same polynomial, having collected the similar terms). a) For every a find all $Q$ such that the $Q$ degree is not greater than three, and $Q$ commutes with $(x^2 - a)$. b) Let $P$ be a square polynomial, and $k$ is a natural number. Prove that there is not more than one commuting with $P$ $k$-degree polynomial. c) Find the $4$-degree and $8$-degree polynomials commuting with the given square polynomial $P$. d) $R$ and $Q$ commute with the same square polynomial $P$. Prove that $Q$ and $R$ commute. e) Prove that there exists a sequence $P_2, P_3, ... , P_n, ...$ ($P_k$ is $k$-degree polynomial), such that $P_2(x) = x^2 - 2$, and all the polynomials in this infinite sequence pairwise commute.

It is known that a sequence of positive real numbers \(\left(x_n\right)\) satisfies the relation: \[ x_{n+1} = x_n + \sqrt{x_n + \frac{1}{4}} + \sqrt{x_{n+1} + \frac{1}{4}}, \quad n \geq 1 \] Prove that the following inequality holds: \[ \frac{1}{x_2} + \frac{1}{x_3} + \cdots + \frac{1}{x_{2025}} < \frac{1}{\sqrt{x_1}} \] [i]Proposed by Oleksii Masalitin[/i]

Find all functions $f : R \to R$ which satisfy for all $x, y \in R$ the relation $f(f(f(x) + y) + y) = x + y + f(y)$

A $3000\times 3000$ square is tiled by dominoes (i. e. $1\times 2$ rectangles) in an arbitrary way. Show that one can color the dominoes in three colors such that the number of the dominoes of each color is the same, and each dominoe $d$ has at most two neighbours of the same color as $d$. (Two dominoes are said to be [i]neighbours[/i] if a cell of one domino has a common edge with a cell of the other one.)

Pam lists the four smallest positive prime numbers in increasing order. When she divides the positive integer $N$ by the first prime, the remainder is $1$. When she divides $N$ by the second prime, the remainder is $2$. When she divides $N$ by the third prime, the remainder is $3$. When she divides $N$ by the fourth prime, the remainder is $4$. Find the least possible value for $N$.

Let $a=-\sqrt{3}+\sqrt{5}+\sqrt{7}, b=\sqrt{3}-\sqrt{5}+\sqrt{7}, c=\sqrt{3}+\sqrt{5}-\sqrt{7}$. Evaluate \[\frac{a^4}{(a-b)(a-c)}+\frac{b^4}{(b-c)(b-a)}+\frac{c^4}{(c-a)(c-b)}.\]

Last academic year Yolanda and Zelda took different courses that did not necessarily administer the same number of quizzes during each of the two semesters. Yolanda's average on all the quizzes she took during the first semester was 3 points higher than Zelda's average on all the quizzes she took during the first semester. Yolanda's average on all the quizzes she took during the second semester was 18 points higher than her average for the first semester and was again 3 points higher than Zelda's average on all the quizzes Zelda took during her second semester. Which one of the following statements cannot possibly be true? (A) Yolanda's quiz average for the academic year was 22 points higher than Zelda's. (B) Zelda's quiz average for the academic year was higher than Yolanda's. (C) Yolanda's quiz average for the academic year was 3 points higher than Zelda's. (D) Zelda's quiz average for the academic year equaled Yolanda's. (E) If Zelda had scored 3 points higher on each quiz she took, then she would have had the same average for the academic year as Yolanda.

Let $a, b, c $ be the side lengths of a right angled triangle with c > a, b. Show that $$3<\frac{c^3-a^3-b^3}{c(c-a)(c-b)}\leq \sqrt{2}+2.$$

Four balls of radius $1$ are placed in space so that each of them touches the other three. What is the radius of the smallest sphere containing all of them?

Evaluate $\sec'' \frac{\pi}4 +\sec'' \frac{3\pi}4+\sec'' \frac{5\pi}4+\sec'' \frac{7\pi}4$. (Here $\sec''$ means the second derivative of $\sec$).

The circles $ C_1,C_2 $ meet at the points $ A,B. $ A line thru $ A $ intersects $ C_1,C_2 $ at $ C,D, $ respectively. Point $ A $ is not on the arc $ BC $ of $ C_1, $ neither on the arc $ BD $ of $ C_2. $ On the segments $ CD,BC,BD $ there are the points $ M,N,K $ such that $ MN $ is parallel to $ BD $ and $ MK $ is parallel with $ BC. $ Upon the arc $ BC $ let $ E $ be a point having the property that $ EN $ is perpendicular to $ BC, $ and upon the arc $ BD $ let $ F $ be a point chosen so that $ FK $ is perpendicular to $ BD. $ Show that the angle $ \angle EMF $ is right.

Let $a_n=1+n!(\frac{1}{0!}+\frac{1}{1!}+\frac{1}{2!}+...+\frac{1}{n!})$ for any $n\in \mathbb{Z}^{+}$. Consider $a_n$ points in the plane,no $3$ of them collinear.The segments between any $2$ of them are colored in one of $n$ colors. Prove that among them there exist $3$ points forming a monochromatic triangle.

Let $n \ge 2$ and matrices $A,B \in M_n(\mathbb{R})$. There exist $x \in \mathbb{R} \backslash \{0,\frac{1}{2}, 1 \}$, such that $ xAB + (1-x)BA = I_n$. Show that $(AB-BA)^n = O_n$.

Let $a_1,a_2,\cdots,a_6,a_7$ be seven positive integers. Let $S$ be the set of all numbers of the form $a_i^2+a_j^2$ where $1\leq i<j\leq 7$. Prove that there exist two elements of $S$ which have the same remainder on dividing by $36$.

Buses from Dallas to Houston leave every hour on the hour. Buses from Houston to Dallas leave every hour on the half hour. The trip from one city to the other takes $5$ hours. Assuming the buses travel on the same highway, how many Dallas-bound buses does a Houston-bound bus pass in the highway (not in the station)? $\text{(A)}\ 5 \qquad \text{(B)}\ 6 \qquad \text{(C)}\ 9 \qquad \text{(D)}\ 10 \qquad \text{(E)}\ 11$

Let $ABCD$ be a convex cyclic quadrilateral with $AD=BD$. The diagonals $AC$ and $BD$ intersect in $E$. Let the incenter of triangle $\triangle BCE$ be $I$. The circumcircle of triangle $\triangle BIE$ intersects side $AE$ in $N$. Prove \[ AN \cdot NC = CD \cdot BN. \]

Let $ABC$ be an isosceles triangle ($AB=AC$). An arbitrary point $M$ is chosen on the extension of the $BC$ beyond point $B$. Prove that the sum of the radius of the circle inscribed in the triangle $AM​​B$ and the radius of the circle tangent to the side $AC$ and the extensions of the sides $AM, CM$ of the triangle $AMC$ does not depend on the choice of point $M$.

Points $P$ and $Q$ lie on a circle $\omega$. The tangents to $\omega$ at $P$ and $Q$ intersect at point $T$, and point $R$ is chosen on $\omega$ so that $T$ and $R$ lie on opposite sides of $PQ$ and $\angle PQR = \angle PTQ$. Let $RT$ meet $\omega$ for the second time at point $S$. Given that $PQ = 12$ and $TR = 28$, determine $PS$.

Let $n$ be a positive integer and let $a_1, \ldots, a_{n-1} $ be arbitrary real numbers. Define the sequences $u_0, \ldots, u_n $ and $v_0, \ldots, v_n $ inductively by $u_0 = u_1 = v_0 = v_1 = 1$, and $u_{k+1} = u_k + a_k u_{k-1}$, $v_{k+1} = v_k + a_{n-k} v_{k-1}$ for $k=1, \ldots, n-1.$ Prove that $u_n = v_n.$

Let $x_1, x_2, ..., x_{2004}$ be a sequence of integer numbers such that $x_{k+3}=x_{k+2}+x_{k}x_{k+1}$, $\forall 1 \le k \le 2001$. Is it possible that more than half of the elements are negative?