How many integers $n$ with $0\leq n < 840$ are there such that $840$ divides $n^8-n^4+n-1$? $ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 6 \qquad\textbf{(E)}\ 8 $

Let ${n}$ and $k$ be positive integers. There are given ${n}$ circles in the plane. Every two of them intersect at two distinct points, and all points of intersection they determine are pairwise distinct (i. e. no three circles have a common point). No three circles have a point in common. Each intersection point must be colored with one of $n$ distinct colors so that each color is used at least once and exactly $k$ distinct colors occur on each circle. Find all values of $n\geq 2$ and $k$ for which such a coloring is possible. [i]Proposed by Horst Sewerin, Germany[/i]

Let $n$ be a positive integer. Prove that $n$ is prime if and only if \[{{n-1}\choose k}\equiv (-1)^{k}\pmod{n}\] for all $k \in \{ 0, 1, \cdots, n-1 \}$.

Let $a, b$ be positive integers. Prove that if $a^b + b^a \equiv 3 \pmod{4}$, then either $a+1$ or $b+1$ can't be written as the sum of two integer squares. [i](Proposed by Orestis Lignos, Greece)[/i]

Let $f(x),g(x)$ be two polynomials with integer coefficients. It is known that for infinitely many prime $p$, there exist integer $m_p$ such that $$f(a) \equiv g(a+m_p) \pmod p$$ holds for all $a \in \mathbb{Z}.$ Prove that there exists a rational number $r$ such that $$f(x)=g(x+r).$$

Denote by $S(n)$ the sum of digits of $n$. Given a positive integer $N$, we consider the following process: We take the sum of digits $S(N)$, then take its sum of digits $S(S(N))$, then its sum of digits $S(S(S(N)))$... We continue this until we are left with a one-digit number. We call the number of times we had to activate $S(\cdot)$ the [b]depth[/b] of $N$. For example, the depth of 49 is 2, since $S(49)=13\rightarrow S(13)=4$, and the depth of 45 is 1, since $S(45)=9$. [list=a] [*] Prove that every positive integer $N$ has a finite depth, that is, at some point of the process we get a one-digit number. [*] Define $x(n)$ to be the [u]minimal[/u] positive integer with depth $n$. Find the residue of $x(5776)\mod 6$. [*] Find the residue of $x(5776)-x(5708)\mod 2016$. [/list]

For how many integers $1\leq n\leq 9999$ is there a solution to the congruence \[\phi(n)\equiv 2\,\,\,\pmod{12},\] where $\phi(n)$ is the Euler phi-function?

Let $k\geqslant 2$ be a natural number. Prove that the natural numbers with an even sum of digits give all the possible residues when divided by $k{}$. [i]Proposed by P. Kozlov and I. Bogdanov[/i]

Let $p$ be an odd prime number such that $p\equiv 2\pmod{3}.$ Define a permutation $\pi$ of the residue classes modulo $p$ by $\pi(x)\equiv x^3\pmod{p}.$ Show that $\pi$ is an even permutation if and only if $p\equiv 3\pmod{4}.$

We know $\mathbb Z_{210} \cong \mathbb Z_2 \times \mathbb Z_3 \times \mathbb Z_5 \times \mathbb Z_7$. Moreover,\begin{align*} 53 & \equiv 1 \pmod{2} \\ 53 & \equiv 2 \pmod{3} \\ 53 & \equiv 3 \pmod{5} \\ 53 & \equiv 4 \pmod{7}. \end{align*} Let \[ M = \left( \begin{array}{ccc} 53 & 158 & 53 \\ 23 & 93 & 53 \\ 50 & 170 & 53 \end{array} \right). \] Based on the above, find $\overline{(M \mod{2})(M \mod{3})(M \mod{5})(M \mod{7})}$.

Let $A$ be the largest subset of $\{1,\dots,n\}$ such that for each $x\in A$, $x$ divides at most one other element in $A$. Prove that \[\frac{2n}3\leq |A|\leq \left\lceil \frac{3n}4\right\rceil. \]

Find all the pairs of positive numbers such that the last digit of their sum is 3, their difference is a primer number and their product is a perfect square.

Tanya chose a natural number $X\le100$, and Sasha is trying to guess this number. He can select two natural numbers $M$ and $N$ less than $100$ and ask about $\gcd(X+M,N)$. Show that Sasha can determine Tanya's number with at most seven questions.

Determine the number of positive integers $a$, so that there exist nonnegative integers $x_0,x_1,\ldots,x_{2001}$ which satisfy the equation \[ \displaystyle a^{x_0} = \sum_{i=1}^{2001} a^{x_i} \]

Let $ f$ be a polynomial of degree 2 with integer coefficients. Suppose that $ f(k)$ is divisible by 5 for every integer $ k$. Prove that all coefficients of $ f$ are divisible by 5.

Let $ n$ be a given positive integer. Find the smallest positive integer $ u_n$ such that for any positive integer $ d$, in any $ u_n$ consecutive odd positive integers, the number of them that can be divided by $ d$ is not smaller than the number of odd integers among $ 1, 3, 5, \ldots, 2n \minus{} 1$ that can be divided by $ d$.

Carlos Montado was born on Saturday, November 9, 2002. On what day of the week will Carlos be 706 days old? $ \text{(A)}\ \text{Monday}\qquad\text{(B)}\ \text{Wednesday}\qquad\text{(C)}\ \text{Friday}\qquad\text{(D)}\ \text{Saturday}\qquad\text{(E)}\ \text{Sunday} $

Let $ m, n \geq 1$ be two coprime integers and let also $ s$ an arbitrary integer. Determine the number of subsets $ A$ of $ \{1, 2, ..., m \plus{} n \minus{} 1\}$ such that $ |A| \equal{} m$ and $ \sum_{x \in A} x \equiv s \pmod{n}$.

What is the greatest common divisor of the set of numbers \[\{{16}^{n}+10n-1 \; \vert \; n=1,2,\cdots \}?\]

Suppose that for a prime number $p$ and integers $a,b,c$ the following holds: \[6\mid p+1,\quad p\mid a+b+c,\quad p\mid a^4+b^4+c^4.\] Prove that $p\mid a,b,c$.

There are given integers $a$ and $b$ such that $a$ is different from $0$ and the number $3+ a +b^2$ is divisible by $6a$. Prove that $a$ is negative.

Does there exist a strictly increasing infinite sequence of perfect squares $a_1, a_2, a_3, ...$ such that for all $k\in \mathbb{Z}^+$ we have that $13^k | a_k+1$? [i]Proposed by Jesse Zhang[/i]

Find all positive integers $ n$ such that there exists sequence consisting of $ 1$ and $ - 1: a_{1},a_{2},\cdots,a_{n}$ satisfying $ a_{1}\cdot1^2 + a_{2}\cdot2^2 + \cdots + a_{n}\cdot n^2 = 0.$

Find all positive integers $ n$ such that there exists a unique integer $ a$ such that $ 0\leq a < n!$ with the following property: \[ n!\mid a^n \plus{} 1 \] [i]Proposed by Carlos Caicedo, Colombia[/i]

Let $p$ be a prime, $n$ be a positive integer, and let $\mathbb{Z}_{p^n}$ denote the set of congruence classes modulo $p^n.$ Determine the number of functions $f: \mathbb{Z}_{p^n} \to \mathbb{Z}_{p^n}$ satisfying the condition \[ f(a)+f(b) \equiv f(a+b+pab) \pmod{p^n} \] for all $a,b \in \mathbb{Z}_{p^n}.$