In a football season, even number $n$ of teams plays a simple series, i.e. each team plays once against each other team. Show that ona can group the series into $n-1$ rounds such that in every round every team plays exactly one match.

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.

The greatest integer that will divide $13,511$, $13,903$, and $14,589$ and leave the same remainder is $\textbf{(A) }28\qquad\textbf{(B) }49\qquad\textbf{(C) }98\qquad$ $\textbf{(D) }\text{an odd multiple of }7\text{ greater than }49\qquad \textbf{(E) }\text{an even multiple of }7\text{ greater than }98$

A and B plays the following game: they choose randomly $k$ integers from $\{1,2,\dots,100\}$; if their sum is even, A wins, else B wins. For what values of $k$ does A and B have the same chance of winning?

Find the rightmost non-zero digit of the expansion of $(20)(13!)$.

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]

Find all positive integers $ x$ and $ y$ such that $ 5^{x}-3^{y}= 16$.

Let $x, y$ be positive integers such that $\gcd(x,y)=1$ and $x+3y^2$ is a perfect square. Prove that $x^2+9y^4$ can't be a perfect square.

A positive integer $n$ is called [i]mythical[/i] if every divisor of $n$ is two less than a prime. Find the unique mythical number with the largest number of divisors. [i]Proposed by Evan Chen[/i]

For positive integer $n$ let $a_n$ be the integer consisting of $n$ digits of $9$ followed by the digits $488$. For example, $a_3 = 999,488$ and $a_7 = 9,999,999,488$. Find the value of $n$ so that an is divisible by the highest power of $2$.

Let $ n > 1$ be an integer, and $ n$ can divide $ 2^{\phi(n)} \plus{} 3^{\phi(n)} \plus{} \cdots \plus{} n^{\phi(n)},$ let $ p_{1},p_{2},\cdots,p_{k}$ be all distinct prime divisors of $ n$. Show that $ \frac {1}{p_{1}} \plus{} \frac {1}{p_{2}} \plus{} \cdots \plus{} \frac {1}{p_{k}} \plus{} \frac {1}{p_{1}p_{2}\cdots p_{k}}$ is an integer. ( where $ \phi(n)$ is defined as the number of positive integers $ \leq n$ that are relatively prime to $ n$.)

Let $a_n = 6^n + 8^n$. Determine the remainder on dividing $a_{83}$ by 49.

Let a positive integer $n$ be $\textit{nice}$ if there exists a positive integer $m$ such that \[ n^3 < 5mn < n^3 +100. \] Find the number of [i]nice[/i] positive integers. [i]Proposed by Akshaj[/i]

For a prime $p$, a subset $S$ of residues modulo $p$ is called a [i]sum-free multiplicative subgroup[/i] of $\mathbb F_p$ if $\bullet$ there is a nonzero residue $\alpha$ modulo $p$ such that $S = \left\{ 1, \alpha^1, \alpha^2, \dots \right\}$ (all considered mod $p$), and $\bullet$ there are no $a,b,c \in S$ (not necessarily distinct) such that $a+b \equiv c \pmod p$. Prove that for every integer $N$, there is a prime $p$ and a sum-free multiplicative subgroup $S$ of $\mathbb F_p$ such that $\left\lvert S \right\rvert \ge N$. [i]Proposed by Noga Alon and Jean Bourgain[/i]

Let $a, b, c, d$ be integers. Show that the product \[(a-b)(a-c)(a-d)(b-c)(b-d)(c-d)\] is divisible by $12$.

Let $S$ be a subset of $\{0,1,2,\ldots,98 \}$ with exactly $m\geq 3$ (distinct) elements, such that for any $x,y\in S$ there exists $z\in S$ satisfying $x+y \equiv 2z \pmod{99}$. Determine all possible values of $m$.

Let $(a_n )_{n\ge 1}$ be a sequence of integers that satisfies \[a_n = a_{n-1} -\text{min}(a_{n-2} , a_{n-3} )\] for all $n \ge 4$. Prove that for every positive integer $k$, there is an $n$ such that $a_n$ is divisible by $3^k$ .

Let $k$ and $n$ be positive integers with $n>2$. Show that the equation: \[x^n-y^n=2^k\] has no positive integer solutions.

Let $S(k)$ denote the digit-sum of a positive integer $k$(in base $10$). Determine the smallest positive integer $n$ such that \[S(n^2 ) = S(n) - 7\]

Prove that there exists only one pair $ (p,q) $ of odd primes satisfying the properties that $ p^2\equiv 4\pmod q $ and $ q^2\equiv 1\pmod p. $ [i]Ana Maria Acu[/i]

Find all positive integers $ n\in\{1,2,3,\ldots,2009\}$ such that \[ 4n^6 \plus{} n^3 \plus{} 5\] is divisible by $ 7$.

We define $N$ as the set of natural numbers $n<10^6$ with the following property: There exists an integer exponent $k$ with $1\le k \le 43$, such that $2012|n^k-1$. Find $|N|$.

Prove that none of the numbers $2^{2^n}+ 1$, $n = 0, 1, 2, \dots$ is a perfect cube.

We are given a lattice and two pebbles $A$ and $B$ that are placed at two lattice points. At each step we are allowed to relocate one of the pebbles to another lattice point with the condition that the distance between pebbles is preserved. Is it possible after finite number of steps to switch positions of the pebbles?

Find all pairs of integers $(m,n)$ such that $m^6 = n^{n+1} + n -1$.