Find all positive integers m, n such that $m^3 - n^3 = 999$.

A sequence $(a_n)$ of positive integers is defined by $a_0=m$ and $a_{n+1}= a_n^5 +487$ for all $n\ge 0$. Find all positive integers $m$ such that the sequence contains the maximum possible number of perfect squares.

Three integers $A, B, C$ are written on a whiteboard. Every move, Mr. Doba can either subtract $1$ from all numbers on the board, or choose two numbers on the board and subtract $1$ from both of them whilst leaving the third untouched. For how many ordered triples $(A, B, C)$ with $1 \le A < B < C\le 20$ is it possible for Mr. Doba to turn all three of the numbers on the board to $0$?

Students in the class of Peter practice the addition and multiplication of integer numbers.The teacher writes the numbers from $1$ to $9$ on nine cards, one for each number, and places them in an ballot box. Pedro draws three cards, and must calculate the sum and the product of the three corresponding numbers. Ana and Julián do the same, emptying the ballot box. Pedro informs the teacher that he has picked three consecutive numbers whose product is $5$ times the sum. Ana informs that she has no prime number, but two consecutive and that the product of these three numbers is $4$ times the sum of them. What numbers did Julian remove?

$N$ is an integer whose representation in base $b$ is $777$. Find the smallest integer $b$ for which $N$ is the fourth power of an integer.

Determine all prime numbers $p$ such that $p^2 - 6$ and $p^2 + 6$ are both prime numbers.

For some integer n the equation $x^2 + y^2 + z^2 -xy -yz - zx = n$ has an integer solution $x, y, z$. Prove that the equation$ x^2 + y^2 - xy = n$ also has an integer solution $x, y$. Alexandr Yuran

For each positive integer $k,$ let $t(k)$ be the largest odd divisor of $k.$ Determine all positive integers $a$ for which there exists a positive integer $n,$ such that all the differences \[t(n+a)-t(n); t(n+a+1)-t(n+1), \ldots, t(n+2a-1)-t(n+a-1)\] are divisible by 4. [i]Proposed by Gerhard Wöginger, Austria[/i]

Find the smallest possible positive integer n with the following property: For all positive integers $x, y$ and $z$ with $x | y^3$ and $y | z^3$ and $z | x^3$ always to be true that $xyz| (x + y + z) ^n$. (Gerhard J. Woeginger)

Some numbers from $1$ to $100$ are painted red so that the following two conditions are met: $\bullet$ The number $1 $ is painted red. $\bullet$ If the numbers other than $a$ and $b$ are painted red then no number between $a$ and $b$ divides the number $ab$. What is the maximum number of numbers that can be painted red?

Let $ f(x) \equal{} x^8 \plus{} 4x^6 \plus{} 2x^4 \plus{} 28x^2 \plus{} 1.$ Let $ p > 3$ be a prime and suppose there exists an integer $ z$ such that $ p$ divides $ f(z).$ Prove that there exist integers $ z_1, z_2, \ldots, z_8$ such that if \[ g(x) \equal{} (x \minus{} z_1)(x \minus{} z_2) \cdot \ldots \cdot (x \minus{} z_8),\] then all coefficients of $ f(x) \minus{} g(x)$ are divisible by $ p.$

The units-digit of the square of an integer is 9 and the tens-digit of this square is 0. Prove that the hundreds-digit is even.

$a_1,a_2,...,a_{2014}$ is a permutation of $1,2,3,...,2014$. What is the greatest number of perfect squares can have a set ${ a_1^2+a_2,a_2^2+a_3,a_3^2+a_4,...,a_{2013}^2+a_{2014},a_{2014}^2+a_1 }?$

Given an integer $n > 1$, prove that there exist distinct positive integers $a, b, c$ and $d$ such that $a + b = c + d$ and $\frac{a}{b}=\frac{nc}{d}$.

Let $ a, b, c, d,m, n \in \mathbb{Z}^\plus{}$ such that \[ a^2\plus{}b^2\plus{}c^2\plus{}d^2 \equal{} 1989,\] \[ a\plus{}b\plus{}c\plus{}d \equal{} m^2,\] and the largest of $ a, b, c, d$ is $ n^2.$ Determine, with proof, the values of $m$ and $ n.$

[b]p1.[/b] Sometimes one finds in an old park a tetrahedral pile of cannon balls, that is, a pile each layer of which is a tightly packed triangular layer of balls. A. How many cannon balls are in a tetrahedral pile of cannon balls of $N$ layers? B. How high is a tetrahedral pile of cannon balls of $N$ layers? (Assume each cannon ball is a sphere of radius $R$.) [b]p2.[/b] A prime is an integer greater than $1$ whose only positive integer divisors are itself and $1$. A. Find a triple of primes $(p, q, r)$ such that $p = q + 2$ and $q = r + 2$ . B. Prove that there is only one triple $(p, q, r)$ of primes such that $p = q + 2$ and $q = r + 2$ . [b]p3.[/b] The function $g$ is defined recursively on the positive integers by $g(1) =1$, and for $n>1$ , $g(n)= 1+g(n-g(n-1))$ . A. Find $g(1)$ , $g(2)$ , $g(3)$ and $g(4)$ . B. Describe the pattern formed by the entire sequence $g(1) , g(2 ), g(3), ...$ C. Prove your answer to Part B. [b]p4.[/b] Let $x$ , $y$ and $z$ be real numbers such that $x + y + z = 1$ and $xyz = 3$ . A. Prove that none of $x$ , $y$ , nor $z$ can equal $1$. B. Determine all values of $x$ that can occur in a simultaneous solution to these two equations (where $x , y , z$ are real numbers). [b]p5.[/b] A round robin tournament was played among thirteen teams. Each team played every other team exactly once. At the conclusion of the tournament, it happened that each team had won six games and lost six games. A. How many games were played in this tournament? B. Define a [i]circular triangle[/i] in a round robin tournament to be a set of three different teams in which none of the three teams beat both of the other two teams. How many circular triangles are there in this tournament? C. Prove your answer to Part B. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find the sum of all positive divisors of $40081$.

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

Determine a subset $ A\subset \mathbb{N}^*$ having $ 5$ different elements, so that the sum of the squares of its elements equals their product. Do not simply post the subset, show how you found it.

Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.) [i]Proposed by Hong Kong[/i]

Does there exist a a sequence $a_{0},a_{1},a_{2},\dots$ in $\mathbb N$, such that for each $i\neq j, (a_{i},a_{j})=1$, and for each $n$, the polynomial $\sum_{i=0}^{n}a_{i}x^{i}$ is irreducible in $\mathbb Z[x]$? [i]By Omid Hatami[/i]

Let $n\in \mathbb{N}$. Prove that $lcm [1,2,..,n]=lcm [\binom{n}{1},\binom{n}{2},...,\binom{n}{n}]$ if and only if $n+1$ is a prime number.

Prove that if $n$ is a natural number such that both $3n+1$ and $4n+1$ are squares, then $n$ is divisible by $56$.

Find all four-digit numbers which are equal to the cube of the sum of their digits.

a) The digits of a natural number were rearranged. Prove that the sum of given and obtained numbers can't equal $999...9$ ($1967$ of nines). b) The digits of a natural number were rearranged. Prove that if the sum of the given and obtained numbers equals $1010$, than the given number was divisible by $10$.