A sequence of integers $a_1,a_2,\ldots $ is defined by $a_1=1,a_2=2$ and for $n\geq 1$, $$a_{n+2}=\left\{\begin{array}{cl}5a_{n+1}-3a_{n}, &\text{if}\ a_n\cdot a_{n+1}\ \text{is even},\\ a_{n+1}-a_{n}, &\text{if}\ a_n\cdot a_{n+1}\ \text{is odd},\end{array}\right. $$ (a) Prove that the sequence contains infinitely many positive terms and infinitely many negative terms. (b) Prove that no term of the sequence is zero. (c) Show that if $n = 2^k - 1$ for $k\geq 2$, then $a_n$ is divisible by $7$.

A group of $ 12 $ pirates agree to divide a treasure chest of gold coins among themselves as follows. The $ k^\text{th} $ pirate to take a share takes $ \frac{k}{12} $ of the coins that remain in the chest. The number of coins initially in the chest is the smallest number for which this arrangement will allow each pirate to receive a positive whole number of coins. How many coins does the $ 12^{\text{th}} $ pirate receive? $ \textbf{(A)} \ 720 \qquad \textbf{(B)} \ 1296 \qquad \textbf{(C)} \ 1728 \qquad \textbf{(D)} \ 1925 \qquad \textbf{(E)} \ 3850 $

Let $p > 10$ be prime. Prove that there are positive integers $m$ and $n$ with $m + n < p$ exist for which $p$ is a divisor of $5^m7^n-1$.

[b]a.)[/b] For which $n>2$ is there a set of $n$ consecutive positive integers such that the largest number in the set is a divisor of the least common multiple of the remaining $n-1$ numbers? [b]b.)[/b] For which $n>2$ is there exactly one set having this property?

Let $A=\{a^3+b^3+c^3-3abc|a,b,c\in\mathbb{N}\}$, $B=\{(a+b-c)(b+c-a)(c+a-b)|a,b,c\in\mathbb{N}\}$, $P=\{n|n\in A\cap B,1\le n\le 2016\}$, find the value of $|P|$.

Let $\Gamma_1$ and $\Gamma_2$ be circles in the plane with centers $O_1$ and $O_2$ and radii $13$ and $10$, respectively. Assume $O_1O_2=2$. Fix a circle $\Omega$ with radius $2$, internally tangent to $\Gamma_1$ at $P$ and externally tangent to $\Gamma_2$ at $Q$ . Let $\omega$ be a second variable circle internally tangent to $\Gamma_1$ at $X$ and externally tangent to $\Gamma_2$ at $Y$. Line $PQ$ meets $\Gamma_2$ again at $R$, line $XY$ meets $\Gamma_2$ again at $Z$, and lines $PZ$ and $XR$ meet at $M$. As $\omega$ varies, the locus of point $M$ encloses a region of area $\tfrac{p}{q} \pi$, where $p$ and $q$ are relatively prime positive integers. Compute $p+q$. [i]Proposed by Michael Kural[/i]

Let $x_{n + 1} = 4x_n - x_{n - 1}$, $x_0 = 0$, $x_1 = 1$, and $y_{n + 1} = 4y_n - y_{n - 1}$, $y_0 = 1$, $y_1 = 2$. Show that for all $n \ge 0$ that $y_n^2 = 3x_n^2 + 1$.

Find all functions $f : Z \to Z$ satisfying $\bullet$ $ f(p) > 0$ for all prime numbers $p$, $\bullet$ $p| (f(x) + f(p))^{f(p)}- x$ for all $x \in Z$ and all prime numbers $p$.

Let $n$ and $k$ be natural numbers and $p$ a prime number. Prove that if $k$ is the exact exponent of $p$ in $2^{2^n}+1$ (i.e. $p^k$ divides $2^{2^n}+1$, but $p^{k+1}$ does not), then $k$ is also the exact exponent of $p$ in $2^{p-1}-1$.

For integers $x$, $y$, and $z$, we have $(x-y)(y-z)(z-x)=x+y+z$. Prove that $27|x+y+z$.

What is the last digit of $777^{777}$?

Are there three integers $x,y,z$, such that $x^2 + y^3 = z^4$?

Let $p$ be a prime and $k$ be a positive integer. Set $S$ contains all positive integers $a$ satisfying $1\le a \le p-1$, and there exists positive integer $x$ such that $x^k\equiv a \pmod p$. Suppose that $3\le |S| \le p-2$. Prove that the elements of $S$, when arranged in increasing order, does not form an arithmetic progression.

In how many ways can you divide the set of eight numbers $\{2,3,\cdots,9\}$ into $4$ pairs such that no pair of numbers has $\text{gcd}$ equal to $2$?

Let $S(n)$ be the sum of all different natural divisors of odd natural number $n> 1$ (including $n$ and $1$). Prove that $(S(n))^3 <n^4$.

Let $n$ be an odd positive integer greater than $2$, and consider a regular $n$-gon $\mathcal{G}$ in the plane centered at the origin. Let a [i]subpolygon[/i] $\mathcal{G}'$ be a polygon with at least $3$ vertices whose vertex set is a subset of that of $\mathcal{G}$. Say $\mathcal{G}'$ is [i]well-centered[/i] if its centroid is the origin. Also, say $\mathcal{G}'$ is [i]decomposable[/i] if its vertex set can be written as the disjoint union of regular polygons with at least $3$ vertices. Show that all well-centered subpolygons are decomposable if and only if $n$ has at most two distinct prime divisors.

Let $n \geq 2$ be an integer. Define $x_i =1$ or $-1$ for every $i=1,2,3,\cdots, n$. Call an operation [i]adhesion[/i], if it changes the string $(x_1,x_2,\cdots,x_n)$ to $(x_1x_2, x_2x_3, \cdots ,x_{n-1}x_n, x_nx_1)$ . Find all integers $n \geq 2$ such that the string $(x_1,x_2,\cdots, x_n)$ changes to $(1,1,\cdots,1)$ after finitely [i]adhesion[/i] operations.

Find all $ a, b, c \in \mathbb{Z} $, $ c \ge 0 $ such that $ a^n + 2^n | b^n + c $ for all positive integers $ n $ where $ 2ab $ is non-square.

Metadieu, Tercieu and Quartieu are three bodybuilder warriors who fight against an $n$-headed monster. Each of them can attack the monster according to the following rules: (1) Metadieu's attack consists of cutting off half of the monster's heads, then cutting off one more head. If the monster's number of heads is odd, Metadieu cannot attack; (2) Tercieu's attack consists of cutting off a third of the monster's heads, then cutting off two more heads. If the monster's number of heads is not a multiple of 3, Tercieu cannot attack; (3) Quartieu's attack consists of cutting off a quarter of the monster's heads, then cutting off three more heads. If the monster's number of heads is not a multiple of 4, Quartieu cannot attack; If none of the three warriors can attack the monster at some point, then it will devour our three heroes. The objective of the three warriors is to defeat the monster, and for that they need to cut off all its heads, one warrior attacking at a time. For what positive integer values of $n$ is it possible for the three warriors to combine a sequence of attacks in order to defeat the monster?

A positive integer is written on the board. Every minute Maxim adds to the number on the board one of its positive divisors, writes the result on the board and erases the previous number. However, it is forbidden for him to add the same number twice in a row. Prove that he can proceed in such a way that eventually a perfect square will appear on the board.

Prove there aren't positive integers $a, b, c, d$ forming an arithmetic progression such that $ ab + 1, ac + 1, ad + 1, bc + 1, bd + 1, cd + 1 $ are all perfect squares.

The repeating decimal $0.328181818181...$ can equivalently be expressed as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

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.

Prove that $5^n$ has a block of $1976$ consecutive $0's$ in its decimal representation.

Find all pairs of primes $(p, q)$ such that $$p^3 - q^5 = (p + q)^2.$$