How many ordered four-tuples of integers $(a,b,c,d)$ with $0 < a < b < c < d < 500$ satisfy $a + d = b + c$ and $bc - ad = 93$?

Find all polynomials $P(x)$ with real coefficients that satisfy \[P(x\sqrt{2})=P(x+\sqrt{1-x^2})\]for all real $x$ with $|x|\le 1$.

Determine all pairs of polynomials $f$ and $g$ with real coefficients such that \[ x^2 \cdot g(x) = f(g(x)). \]

Find all rational numbers $k$ such that $0 \le k \le \frac{1}{2}$ and $\cos k \pi$ is rational.

For all positive numbers $x,y,z$ the product $(x+y+z)^{-1}(x^{-1}+y^{-1}+z^{-1})(xy+yz+xz)^{-1}[(xy)^{-1}+(yz)^{-1}+(xz)^{-1}]$ equals $\text{(A)}\ x^{-2}y^{-2}z^{-2} \qquad \text{(B)}\ x^{-2}+y^{-2}+z^{-2} \qquad \text{(C)}\ (x+y+z)^{-1}$ $\text{(D)}\ \frac{1}{xyz} \qquad \text{(E)}\ \frac{1}{xy+yz+xz}$

Determine the number of polynomials of degree $ 3 $ that are irreducible over the field of integers modulo a prime.

For any function $f(x)$, define $f^1(x) = f(x)$ and $f^n (x) = f(f^{n-1}(x))$ for any integer $n \ge 2$. Does there exist a quadratic polynomial $f(x)$ such that the equation $f^n(x) = 0$ has exactly $2^n$ distinct real roots for every positive integer $n$? [i](6 points)[/i]

[i](8 pts)[/i] Let $n$ be a positive integer, and let $a, b, c$ be real numbers. (a) [i](2 pts)[/i] Given that $a\cos x+b\cos 2x +c\cos 3x \geq -1$ for all reals $x$, find, with proof, the maximum possible value of $a+b+c$. (b) [i](6 pts)[/i] Let $f$ be a degree $n$ polynomial with real coefficients. Suppose that $|f(z)| \leq \left|f(z)+\frac{2}{z}\right|$ for all complex $z$ lying on the unit circle. Find, with proof, the maximum possible value of $f(1)$.

Find the number of positive integers $m$ for which there exist nonnegative integers $x_0,x_1,\ldots,x_{2011}$ such that \[ m^{x_0}=\sum_{k=1}^{2011}m^{x_k}. \]

Find four distinct positive integers, $a$, $b$, $c$, and $d$, such that each of the four sums $a+b+c$, $a+b+d$,$a+c+d$, and $b+c+d$ is the square of an integer. Show that infinitely many quadruples $(a,b,c,d)$ with this property can be created.

If a polynomial $f(x)$ is divided by $(x-a)^{2} (x-b)$, where $a\ne b$, derive a formula for the remainder.

Let $n=p_1p_2\cdots p_s$, where $p_1,\ldots,p_s$ are distinct odd prime numbers. (a) Prove that the expression $$F_n(x)=\prod\left(x^{\frac n{p_{i_1}\cdots p_{i_k}}}-1\right)^{(-1)^k},$$where the product goes over all subsets $\{p_{i_1},\ldots,p_{i_k}\}$ or $\{p_1,\ldots,p_s\}$ (including itself and the empty set), can be written as a polynomial in $x$ with integer coefficients. (b) Prove that if $p$ is a prime divisor of $F_n(2)$, then either $p\mid n$ or $n\mid p-1$.

Let $n$ be a positive integer. Ilya and Sasha both choose a pair of different polynomials of degree $n$ with real coefficients. Lenya knows $n$, his goal is to find out whether Ilya and Sasha have the same pair of polynomials. Lenya selects a set of $k$ real numbers $x_1<x_2<\dots<x_k$ and reports these numbers. Then Ilya fills out a $2 \times k$ table: For each $i=1,2,\dots,k$ he writes a pair of numbers $P(x_i),Q(x_i)$ (in any of the two possible orders) intwo the two cells of the $i$-th column, where $P$ and $Q$ are his polynomials. Sasha fills out a similar table. What is the minimal $k$ such that Lenya can surely achieve the goal by looking at the tables? [i]Proposed by L. Shatunov[/i]

Ali and Naqi are playing a game. At first, they have Polynomial $P(x) = 1+x^{1398}$. Naqi starts. In each turn one can choice natural number $k \in [0,1398]$ in his trun, and add $x^k$ to the polynomial. For example after 2 moves $P$ can be : $P(x) = x^{1398} + x^{300} + x^{100} +1$. If after Ali's turn, there exist $t \in R$ such that $P(t)<0$ then Ali loses the game. Prove that Ali can play forever somehow he never loses the game!

For each positive integer $p$, let $b(p)$ denote the unique positive integer $k$ such that $|k-\sqrt{p}|<\frac{1}{2}$. For example, $b(6) = 2$ and $b(23)=5$. If $S = \textstyle\sum_{p=1}^{2007}b(p)$, find the remainder when S is divided by 1000.