Show that each integer $n$ can be written as the sum of five perfect cubes (not necessarily positive).

Let $ n$ be an odd positive integer. Prove that $((n-1)^n+1)^2$ divides $ n(n-1)^{(n-1)^n+1}+n$.

Let $ k\equal{}2008^2\plus{}2^{2008}$. What is the units digit of $ k^2\plus{}2^k$? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 8$

Let $ a_1$, $ a_2$, $ \ldots$, $ a_n$ be distinct positive integers, $ n\ge 3$. Prove that there exist distinct indices $ i$ and $ j$ such that $ a_i \plus{} a_j$ does not divide any of the numbers $ 3a_1$, $ 3a_2$, $ \ldots$, $ 3a_n$. [i]Proposed by Mohsen Jamaali, Iran[/i]

For which value of $A$, does the equation $3m^2n = n^3 + A$ have a solution in natural numbers? $ \textbf{(A)}\ 301 \qquad\textbf{(B)}\ 403 \qquad\textbf{(C)}\ 415 \qquad\textbf{(D)}\ 427 \qquad\textbf{(E)}\ 481 $

Let $a$ and $b$ be rational numbers such that $s=a+b=a^2+b^2$. Prove that $s$ can be written as a fraction where the denominator is relatively prime to $6$.

Prove that there does not exist an integer $n>1$ such that $n$ divides $3^n-2^n$.

A magician asked a spectator to think of a three-digit number $ \overline{abc}$ and then to tell him the sum of numbers $ \overline{acb}$, $ \overline{bac}$, $ \overline{bca}$, $ \overline{cab}$, and $ \overline{cba}$. He claims that when he knows this sum he can determine the original number. Is that so?

Find all nonnegative integer numbers such that $7^x- 2 \cdot 5^y = -1$

Suppose $S= \{1,2,\dots,n\}$ and $n \geq 3$. There is $f:S^k \longmapsto S$ that if $a,b \in S^k$ and $a$ and $b$ differ in all of elements then $f(a) \neq f(b)$. Prove that $f$ is a function of one of its elements.

What is the smallest positive integer $n$ such that $2013^n$ ends in $001$ (i.e. the rightmost three digits of $2013^n$ are $001$?

Let $\mathbb{Z^+}$ and $\mathbb{P}$ denote the set of positive integers and the set of prime numbers, respectively. A set $A$ is called $S-\text{proper}$ where $A, S \subset \mathbb{Z^+}$ if there exists a positive integer $N$ such that for all $a \in A$ and for all $0 \leq b <a$ there exist $s_1, s_2, \ldots, s_n \in S$ satisfying $ b \equiv s_1+s_2+\cdots+s_n \pmod a$ and $1 \leq n \leq N.$ Find a subset $S$ of $\mathbb{Z^+}$ for which $\mathbb{P}$ is $S-\text{proper}$ but $\mathbb{Z^+}$ is not.

For a positive integer $n$ define a sequence of zeros and ones to be [i]balanced[/i] if it contains $n$ zeros and $n$ ones. Two balanced sequences $a$ and $b$ are [i]neighbors[/i] if you can move one of the $2n$ symbols of $a$ to another position to form $b$. For instance, when $n = 4$, the balanced sequences $01101001$ and $00110101$ are neighbors because the third (or fourth) zero in the first sequence can be moved to the first or second position to form the second sequence. Prove that there is a set $S$ of at most $\frac{1}{n+1} \binom{2n}{n}$ balanced sequences such that every balanced sequence is equal to or is a neighbor of at least one sequence in $S$.

Determine all integers $ n > 1$ such that \[ \frac {2^n \plus{} 1}{n^2} \] is an integer.

We are given a positive integer $ r$ and a rectangular board $ ABCD$ with dimensions $ AB \equal{} 20, BC \equal{} 12$. The rectangle is divided into a grid of $ 20 \times 12$ unit squares. The following moves are permitted on the board: one can move from one square to another only if the distance between the centers of the two squares is $ \sqrt {r}$. The task is to find a sequence of moves leading from the square with $ A$ as a vertex to the square with $ B$ as a vertex. (a) Show that the task cannot be done if $ r$ is divisible by 2 or 3. (b) Prove that the task is possible when $ r \equal{} 73$. (c) Can the task be done when $ r \equal{} 97$?

Find the first two values of $40!(\text{mod }1763)$ [hide=Answer]1311, 3074[\hide]

The Binomial Expansion is valid for exponents that are not integers. That is, for all real numbers $ x, y,$ and $ r$ with $ |x| > |y|,$ \[ (x \plus{} y)^r \equal{} x^r \plus{} rx^{r \minus{} 1}y \plus{} \frac {r(r \minus{} 1)}2x^{r \minus{} 2}y^2 \plus{} \frac {r(r \minus{} 1)(r \minus{} 2)}{3!}x^{r \minus{} 3}y^3 \plus{} \cdots \] What are the first three digits to the right of the decimal point in the decimal representation of $ \left(10^{2002} \plus{} 1\right)^{10/7}?$

Let $ n$ be a positive integer and $ a_{1}, \ldots, a_{n}$ be arbitrary integers. Suppose that a function $ f: \mathbb{Z}\to \mathbb{R}$ satisfies $ \sum_{i=1}^{n}f(k+a_{i}l) = 0$ whenever $ k$ and $ l$ are integers and $ l \ne 0$. Prove that $ f = 0$.

Find all triplets of primes in the form $ (p, 2p\plus{}1, 4p\plus{}1)$.

Find all ordered triples of primes $(p, q, r)$ such that \[ p \mid q^r + 1, \quad q \mid r^p + 1, \quad r \mid p^q + 1. \] [i]Reid Barton[/i]

A $100 \times 100$ table is given. At the beginning, every unit square has number $"0"$ written in them. Two players playing a game and the game stops after $200$ steps (each player plays $100$ steps). In every step, one can choose a row or a column and add $1$ to the written number in all of it's squares $\pmod 3.$ First player is the winner if more than half of the squares ($5000$ squares) have the number $"1"$ written in them, Second player is the winner if more than half of the squares ($5000$ squares) have the number $"0"$ written in them. Otherwise, the game is draw. Assume that both players play at their best. What will be the result of the game ? [i]Proposed by Mahyar Sefidgaran[/i]

Let $ p$ be a prime number and let $ a_1,a_2,\ldots,a_{p \minus{} 2}$ be positive integers such that $ p$ doesn't $ a_k$ or $ {a_k}^k \minus{} 1$ for any $ k$. Prove that the product of some of the $ a_i$'s is congruent to $ 2$ modulo $ p$.

Prove that for each prime number $p$ and positive integer $n$, $p^n$ divides \[\binom{p^n}{p}-p^{n-1}. \]

How many interger tuples $(x,y,z)$ are there satisfying $0\leq x,y,z < 2011$, $xy+yz+zx \equiv 0 \pmod{2011}$, and $x+y+z \equiv 0 \pmod{2011}$ ? $\textbf{(A)}\ 2010 \qquad\textbf{(B)}\ 2011 \qquad\textbf{(C)}\ 2012 \qquad\textbf{(D)}\ 4021 \qquad\textbf{(E)}\ 4023$

Prove that ${d((n^2 +1)}^2)$ does not become monotonic from any given point onwards.