Solve in natural numbers $a,b,c$ the system \[\left\{ \begin{array}{l}a^3 -b^3 -c^3 = 3abc \\ a^2 = 2(a+b+c)\\ \end{array} \right. \]

Given a positive integer $k$, let $f(k)$ be the sum of the $k$-th powers of the primitive roots of $73$. For how many positive integers $k < 2015$ is $f(k)$ divisible by $73?$ [i]Note: A primitive root of $r$ of a prime $p$ is an integer $1 \le r < p$ such that the smallest positive integer $k$ such that $r^k \equiv 1 \pmod{p}$ is $k = p-1$.[/i]

What are the last two digits of $$2003^{{2005}^{{2007}^{2009}}}$$ , where $a^{b{^c}}$ means $a^{(b^c)}$?

Let $f(t)=t^3+t$. Decide if there exist rational numbers $x, y$ and positive integers $m, n$ such that $xy=3$ and: \begin{align*} \underbrace{f(f(\ldots f(f}_{m \ times}(x))\ldots)) = \underbrace{f(f(\ldots f(f}_{n \ times}(y))\ldots)). \end{align*}

A clue “$k$ digits, sum is $n$” gives a number k and the sum of $k$ distinct, nonzero digits. An answer for that clue consists of $k$ digits with sum $n$. For example, the clue “Three digits, sum is $23$” has only one answer: $6,8,9$. The clue “Three digits, sum is $8$” has two answers: $1,3,4$ and $1,2,5$. If the clue “Four digits, sum is $n$” has the largest number of answers for any four-digit clue, then what is the value of $n$? How many answers does this clue have? Explain why no other four-digit clue can have more answers.

Points $A$ and $B$ are the endpoints of a diameter of a circle with center $C$. Points $D$ and $E$ lie on the same diameter so that $C$ bisects segment $\overline{DE}$. Let $F$ be a randomly chosen point within the circle. The probability that $\triangle DEF$ has a perimeter less than the length of the diameter of the circle is $\tfrac{17}{128}$. There are relatively prime positive integers m and n so that the ratio of $DE$ to $AB$ is $\tfrac{m}{n}.$ Find $m + n$.

The product of two positive integers $m$ and $n$ is divisible by their sum. Prove that $m + n \le n^2$. (Boris Frenkin)

p1. Find all real numbers that satisfy the equation $$(1 + x^2 + x^4 + .... + x^{2014})(x^{2016} + 1) = 2016x^{2015}$$ p2. Let $A$ be an integer and $A = 2 + 20 + 201 + 2016 + 20162 + ... + \underbrace{20162016...2016}_{40\,\, digits}$ Find the last seven digits of $A$, in order from millions to units. p3. In triangle $ABC$, points $P$ and $Q$ are on sides of $BC$ so that the length of $BP$ is equal to $CQ$, $\angle BAP = \angle CAQ$ and $\angle APB$ is acute. Is triangle $ABC$ isosceles? Write down your reasons. p4. Ayu is about to open the suitcase but she forgets the key. The suitcase code consists of nine digits, namely four $0$s (zero) and five $1$s. Ayu remembers that no four consecutive numbers are the same. How many codes might have to try to make sure the suitcase is open? p5. Fulan keeps $100$ turkeys with the weight of the $i$-th turkey, being $x_i$ for $i\in\{1, 2, 3, ... , 100\}$. The weight of the $i$-th turkey in grams is assumed to follow the function $x_i(t) = S_it + 200 - i$ where $t$ represents the time in days and $S_i$ is the $i$-th term of an arithmetic sequence where the first term is a positive number $a$ with a difference of $b =\frac15$. It is known that the average data on the weight of the hundred turkeys at $t = a$ is $150.5$ grams. Calculate the median weight of the turkey at time $t = 20$ days.

Prove that for every positive integer $n$ there are positive integers $a$ and $b$ exist with $n | 4a^2 + 9b^2 -1$.

Show that there exist no integers $a$ and $b$ such that $a^3+a^2b+ab^2+b^3=2001$.

Every integer is to be coloured blue, green, red, or yellow. Can this be done in such a way that if $a, b, c, d$ are not all $0$ and have the same colour, then $3a-2b \neq 2c-3d$? [size=85][color=#0000FF][Mod edit: Question fixed][/color][/size]

a) Given $2019$ different integers wich have no odd prime divisor less than $37$, prove there exists two of these numbers such that their sum has no odd prime divisor less than $37$. b)Does the result hold if we change $37$ to $38$ ?

For every integer $ k \geq 2,$ prove that $ 2^{3k}$ divides the number \[ \binom{2^{k \plus{} 1}}{2^{k}} \minus{} \binom{2^{k}}{2^{k \minus{} 1}} \] but $ 2^{3k \plus{} 1}$ does not. [i]Author: Waldemar Pompe, Poland[/i]

The number $2^{29}$ has a $9$-digit decimal representation that contains all but one of the $10$ (decimal) digits. Determine which digit is missing

The increasing sequence of natural numbers $a_1,a_2,\ldots$ is such that for every $n>100$ the number $a_n$ is equal to the smallest natural number greater than $a_{n-1}$ and not divisible by any of the numbers $a_1,\ldots,a_{n-1}$. Prove that there is only a finite number of composite numbers in such a sequence. [i]Proposed by P. Kozhevnikov[/i]

A four-element set $\{a, b, c, d\}$ of positive integers is called [i]good[/i] if there are two of them such that their product is a mutiple of the greatest common divisor of the remaining two. For example, the set $\{2, 4, 6, 8\}$ is good since the greatest common divisor of $2$ and $6$ is $2$, and it divides $4\times 8=32$. Find the greatest possible value of $n$, such that any four-element set with elements less than or equal to $n$ is good. [i]Proposed by Victor and Isaías de la Fuente[/i]

Let $p$ of prime of the form $3k+2$ such that $a^2+ab+b^2$ is divisible by $p$ for some integers $a$ and $b$. Prove that both of $a$ and $b$ are divisible by $p$.

Prove that for any integer $a \ge 2$ and positive integer $n,$ there exist positive integer $k$ such that $a^k+1,a^k+2,\ldots,a^k+n$ are all composite numbers.

Determine whether or not there exists a positive integer $k$ such that $p = 6k+1$ is a prime and \[\binom{3k}{k} \equiv 1 \pmod{p}.\]

Let $n$ be a positive integer such that $24\mid n+1$. Prove that the sum of the positive divisors of $n$ is divisble by 24.

Determine all sequences of strictly positive integers $a_1, a_2, a_3, \ldots$ satisfying the following two conditions: [list] [*]There exists an integer $M > 0$ such that, for all indices $n \geqslant 1$, $0 < a_n \leqslant M$. [*]For any prime number $p$ and for any index $n \geqslant 1$, the number \[ a_n a_{n+1} \cdots a_{n+p-1} - a_{n+p} \] is a multiple of $p$. [/list]

We say that a positive integer $M$ with $2n$ digits is [i]hypersquared[/i] if the following three conditions are met: [list] [*]$M$ is a perfect square. [*]The number formed by the first $n$ digits of $M$ is a perfect square. [*]The number formed by the last $n$ digits of $M$ is a perfect square and has exactly $n$ digits (its first digit is not zero). [/list] Find a hypersquared number with $2000$ digits.

Let $x, y, p, n$, and $k$ be positive integers such that $x^n + y^n = p^k$. Prove that if $n > 1$ is odd, and $p$ is an odd prime, then $n$ is a power of $p$. [i]A. Kovaldji, V. Senderov[/i]

The sequence of Fibonnaci's numbers if defined from the two first digits $f_1=f_2=1$ and the formula $f_{n+2}=f_{n+1}+f_n$, $\forall n \in N$. [b](a)[/b] Prove that $f_{2010} $ is divisible by $10$. [b](b)[/b] Is $f_{1005}$ divisible by $4$? Albanian National Mathematical Olympiad 2010---12 GRADE Question 4.

Show that there exist $2009$ consecutive positive integers such that for each of them the ratio between the largest and the smallest prime divisor is more than $20.$