Let $f(x_{1}, x_{2}, . . . , x_{n})$ be a polynomial with integer coefficients of degree less than $n$. Prove that if $N$ is the number of $n$-tuples $(x_{1}, . . . , x_{n})$ with $0 \leq x_{i} < 13$ and $f(x_{1}, . . . , x_{n}) = 0 (mod 13)$, then $N$ is divisible by 13.

Let $Q(x)$ be a cubic polynomial with integer coefficients. Suppose that a prime $p$ divides $Q(x_j)$ for $j = 1$ ,$2$ ,$3$ ,$4$ , where $x_1 , x_2 , x_3 , x_4$ are distinct integers from the set $\{0,1,\cdots, p-1\}$. Prove that $p$ divides all the coefficients of $Q(x)$.

Find all polynomials $f(x)$ with integer coefficients such that the coefficients of both $f(x)$ and $[f(x)]^3$ lie in the set $\{0,1, -1\}$.

Find all positive integers $d$ with the following property: there exists a polynomial $P$ of degree $d$ with integer coefficients such that $\left|P(m)\right|=1$ for at least $d+1$ different integers $m$.

Find all rational solutions of \[a^2 + c^2 + 17(b^2 + d^2) = 21,\]\[ab + cd = 2.\]

Find the range of $ f(A)=\frac{\sin A(3\cos^{2}A+\cos^{4}A+3\sin^{2}A+\sin^{2}A\cos^{2}A)}{\tan A (\sec A-\sin A\tan A)} $ if $A\neq \dfrac{n\pi}{2}$.

Let $P(x)$ be a polynomial with real coefficients so that equation $P(m) + P(n) = 0$ has infinitely many pairs of integer solutions $(m,n)$. Prove that graph of $y = P(x)$ has a center of symmetry.

The polynomial $f(x) = x^3 + rx^2 + sx + t$ has $r, s$, and $t$ as its roots (with multiplicity), where $f(1)$ is rational and $ t \ne 0$. Compute $|f(0)|$.

Monic quadratic polynomials $ P(x)$ and $ Q(x)$ have the property that $ P(Q(x))$ has zeroes at $ x\equal{}\minus{}23,\minus{}21,\minus{}17, \text{and} \minus{}15$, and $ Q(P(x))$ has zeroes at $ x\equal{}\minus{}59, \minus{}57, \minus{}51, \text{and} \minus{}49$. What is the sum of the minimum values of $ P(x)$ and $ Q(x)$? $ \textbf{(A)}\ \text{\minus{}100} \qquad \textbf{(B)}\ \text{\minus{}82} \qquad \textbf{(C)}\ \text{\minus{}73} \qquad \textbf{(D)}\ \text{\minus{}64} \qquad \textbf{(E)}\ 0$

Let $ p(x) \equal{} x^6 \plus{} ax^5 \plus{} bx^4 \plus{} cx^3 \plus{} dx^2 \plus{} ex \plus{} f$ be a polynomial such that $ p(1) \equal{} 1, p(2) \equal{} 2, p(3) \equal{} 3, p(4) \equal{} 4, p(5) \equal{} 5,$ and $ p(6) \equal{} 6.$ What is $ p(7)$? A. 0 B. 7 C. 14 D. 49 E. 727

We define the [i]Fibonacci sequence[/i] $\{F_n\}_{n\ge0}$ by $F_0=0$, $F_1=1$, and for $n\ge2$, $F_n=F_{n-1}+F_{n-2}$; we define the [i]Stirling number of the second kind[/i] $S(n,k)$ as the number of ways to partition a set of $n\ge1$ distinguishable elements into $k\ge1$ indistinguishable nonempty subsets. For every positive integer $n$, let $t_n = \sum_{k=1}^{n} S(n,k) F_k$. Let $p\ge7$ be a prime. Prove that \[ t_{n+p^{2p}-1} \equiv t_n \pmod{p} \] for all $n\ge1$. [i]Proposed by Victor Wang[/i]

Let $ a$, $ b$, $ c$ be three integers. Prove that there exist six integers $ x$, $ y$, $ z$, $ x^{\prime}$, $ y^{\prime}$, $ z^{\prime}$ such that $ a\equal{}yz^{\prime}\minus{}zy^{\prime};\ \ \ \ \ \ \ \ \ \ b\equal{}zx^{\prime}\minus{}xz^{\prime};\ \ \ \ \ \ \ \ \ \ c\equal{}xy^{\prime}\minus{}yx^{\prime}$.

We say that a set $S$ of integers is [i]rootiful[/i] if, for any positive integer $n$ and any $a_0, a_1, \cdots, a_n \in S$, all integer roots of the polynomial $a_0+a_1x+\cdots+a_nx^n$ are also in $S$. Find all rootiful sets of integers that contain all numbers of the form $2^a - 2^b$ for positive integers $a$ and $b$.

Let $n > 1$ be an integer. In a circular arrangement of $n$ lamps $L_0, \ldots, L_{n-1},$ each of of which can either ON or OFF, we start with the situation where all lamps are ON, and then carry out a sequence of steps, $Step_0, Step_1, \ldots .$ If $L_{j-1}$ ($j$ is taken mod $n$) is ON then $Step_j$ changes the state of $L_j$ (it goes from ON to OFF or from OFF to ON) but does not change the state of any of the other lamps. If $L_{j-1}$ is OFF then $Step_j$ does not change anything at all. Show that: (i) There is a positive integer $M(n)$ such that after $M(n)$ steps all lamps are ON again, (ii) If $n$ has the form $2^k$ then all the lamps are ON after $n^2-1$ steps, (iii) If $n$ has the form $2^k + 1$ then all lamps are ON after $n^2 - n + 1$ steps.