Find the least positive integer $ a$ such that $ 2001$ divides $ 55^n\plus{}a \cdot 32^n$ for some odd $ n$.

Let numbers $1,2,3,...,2010$ stand in a row at random. Consider row, obtain by next rule: For any number we sum it and it's number in a row (For example for row $( 2,7,4)$ we consider a row $(2+1;7+2;4+3)=(3;9;7)$ ); Proved, that in resulting row we can found two equals numbers, or two numbers, which is differ by $2010$

Each of the numbers in the set $N = \{1, 2, 3, \cdots, n - 1\}$, where $n \geq 3$, is colored with one of two colors, say red or black, so that: [i](i)[/i] $i$ and $n - i$ always receive the same color, and [i](ii)[/i] for some $j \in N$, relatively prime to $n$, $i$ and $|j - i|$ receive the same color for all $i \in N, i \neq j.$ Prove that all numbers in $N$ must receive the same color.

Find all integers $ k$ such that for infinitely many integers $ n \ge 3$ the polynomial \[ P(x) =x^{n+ 1}+ kx^n - 870x^2 + 1945x + 1995\] can be reduced into two polynomials with integer coefficients.

A lattice point in the coordinate plane with origin $O$ is called invisible if the segment $OA$ contains a lattice point other than $O,A$. Let $L$ be a positive integer. Show that there exists a square with side length $L$ and sides parallel to the coordinate axes, such that all points in the square are invisible.

Let $n$  be a positive integer. A row of $n+ 1$ squares is written from left to right, numbered $0, 1, 2, \cdots, n$ Two frogs, named Alphonse and Beryl, begin a race starting at square 0. For each second that passes, Alphonse and Beryl make a jump to the right according to the following rules: if there are at least eight squares to the right of Alphonse, then Alphonse jumps eight squares to the right. Otherwise, Alphonse jumps one square to the right. If there are at least seven squares to the right of Beryl, then Beryl jumps seven squares to the right. Otherwise, Beryl jumps one square to the right. Let A(n) and B(n) respectively denote the number of seconds for Alphonse and Beryl to reach square n. For example, A(40) = 5 and B(40) = 10. (a) Determine an integer n>200 for which $B(n) <A(n)$. (b) Determine the largest integer n for which$ B(n) \le A(n)$.

The expression $\circ \ 1\ \circ \ 2 \ \circ 3 \ \circ \dots \circ \ 2012$ is written on a blackboard. Catherine places a $+$ sign or a $-$ sign into each blank. She then evaluates the expression, and finds the remainder when it is divided by 2012. How many possible values are there for this remainder? [i]Proposed by Aaron Lin[/i]

Find all primes $p$ such that there exist positive integers $q$ and $r$ such that $p \nmid q$, $3 \nmid q$, $p^3 = r^3 - q^2$.

Eleven members of the Middle School Math Club each paid the same amount for a guest speaker to talk about problem solving at their math club meeting. They paid their guest speaker $ \$ \underline{1}$ $ \underline{A}$ $ \underline{2}$. What is the missing digit $A$ of this $3$-digit number? $\textbf{(A) }0\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }3\qquad \textbf{(E) }4$

Let $ S\equal{}\{1,2,\ldots,n\}$. Let $ A$ be a subset of $ S$ such that for $ x,y\in A$, we have $ x\plus{}y\in A$ or $ x\plus{}y\minus{}n\in A$. Show that the number of elements of $ A$ divides $ n$.

If $n$ is a natural number, prove that the number $(n+1)(n+2)\cdots(n+10)$ is not a perfect square.

Let $a_1$ , $\ldots$ , $a_n$ be positive integers and $a$ a positive integer that is greater than $1$ and is divisible by the product $a_1a_2\ldots a_n$. Prove that $a^{n+1}+a-1$ is not divisible by the product $(a+a_1-1)(a+a_2-1)\ldots(a+a_n-1)$.

Let $ n \ge 2009$ be an integer and define the set: \[ S \equal{} \{2^x|7 \le x \le n, x \in \mathbb{N}\}. \] Let $ A$ be a subset of $ S$ and the sum of last three digits of each element of $ A$ is $ 8$. Let $ n(X)$ be the number of elements of $ X$. Prove that \[ \frac {28}{2009} < \frac {n(A)}{n(S)} < \frac {82}{2009}. \]

Let $\{a_n\}$ be a sequence of integers satisfying $(n-1)a_{n+1}=(n+1)a_n-2(n-1) \forall n\ge 1$. If $2000|a_{1999}$, find the smallest $n\ge 2$ such that $2000|a_n$.

Let an odd prime $p$ be a given number satisfying $2^h \neq 1 \pmod{p}$ for all $h < p-1, h \in \mathbb{N}^{*},$ and an even integer $a \in \left(\frac{p}{2},p \right).$ Let us consider the sequence $\{a_n\}^{\infty}_{n=0}$ defined by $a_0 = a$ and $a_{n+1} = p - b_n$ for $n = 0, 1, 2, \ldots$, where $b_n$ is the greatest odd divisor of $a_n.$ Show that $\{a_n\}$ is periodical and find its least positive period.

Given a regular convex $2m$- sided polygon $P$, show that there is a $2m$-sided polygon $\pi$ with the same vertices as $P$ (but in different order) such that $\pi$ has exactly one pair of parallel sides.

Sarah intended to multiply a two-digit number and a three-digit number, but she left out the multiplication sign and simply placed the two-digit number to the left of the three-digit number, thereby forming a five-digit number. This number is exactly nine times the product Sarah should have obtained. What is the sum of the two-digit number and the three-digit number?

For $0 \leq d \leq 9$, we define the numbers \[S_{d}=1+d+d^{2}+\cdots+d^{2006}\]Find the last digit of the number \[S_{0}+S_{1}+\cdots+S_{9}.\]

Let $p$ be a prime and $A = \{a_1, \ldots , a_{p-1} \}$ an arbitrary subset of the set of natural numbers such that none of its elements is divisible by $p$. Let us define a mapping $f$ from $\mathcal P(A)$ (the set of all subsets of $A$) to the set $P = \{0, 1, \ldots, p - 1\}$ in the following way: $(i)$ if $B = \{a_{i_{1}}, \ldots , a_{i_{k}} \} \subset A$ and $\sum_{j=1}^k a_{i_{j}} \equiv n \pmod p$, then $f(B) = n,$ $(ii)$ $f(\emptyset) = 0$, $\emptyset$ being the empty set. Prove that for each $n \in P$ there exists $B \subset A$ such that $f(B) = n.$

Let $a_1,a_2,a_3,\ldots$ be a sequence of integers, with the property that every consecutive group of $a_i$'s averages to a perfect square. More precisely, for every positive integers $n$ and $k$, the quantity \[\frac{a_n+a_{n+1}+\cdots+a_{n+k-1}}{k}\] is always the square of an integer. Prove that the sequence must be constant (all $a_i$ are equal to the same perfect square). [i]Evan O'Dorney and Victor Wang[/i]

A lattice point in the coordinate plane with origin $O$ is called invisible if the segment $OA$ contains a lattice point other than $O,A$. Let $L$ be a positive integer. Show that there exists a square with side length $L$ and sides parallel to the coordinate axes, such that all points in the square are invisible.

The first two terms of a sequence are $ a_1 \equal{} 1$ and $ a_2 \equal{} \frac {1}{\sqrt3}$. For $ n\ge1$, \[ a_{n \plus{} 2} \equal{} \frac {a_n \plus{} a_{n \plus{} 1}}{1 \minus{} a_na_{n \plus{} 1}}. \]What is $ |a_{2009}|$? $ \textbf{(A)}\ 0\qquad \textbf{(B)}\ 2 \minus{} \sqrt3\qquad \textbf{(C)}\ \frac {1}{\sqrt3}\qquad \textbf{(D)}\ 1\qquad \textbf{(E)}\ 2 \plus{} \sqrt3$

Let $p=2^{16}+1$ be a prime. A sequence of $2^{16}$ positive integers $\{a_n\}$ is [i]monotonically bounded[/i] if $1\leq a_i\leq i$ for all $1\leq i\leq 2^{16}$. We say that a term $a_k$ in the sequence with $2\leq k\leq 2^{16}-1$ is a [i]mountain[/i] if $a_k$ is greater than both $a_{k-1}$ and $a_{k+1}$. Evan writes out all possible monotonically bounded sequences. Let $N$ be the total number of mountain terms over all such sequences he writes. Find the remainder when $N$ is divided by $p$. [i]Proposed by Michael Ren[/i]

Determine all positive integers $n\ge 2$ satisfying $i+j\equiv\binom ni +\binom nj \pmod{2}$ for all $i$ and $j$ with $0\le i\le j\le n$.

Determine whether $712! + 1$ is a prime number.