For how many primes $ p$, there exits unique integers $ r$ and $ s$ such that for every integer $ x$ $ x^{3} \minus{} x \plus{} 2\equiv \left(x \minus{} r\right)^{2} \left(x \minus{} s\right)\pmod p$? $\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ \text{None}$

Find the total number of solutions to the following system of equations: $ \{\begin{array}{l} a^2 + bc\equiv a \pmod{37} \\ b(a + d)\equiv b \pmod{37} \\ c(a + d)\equiv c \pmod{37} \\ bc + d^2\equiv d \pmod{37} \\ ad - bc\equiv 1 \pmod{37} \end{array}$

Let $x_1, x_2,\cdots, x_n$ be $n$ integers. Let $n = p + q$, where $p$ and $q$ are positive integers. For $i = 1, 2, \cdots, n$, put \[S_i = x_i + x_{i+1} +\cdots + x_{i+p-1} \text{ and } T_i = x_{i+p} + x_{i+p+1} +\cdots + x_{i+n-1}\] (it is assumed that $x_{i+n }= x_i$ for all $i$). Next, let $m(a, b)$ be the number of indices $i$ for which $S_i$ leaves the remainder $a$ and $T_i$ leaves the remainder $b$ on division by $3$, where $a, b \in \{0, 1, 2\}$. Show that $m(1, 2)$ and $m(2, 1)$ leave the same remainder when divided by $3.$

A positive integer $K$ is given. Define the sequence $(a_n)$ by $a_1 = 1$ and $a_n$ is the $n$-th positive integer greater than $a_{n-1}$ which is congruent to $n$ modulo $K$. [b](a)[/b] Find an explicit formula for $a_n$. [b](b)[/b] What is the result if $K = 2$?

Prove that for all positive integers $n$ there exists a single positive integer divisible with $5^n$ which in decimal base is written using $n$ digits from the set $\{1,2,3,4,5\}$.

Three runners start running simultaneously from the same point on a $500$-meter circular track. They each run clockwise around the course maintaining constant speeds of $4.4$, $4.8$, and $5.0$ meters per second. The runners stop once they are all together again somewhere on the circular course. How many seconds do the runners run? $ \textbf{(A)}\ 1,000 \qquad\textbf{(B)}\ 1,250 \qquad\textbf{(C)}\ 2,500 \qquad\textbf{(D)}\ 5,000 \qquad\textbf{(E)}\ 10,000 $

Let $m$ be a positive integer such that $m=2\pmod{4}$. Show that there exists at most one factorization $m=ab$ where $a$ and $b$ are positive integers satisfying \[0<a-b<\sqrt{5+4\sqrt{4m+1}}\]

Find all positive integers $n$ for which the number $1!+2!+3!+\cdots+n!$ is a perfect power of an integer.

There are forty weights: $1, 2, \cdots , 40$ grams. Ten weights with even masses were put on the left pan of a balance. Ten weights with odd masses were put on the right pan of the balance. The left and the right pans are balanced. Prove that one pan contains two weights whose masses differ by exactly $20$ grams. [i](4 points)[/i]

For even positive integer $n$ we put all numbers $1,2,...,n^2$ into the squares of an $n\times n$ chessboard (each number appears once and only once). Let $S_1$ be the sum of the numbers put in the black squares and $S_2$ be the sum of the numbers put in the white squares. Find all $n$ such that we can achieve $\frac{S_1}{S_2}=\frac{39}{64}.$

Let $p$ be a prime satisfying $p^2\mid 2^{p-1}-1$, and let $n$ be a positive integer. Define \[ f(x) = \frac{(x-1)^{p^n}-(x^{p^n}-1)}{p(x-1)}. \] Find the largest positive integer $N$ such that there exist polynomials $g(x)$, $h(x)$ with integer coefficients and an integer $r$ satisfying $f(x) = (x-r)^N g(x) + p \cdot h(x)$. [i]Proposed by Victor Wang[/i]

A polynomial $P$ has integer coefficients and $P(3)=4$ and $P(4)=3$. For how many $x$ we might have $P(x)=x$?

Let $p$ and $a$ be positive integer numbers having no common divisors except of $1$. Prove that $p$ is prime if and only if all the coefficients of the polynomial \[ F(x) = (x-a)^p - (x^p - a) \] are divisible by $p$.

Let $k$ be a positive number and $P$ a Polynomio with integer coeficients. Prove that exists a $n$ positive integer such that: $P(1)+P(2)+\dots+P(N)$ is divisible by $k$.

Seven students count from $1$ to $1000$ as follows: [list] [*]Alice says all the numbers, except she skips the middle number in each consecutive group of three numbers. That is, Alice says $1, 3, 4, 6, 7, 9, \cdots, 997, 999, 1000.$ [*]Barbara says all of the numbers that Alice doesn't say, except she also skips the middle number in each consecutive group of three numbers. [*]Candice says all of the numbers that neither Alice nor Barbara says, except she also skips the middle number in each consecutive group of three numbers. [*]Debbie, Eliza, and Fatima say all of the numbers that none of the students with the first names beginning before theirs in the alphabet say, except each also skips the middle number in each of her consecutive groups of three numbers. [*]Finally, George says the only number that no one else says. [/list] What number does George say? $ \textbf{(A)}\ 37\qquad\textbf{(B)}\ 242\qquad\textbf{(C)}\ 365\qquad\textbf{(D)}\ 728\qquad\textbf{(E)}\ 998 $

Let $n$ be a positive integer, and let $A_{n}$ be the the set of all positive integers $a\le n$ such that $n|a^{n}+1$. a) Find all $n$ such that $A_{n}\neq \emptyset$ b) Find all $n$ such that $|{A_{n}}|$ is even and non-zero. c) Is there $n$ such that $|{A_{n}}| = 130$?

Find all $ (x,y,z) \in \mathbb{Z}^3$ such that $ x^3 \minus{} 5x \equal{} 1728^{y}\cdot 1733^z \minus{} 17$. [i](Paolo Leonetti)[/i]

What is the last digit of $ 17^{1996}$? A. 1 B. 3 C. 5 D. 7 E. 9

Compute the number of positive integers $n < 2012$ that share exactly two positive factors with 2012. [i]Proposed by Aaron Lin[/i]

Determine all positive integers $n$ for which there exists an integer $m$ such that $2^{n}-1$ divides $m^{2}+9$.

The domain of the function $f(x) = \text{arcsin}(\log_{m}(nx))$ is a closed interval of length $\frac{1}{2013}$, where $m$ and $n$ are positive integers and $m > 1$. Find the remainder when the smallest possible sum $m+n$ is divided by $1000$.

Let $ p$ be a prime number. Let $ h(x)$ be a polynomial with integer coefficients such that $ h(0),h(1),\dots, h(p^2\minus{}1)$ are distinct modulo $ p^2.$ Show that $ h(0),h(1),\dots, h(p^3\minus{}1)$ are distinct modulo $ p^3.$

The sequence of natural numbers is defined as follows: for any $ k\geq 1 $,$ a_{k+2}= a_{k+1}\cdot a_k+1 $. Prove that for $ k\geq 9 $ the number $ a_k-22 $ is composite.

Let $a,b,c,d$ be integers such that the number $a-b+c-d$ is odd and it divides the number $a^2-b^2+c^2-d^2$. Show that, for every positive integer $n$, $a-b+c-d$ divides $a^n-b^n+c^n-d^n$.

Let $D$ be the set of all pairs $(i,j)$, $1\le i,j\le n$. Prove there exists a subset $S \subset D$, with $|S|\ge\left \lfloor\frac{3n(n+1)}{5}\right \rfloor$, such that for any $(x_1,y_1), (x_2,y_2) \in S$ we have $(x_1+x_2,y_1+y_2) \not \in S$. (Peter Cameron)