Let $n>2$ be a positive integer and let $p$ be a prime. Suppose that the nonzero integers are colored in $n$ colors. Let $a_1,a_2,\ldots,a_{n}$ be integers such that for all $1\le i\le n$, $p^i\nmid a_i$ and $p^{i-1}\mid a_i$. In terms of $n$, $p$, and $\{a_i\}_{i=1}^{n}$, determine if there must exist integers $x_1,x_2,\ldots,x_{n}$ of the same color such that $a_1x_1+a_2x_2+\cdots+a_{n}x_{n}=0$. [i]Ravi Jagadeesan.[/i]

Find the smallest nonnegative integer $n$ for which $\binom{2006}{n}$ is divisible by $7^3$.

Prove that $n^3-n-3$ is not a perfect square for any integer $n$. [i]Calvin Deng.[/i]

A diabolical combination lock has $n$ dials (each with $c$ possible states), where $n,c>1$. The dials are initially set to states $d_1, d_2, \ldots, d_n$, where $0\le d_i\le c-1$ for each $1\le i\le n$. Unfortunately, the actual states of the dials (the $d_i$'s) are concealed, and the initial settings of the dials are also unknown. On a given turn, one may advance each dial by an integer amount $c_i$ ($0\le c_i\le c-1$), so that every dial is now in a state $d_i '\equiv d_i+c_i \pmod{c}$ with $0\le d_i ' \le c-1$. After each turn, the lock opens if and only if all of the dials are set to the zero state; otherwise, the lock selects a random integer $k$ and cyclically shifts the $d_i$'s by $k$ (so that for every $i$, $d_i$ is replaced by $d_{i-k}$, where indices are taken modulo $n$). Show that the lock can always be opened, regardless of the choices of the initial configuration and the choices of $k$ (which may vary from turn to turn), if and only if $n$ and $c$ are powers of the same prime. [i]Bobby Shen.[/i]

For every positive integer $ n$ let \[ a_n\equal{}\sum_{k\equal{}n}^{2n}\frac{(2k\plus{}1)^n}{k}\] Show that there exists no $ n$, for which $ a_n$ is a non-negative integer.

Does there exist a finite set $A$ of positive integers of at least two elements and an infinite set $B$ of positive integers, such that any two distinct elements in $A+B$ are coprime, and for any coprime positive integers $m,n$, there exists an element $x$ in $A+B$ satisfying $x\equiv n \pmod m$ ? Here $A+B=\{a+b|a\in A, b\in B\}$.

Find all $ 3$-digit numbers such that placing to the right side of the number its successor we get a $ 6$-digit number which is a perfect square.

Find all integer solutions $(x,y)$ of the equation $y^2=x^3-p^2x,$ where $p$ is a prime such that $p\equiv 3 \mod 4.$

Let $a$ be an odd integer. Prove that $a^{2^m}+2^{2^m}$ and $a^{2^n}+2^{2^n}$ are relatively prime for all positive integers $n$ and $m$ with $n\not= m$.

Let $ N$ be a positive integer. How many non-negative integers $ n \le N$ are there that have an integer multiple, that only uses the digits $ 2$ and $ 6$ in decimal representation?

Let $ a$ be a fix natural number . Prove that the set of prime divisors of $ 2^{2^{n}} \plus{} a$ for $ n \equal{} 1,2,\cdots$ is infinite

Prove that for every given positive integer $k$, there exist infinitely many $n$, such that $2^{n}+3^{n}-1, 2^{n}+3^{n}-2,\ldots, 2^{n}+3^{n}-k$ are all composite numbers.

$ 1 \le n \le 455$ and $ n^3 \equiv 1 \pmod {455}$. The number of solutions is ? $\textbf{(A)}\ 9 \qquad\textbf{(B)}\ 6 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 1 \qquad\textbf{(E)}\ \text{None}$

Show that there exists $n>2$ such that $1991 | 1999 \ldots 91$ (with $n$ 9's).

Let $ \{X_n\}$ and $ \{Y_n\}$ denote two sequences of integers defined as follows: \begin{align*} X_0 \equal{} 1,\ X_1 \equal{} 1,\ X_{n \plus{} 1} \equal{} X_n \plus{} 2X_{n \minus{} 1} \quad (n \equal{} 1,2,3,\ldots), \\ Y_0 \equal{} 1,\ Y_1 \equal{} 7,\ Y_{n \plus{} 1} \equal{} 2Y_n \plus{} 3Y_{n \minus{} 1} \quad (n \equal{} 1,2,3,\ldots).\end{align*} Prove that, except for the "1", there is no term which occurs in both sequences.

In the sequence of numbers 1, 3, 2, ... each term after the first two is equal to the term preceding it minus the term preceding that. The sum of the first one hundred terms of the sequence is $ \textbf{(A)}\ 5 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 1 \qquad \textbf{(E)}\ \minus{}1$

Bunbury the bunny is hopping on the positive integers. First, he is told a positive integer $n$. Then Bunbury chooses positive integers $a,d$ and hops on all of the spaces $a,a+d,a+2d,\dots,a+2013d$. However, Bunbury must make these choices so that the number of every space that he hops on is less than $n$ and relatively prime to $n$. A positive integer $n$ is called [i]bunny-unfriendly[/i] if, when given that $n$, Bunbury is unable to find positive integers $a,d$ that allow him to perform the hops he wants. Find the maximum bunny-unfriendly integer, or prove that no such maximum exists.

Find all all positive integers x,y,and z satisfying the equation $x^3=3^y7^z+8$

The cells of a square $2011 \times 2011$ array are labelled with the integers $1,2,\ldots, 2011^2$, in such a way that every label is used exactly once. We then identify the left-hand and right-hand edges, and then the top and bottom, in the normal way to form a torus (the surface of a doughnut). Determine the largest positive integer $M$ such that, no matter which labelling we choose, there exist two neighbouring cells with the difference of their labels at least $M$. (Cells with coordinates $(x,y)$ and $(x',y')$ are considered to be neighbours if $x=x'$ and $y-y'\equiv\pm1\pmod{2011}$, or if $y=y'$ and $x-x'\equiv\pm1\pmod{2011}$.) [i](Romania) Dan Schwarz[/i]

Let $a_1,\ldots a_{11}$ be distinct positive integers, all at least $2$ and with sum $407$. Does there exist an integer $n$ such that the sum of the $22$ remainders after the division of $n$ by $a_1,a_2,\ldots ,a_{11},4a_1,4a_2,\ldots ,4a_{11}$ is $2012$?

When $4444^{4444}$ is written in decimal notation, the sum of its digits is $ A.$ Let $B$ be the sum of the digits of $A.$ Find the sum of the digits of $ B.$ ($A$ and $B$ are written in decimal notation.)

Show that the equation $x^2 + y^2 + z^2 = ( x-y)(y-z)(z-x)$ has infintely many solutions in integers $x,y,z$.

On a $999\times 999$ board a [i]limp rook[/i] can move in the following way: From any square it can move to any of its adjacent squares, i.e. a square having a common side with it, and every move must be a turn, i.e. the directions of any two consecutive moves must be perpendicular. A [i]non-intersecting route[/i] of the limp rook consists of a sequence of pairwise different squares that the limp rook can visit in that order by an admissible sequence of moves. Such a non-intersecting route is called [i]cyclic[/i], if the limp rook can, after reaching the last square of the route, move directly to the first square of the route and start over. How many squares does the longest possible cyclic, non-intersecting route of a limp rook visit? [i]Proposed by Nikolay Beluhov, Bulgaria[/i]

Let $ n$ and $ k$ be positive integers such as either $ n$ is odd or both $ n$ and $ k$ are even. Prove that exists integers $ a$ and $ b$ such as $ GCD(a,n) \equal{} GCD(b,n) \equal{} 1$ and $ k \equal{} a \plus{} b$

Show that there do not exist positive integers $m$ and $n$ such that \[ \dfrac{m}{n} + \dfrac{n+1}{m} = 4 . \]