Let $k, l, m, n$ be positive integers. Given that $k+l+m+n=km=ln$, find all possible values of $k+l+m+n$.

Find all natural triples $(a,b,c)$, such that: $a - )\,a \le b \le c$ $b - )\,(a,b,c) = 1$ $c - )\,\left. {{a^2}b} \right|{a^3} + {b^3} + {c^3}\,,\,\left. {{b^2}c} \right|{a^3} + {b^3} + {c^3}\,,\,\left. {{c^2}a} \right|{a^3} + {b^3} + {c^3}$.

Determine all pairs $(k, n)$ of positive integers that satisfy $$1! + 2! + ... + k! = 1 + 2 + ... + n.$$

Consider a sequence $(a_k)_{k \ge 1}$ of natural numbers defined as follows: $a_1=a$ and $a_2=b$ with $a,b>1$ and $\gcd(a,b)=1$ and for all $k>0$, $a_{k+2}=a_{k+1}+a_k$. Prove that for all natural numbers $n$ and $k$, $\gcd(a_n,a_{n+k}) <\frac{a_k}{2}$.

Let $a > 2$ be a natural number. Show that there are infinitely many natural numbers n such that $a^n \equiv -1$ (mod $n^2$).

Prove that the equation $x^2 + y^2 - z^2 = 1997$ has infinitely many solutions in integers $x$, $y$ and $z$. (N Vassiliev)

Let $n\geq 2$ be an integer. The permutation $a_1,a_2,..., a_n$ of the numbers $1, 2,...,n$ is called [i]quadratic[/i] if $a_ia_{i +1} + 1$ is a perfect square for all $1\leq i \leq n-1.$ The permutation $a_1,a_2,..., a_n$ of the numbers $1, 2,...,n$ is called [i]cubic[/i] if $a_ia_{i + 1} + 1$ is a perfect cube for all $1\leq i \leq n - 1.$ a) Prove that for infinitely many values of $n$ is there at least one quadratic permutation of the numbers $1, 2,...,n.$ b) Prove that for no value of $n$ is there a cubic permutation of the numbers $1, 2,..., n.$

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

Let $x$ be a real number with the following property: for each positive integer $q$, there exists an integer $p$, such that \[\left|x-\frac{p}{q} \right|<\frac{1}{3q}. \] Prove that $x$ is an integer.

Prove that number $1$ can be represented as a sum of a finite number $n$ of real numbers, less than $1,$ not necessarily distinct, which contain in their decimal representation only the digits $0$ and/or $7.$ Which is the least possible number $n$?

The numbers \( 1, 2, 3, \ldots, 60 \) are written in a row in that exact order. Igor and Ruslan take turns inserting the signs \( +, -, \times \) between them, starting with Igor. Each turn consists of placing one sign. Once all signs are placed, the value of the resulting expression is computed. If the value is divisible by $3$, Igor wins; otherwise, Ruslan wins. Which player has a winning strategy regardless of the opponent’s moves? \\

Benedek wrote the following $300 $ statements on a piece of paper. $2 | 1!$ $3 | 1! \,\,\, 3 | 2!$ $4 | 1! \,\,\, 4 | 2! \,\,\, 4 | 3!$ $5 | 1! \,\,\, 5 | 2! \,\,\, 5 | 3! \,\,\, 5 | 4!$ $...$ $24 | 1! \,\,\, 24 | 2! \,\,\, 24 | 3! \,\,\, 24 | 4! \,\,\, · · · \,\,\, 24 | 23!$ $25 | 1! \,\,\, 25 | 2! \,\,\, 25 | 3! \,\,\, 25 | 4! \,\,\, · · · \,\,\, 25 | 23! \,\,\, 25 | 24!$ How many true statements did Benedek write down? The symbol | denotes divisibility, e.g. $6 | 4!$ means that $6$ is a divisor of number $4!$.

For any positive integer $k$, denote the sum of digits of $k$ in its decimal representation by $S(k)$. Find all polynomials $P(x)$ with integer coefficients such that for any positive integer $n \geq 2016$, the integer $P(n)$ is positive and $$S(P(n)) = P(S(n)).$$ [i]Proposed by Warut Suksompong, Thailand[/i]

For which values of N is it possible to write numbers from 1 to N in some order so that for any group of two or more consecutive numbers, the arithmetic mean of these numbers is not whole?

Suppose we wish to pick a random integer between $1$ and $N$ inclusive by flipping a fair coin. One way we can do this is through generating a random binary decimal between $0$ and $1$, then multiplying the result by $N$ and taking the ceiling. However, this would take an infinite amount of time. We therefore stopping the flipping process after we have enough flips to determine the ceiling of the number. For instance, if $N=3$, we could conclude that the number is $2$ after flipping $.011_2$, but $.010_2$ is inconclusive. Suppose $N=2014$. The expected number of flips for such a process is $\frac{m}{n}$ where $m$, $n$ are relatively prime positive integers, find $100m+n$. [i]Proposed by Lewis Chen[/i]

a) Find all positive integer solutions of the equation $x^y = y^x$ ($x \ne y$). b) Find all positive rational solutions of the equation $x^y = y^x$ ($x \ne y$).

Numbers $1$ through $2014$ are written on a board. A valid operation is to erase two numbers $a$ and $b$ on the board and replace them with the greatest common divisor and the least common multiple of $a$ and $b$. Prove that, no matter how many operations are made, the sum of all the numbers that remain on the board is always larger than $2014$ $\times$ $\sqrt[2014]{2014!}$

A numerical sequence is called lusophone if it satisfies the following three conditions: i) The first term of the sequence is number $1$. ii) To obtain the next term of the sequence we can multiply the previous term by a positive prime number ($2,3,5,7,11, ...$) or add $1$. (iii) The last term of the sequence is the number $2016$. For example: $1\overset{{\times 11}}{\to}11 \overset{{\times 61}}{\to} 671 \overset{{+1}}{\to}672 \overset{{\times 3}}{\to}2016$ How many Lusophone sequences exist in which (as in the example above) the add $1$ operation was used exactly once and not multiplied twice by the same prime number?

Determine all pairs $(m,n)$ of positive integers such that $m^2+n^2=2018(m-n)$

Find all positive rational $(x,y)$ that satisfy the equation : $$yx^y=y+1$$

Call a number ``Sam-azing" if it is equal to the sum of its digits times the product of its digits. The only two three-digit Sam-azing numbers are $n$ and $n + 9$. Find $n$.

Find all primes $p \geq 3$ with the following property: for any prime $q<p$, the number \[ p - \Big\lfloor \frac{p}{q} \Big\rfloor q \] is squarefree (i.e. is not divisible by the square of a prime).

Find the natural number $n$ for which $$\sqrt{\frac{20^n- 18^n}{19}}$$ is a rational number.

Prove that for every positive integer $t$ there is a unique permutation $a_0, a_1, \ldots , a_{t-1}$ of $0, 1, \ldots , t-1$ such that, for every $0 \leq i \leq t-1$, the binomial coefficient $\binom{t+i}{2a_i}$ is odd and $2a_i \neq t+i$.

We have $n > 2$ nonzero integers such that everyone of them is divisible by the sum of the other $n - 1$ numbers, Show that the sum of the $n$ numbers is precisely $0$.