Find all integer triples $(p,m,n)$ that satisfy: $p^m-n^3=27$ where $p$ is a prime number.

Find all pairs of integers $(x,y)$ satisfying the following condition: [i]each of the numbers $x^3 + y$ and $x + y^3$ is divisible by $x^2 + y^2$ [/i] Tournament of Towns

Given are two integers $a>b>1$ such that $a+b \mid ab+1$ and $a-b \mid ab-1$. Prove that $a<\sqrt{3}b$.

Find all positive integers $n$ that can be [i]uniquely[/i] expressed as a sum of five or fewer squares.

Show that there are no 2-tuples $ (x,y)$ of positive integers satisfying the equation $ (x+1) (x+2)\cdots (x+2014)= (y+1) (y+2)\cdots (y+4028).$

Determine the natural numbers a, b, c s.t. : $ \frac{3a+2b}{6a}=\frac{8b+c}{10b}=\frac{3a+2c}{3c} $ and $ a^{2}+b^{2}+c^{2}=975 $ The challenge here is to come up with as basic solution as possible.

Show that, if $a,b,...,n$ are distinct natural numbers, none divisible by any primes greater than $3$, then $$\frac{1}{a}+\frac{1}{b}+...+ \frac{1}{n}< 3$$

Determine all possible values of the expression$$x-\left [\frac{x}{2}\right ]-\left [\frac{x}{3}\right ]-\left [\frac{x} {6}\right ]$$by varying $x$ in the real numbers. Clarification: The brackets indicate the integer part of the number they enclose.

Let $ p \geq 2$ be a prime number. Eduardo and Fernando play the following game making moves alternately: in each move, the current player chooses an index $i$ in the set $\{0,1,2,\ldots, p-1 \}$ that was not chosen before by either of the two players and then chooses an element $a_i$ from the set $\{0,1,2,3,4,5,6,7,8,9\}$. Eduardo has the first move. The game ends after all the indices have been chosen .Then the following number is computed: $$M=a_0+a_110+a_210^2+\cdots+a_{p-1}10^{p-1}= \sum_{i=0}^{p-1}a_i.10^i$$. The goal of Eduardo is to make $M$ divisible by $p$, and the goal of Fernando is to prevent this. Prove that Eduardo has a winning strategy. [i]Proposed by Amine Natik, Morocco[/i]

Let $r$ be a positive integer and let $a_r$ be the number of solutions to the equation $3^x-2^y=r$ ,such that $0\leq x,y\leq 5781$ are integers. What is the maximal value of $a_r$?

What digits should be placed instead of zeros in the third and fifth places in the number $3000003$ to obtain a number divisible by $13$?

In the sequence of the natural (i.e. positive integers) numbers every member from the third equals the absolute value of the difference of the two previous. What is the maximal possible length of such a sequence, if every member is less or equal to $1967$?

Determine all integers $k$ such that the equation: $$\frac{1}{x}+\frac{1}{y}+\frac{1}{z}=\frac{k}{xyz}$$ has an infinite number of integer solutions $(x,y,z)$ with gcd$(k,xyz)=1$.

Find all functions $f:\mathbb{Z}_{\ge 1}\to \mathbb{R}_{>0}$ such that for all positive integers $n$ the following relation holds: $$\sum_{d|n} f(d)^3=\left (\sum_{d|n} f(d) \right )^2,$$ where both sums are taken over the positive divisors of $n$. [i] (Vlad Robu) [/i]

For any positive integer $n$, we define $$S_n=\sum_{k=1}^n \frac{2^k}{k^2}.$$ Prove that there are no polynomials $P,Q$ with real coefficients such that for any positive integer $n$, we have $\frac{S_{n+1}}{S_n}=\frac{P(n)}{Q(n)}$.

Let $a_1\in\mathbb{Z}$, $a_2=a_1^2-a_1-1$, $\dots$ ,$a_{n+1}=a_n^2-a_n-1$. Prove that $a_{n+1}$ and $2n+1$ are coprime.

Does there exist a natural number $a$ so that: a) $\Big ((a^2-3)^3+1\Big) ^a-1$ is a perfect square? b) $\Big ((a^2-3)^3+1\Big) ^{a+1}-1$ is a perfect square?

Let $n>1$ be an integer, and let $k$ be the number of distinct prime divisors of $n$. Prove that there exists an integer $a$, $1<a<\frac{n}{k}+1$, such that $n \mid a^2-a$.

Assume $\Omega(n),\omega(n)$ be the biggest and smallest prime factors of $n$ respectively . Alireza and Amin decided to play a game. First Alireza chooses $1400$ polynomials with integer coefficients. Now Amin chooses $700$ of them, the set of polynomials of Alireza and Amin are $B,A$ respectively . Amin wins if for all $n$ we have : $$\max_{P \in A}(\Omega(P(n))) \ge \min_{P \in B}(\omega(P(n)))$$ Who has the winning strategy. Proposed by [i]Alireza Haghi[/i]

Five mathematicians find a bag of $100$ gold coins in a room. They agree to split up the coins according to the following plan: • The oldest person in the room proposes a division of the coins among those present. (No coin may be split.) Then all present, including the proposer, vote on the proposal. • If at least $50\%$ of those present vote in favor of the proposal, the coins are distributed accordingly and everyone goes home. (In particular, a proposal wins on a tie vote.) • If fewer than $50\%$ of those present vote in favor of the proposal, the proposer must leave the room, receiving no coins. Then the process is repeated: the oldest person remaining proposes a division, and so on. • There is no communication or discussion of any kind allowed, other than what is needed for the proposer to state his or her proposal, and the voters to cast their vote. Assume that each person is equally intelligent and each behaves optimally to maximize his or her share. How much will each person get?

Prove that the product of four consecutive positive integers cannot be a perfect square or cube.

Prove that for each natural number $m$, there is a natural number $N$ such that for each $b$ that $2\leq b\leq1389$ sum of digits of $N$ in base $b$ is larger than $m$.

Find all pairs of positive integers $x,y$ such that $\frac{4}{x}+\frac{2}{y}=1$

Determine the smallest number $n \in Z_+$, which can be written as $n = \Sigma_{a\in A}a^2$, where $A$ is a finite set of positive integers and $\Sigma_{a\in A}a= 2014$. In other words: what is the smallest positive number which can be written as a sum of squares of different positive integers summing to $2014$?

Find all non-negative integers $n$ so that $\sqrt{n + 3}+ \sqrt{n +\sqrt{n + 3}} $ is an integer.