Find all integer solutions of the equation \[x^2+y^2=(x-y)^3.\]

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}$.

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!}$

Does there exist positive integers $a_{1}<a_{2}<\cdots<a_{100}$ such that for $2 \le k \le 100$, the greatest common divisor of $a_{k-1}$ and $a_{k}$ is greater than the greatest common divisor of $a_{k}$ and $a_{k+1}$?

Let $a_1,b_1,c_1$ be natural numbers. We define \[a_2=\gcd(b_1,c_1),\,\,\,\,\,\,\,\,b_2=\gcd(c_1,a_1),\,\,\,\,\,\,\,\,c_2=\gcd(a_1,b_1),\] and \[a_3=\operatorname{lcm}(b_2,c_2),\,\,\,\,\,\,\,\,b_3=\operatorname{lcm}(c_2,a_2),\,\,\,\,\,\,\,\,c_3=\operatorname{lcm}(a_2,b_2).\] Show that $\gcd(b_3,c_3)=a_2$.

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

Let $p,q$ be primes, where $p>q$. Define $t=\gcd(p!-1,q!-1)$. Prove that $t\le p^{\frac{p}{3}}$.

Let n is a natural number,for which $\sqrt{1+12n^2}$ is a whole number.Prove that $2+2\sqrt{1+12n^2}$ is perfect square.

The circle $x^2+ y^2 = r^2$ meets the coordinate axis at $A = (r,0), B = (-r,0), C = (0,r)$ and $D = (0,-r).$ Let $P = (u,v)$ and $Q = (-u,v)$ be two points on the circumference of the circle. Let $N$ be the point of intersection of $PQ$ and the $y$-axis, and $M$ be the foot of the perpendicular drawn from $P$ to the $x$-axis. If $r^2$ is odd, $u = p^m > q^n = v,$ where $p$ and $q$ are prime numbers and $m$ and $n$ are natural numbers, show that \[ |AM| = 1, |BM| = 9, |DN| = 8, |PQ| = 8. \]

Prove that if $m$ and $s$ are integers with $ms=2000^{2001}$, then the equation $mx^2-sy^2=3$ has no integer solutions.

Let $a_1,a_2,\dots, a_n$ be positive integers with product $P,$ where $n$ is an odd positive integer. Prove that $$\gcd(a_1^n+P,a_2^n+P,\dots, a_n^n+P)\le 2\gcd(a_1,\dots, a_n)^n.$$ [i]Proposed by Daniel Liu[/i]

Determine all triples of positive integers $a, b, c$ that satisfy a) $[a, b] + [a, c] + [b, c] = [a, b, c]$. b) $[a, b] + [a, c] + [b, c] = [a, b, c] + (a, b, c)$. Remark: Here $[x, y$] denotes the least common multiple of positive integers $x$ and $y$, and $(x, y)$ denotes their greatest common divisor.

Let $n$ and $k$ be relatively prime positive integers with $k<n$. Each number in the set $M=\{1,2,3,\ldots,n-1\}$ is colored either blue or white. For each $i$ in $M$, both $i$ and $n-i$ have the same color. For each $i\ne k$ in $M$ both $i$ and $|i-k|$ have the same color. Prove that all numbers in $M$ must have the same color.

Let $d$ be the greatest common divisor of $2^{30^{10}}-2$ and $2^{30^{45}}-2$. Find the remainder when $d$ is divided by $2013$.

How many ordered pairs of positive integers $(m, n)$ satisfy the system \begin{align*} \gcd (m^3, n^2) & = 2^2 \cdot 3^2, \\ \text{LCM} [m^2, n^3] & = 2^4 \cdot 3^4 \cdot 5^6, \end{align*} where $\gcd(a, b)$ and $\text{LCM}[a, b]$ denote the greatest common divisor and least common multiple of $a$ and $b$, respectively?

For any positive integer $n$, we define the integer $P(n)$ by : $P(n)=n(n+1)(2n+1)(3n+1)...(16n+1)$. Find the greatest common divisor of the integers $P(1)$, $P(2)$, $P(3),...,P(2016)$.

Let $ a_0$, $ a_1$, $ a_2$, $ \ldots$ be a sequence of positive integers such that the greatest common divisor of any two consecutive terms is greater than the preceding term; in symbols, $ \gcd (a_i, a_{i \plus{} 1}) > a_{i \minus{} 1}$. Prove that $ a_n\ge 2^n$ for all $ n\ge 0$. [i]Proposed by Morteza Saghafian, Iran[/i]

Find all pairs $(a,b)$ of positive integers that satisfy the equation \[a^{b^{2}}= b^{a}.\]

Let $ a $ and $ b $ be natural numbers with property $ gcd(a,b)=1 $ . Find the least natural number $ k $ such that for every natural number $ r \ge k $ , there exist natural numbers $ m,n >1 $ in such a way that the number $ m^a n^b $ has exactly $ r+1 $ positive divisors.

Given positive integer $n$ and $r$ pairwise distinct primes $p_1,p_2,\cdots,p_r.$ Initially, there are $(n+1)^r$ numbers written on the blackboard: $p_1^{i_1}p_2^{i_2}\cdots p_r^{i_r} (0 \le i_1,i_2,\cdots,i_r \le n).$ Alice and Bob play a game by making a move by turns, with Alice going first. In Alice's round, she erases two numbers $a,b$ (not necessarily different) and write $\gcd(a,b)$. In Bob's round, he erases two numbers $a,b$ (not necessarily different) and write $\mathrm{lcm} (a,b)$. The game ends when only one number remains on the blackboard. Determine the minimal possible $M$ such that Alice could guarantee the remaining number no greater than $M$, regardless of Bob's move.

Let $m$ and $n$ be positive integers satisfying the conditions [list] [*] $\gcd(m+n,210) = 1,$ [*] $m^m$ is a multiple of $n^n,$ and [*] $m$ is not a multiple of $n$. [/list] Find the least possible value of $m+n$.

Find all positive integers $x,y,z$ and $t$ such that $2^x3^y+5^z=7^t$.

Determine all pairs $ (n,p)$ of positive integers, where $ p$ is prime, such that $ 3^p\minus{}np\equal{}n\plus{}p$.

For every integers $ a,b,c$ whose greatest common divisor is $n$, if \[ \begin{array}{l} {x \plus{} 2y \plus{} 3z \equal{} a} \\ {2x \plus{} y \minus{} 2z \equal{} b} \\ {3x \plus{} y \plus{} 5z \equal{} c} \end{array} \] has a solution in integers, what is the smallest possible value of positive number $ n$? $\textbf{(A)}\ 7 \qquad\textbf{(B)}\ 14 \qquad\textbf{(C)}\ 28 \qquad\textbf{(D)}\ 56 \qquad\textbf{(E)}\ \text{None}$

$\textbf{N6.}$ Let $a,b$ be positive integers. If $a,b$ satisfy that \begin{align*} \frac{a+1}{b} + \frac{b+1}{a} \end{align*} is also a positive integer, show that \begin{align*} \frac{a+b}{gcd(a,b)^2} \end{align*} is a Fibonacci number. [i]Proposed by usjl[/i]