Find all triples of positive integers $(x, y, z)$ with $$\frac{xy}{z}+ \frac{yz}{x}+\frac{zx}{y}= 3$$

Prove that there are infinitely many natural numbers, the arithmetic mean and geometric mean of the divisors which are both integers.

Find all groups of positive integers $ (a,x,y,n,m)$ that satisfy $ a(x^n \minus{} x^m) \equal{} (ax^m \minus{} 4) y^2$ and $ m \equiv n \pmod{2}$ and $ ax$ is odd.

Find all natural numbers $n$ such that $n$, $n^2+10$, $n^2-2$, $n^3+6$, and $n^5+36$ are all prime numbers.

Find all positive intengers $x,y$, satisfying: $$3^x+x^4=y!+2019.$$

Find all the positive integers $p$ with the property that the sum of the first $p$ positive integers is a four-digit positive integer whose decomposition into prime factors is of the form $2^m3^n(m + n)$, where $m, n \in N^*$.

We string $2n$ white balls and $2n$ black balls, forming a continuous chain. Demonstrate that, in whatever order the balls are placed, it is always possible to cut a segment of the chain to contain exactly $n$ white balls and $n$ black balls.

find all positive integer $a\geq 2 $ and $b\geq2$ such that $a$ is even and all the digits of $a^b+1$ are equals.

Find all prime numbers $p$ for which $p^3- p + 1$ is a perfect square .

Find all couples $(x,y)$ over the positive integers such that: $7^x+x^4+47=y^2$

Start with a finite sequence $ a_1,a_2,\dots,a_n$ of positive integers. If possible, choose two indices $ j < k$ such that $ a_j$ does not divide $ a_k$ and replace $ a_j$ and $ a_k$ by $ \gcd(a_j,a_k)$ and $ \text{lcm}\,(a_j,a_k),$ respectively. Prove that if this process is repeated, it must eventually stop and the final sequence does not depend on the choices made. (Note: $ \gcd$ means greatest common divisor and lcm means least common multiple.)

Each of $11$ weights is weighing an integer number of grams. No two weights are equal. It is known that if all these weights or any group of them are placed on a balance then the side with a larger number of weights is always heavier. Prove that at least one weight is heavier than $35$ grams.

The six-digit decimal number contains six different non-zero digits and is divisible by $37$. Prove that having transposed its digits you can obtain at least $23$ more numbers divisible by $37$

Every positive integer is either [i]nice [/i] or [i]naughty[/i], and the Oracle of Numbers knows which are which. However, the Oracle will not directly tell you whether a number is [i]nice [/i] or [i]naughty[/i]. The only questions the Oracle will answer are questions of the form “What is the sum of all nice divisors of $n$?,” where $n$ is a number of the questioner’s choice. For instance, suppose ([i]just [/i] for this example) that $2$ and $3$ are nice, while $1$ and $6$ are [i]naughty[/i]. In that case, if you asked the Oracle, “What is the sum of all nice divisors of $6$?,” the Oracle’s answer would be $5$. Show that for any given positive integer $n$ less than $1$ million, you can determine whether $n$ is [i]nice [/i] or [i]naughty [/i] by asking the Oracle at most four questions.

A set of $2003$ positive integers is given. Show that one can find two elements such that their sum is not a divisor of the sum of the other elements.

Prove that there exists a positive integer $n$ such that $n^6 + 31n^4 - 900\vdots 2009 \cdot 2010 \cdot 2011$. (I. Losev, I. Voronovich)

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]

Prove that the equation $4x^3-3x+1=2y^2$ has at least $31$ solutions in positive integers $x$ and $y$ with $x\leq 2005$.

Call a $4$-digit number $\overline{a b c d}$ [i]unnoticeable [/i] if $a +c = b +d$ and $\overline{a b c d} +\overline{c d a b}$ is a multiple of $7$. Find the number of unnoticeable numbers. Note: $a$, $b$, $c$, and $d$ are nonzero distinct digits. [i]Proposed by Aditya Rao[/i]

For any real number $p\geq1$ consider the set of all real numbers $x$ with \[p<x<\left(2+\sqrt{p+\frac{1}{4}}\right)^2.\] Prove that from any such set one can select four mutually distinct natural numbers $a, b, c, d$ with $ab=cd.$

Find a pair of $2$ six-digit numbers such that, if they are written down side by side to form a twelve-digit number , this number is divisible by the product of the two original numbers. Find all such pairs of six-digit numbers. ( M . N . Gusarov, Leningrad)

Determine all positive integers $M$ such that the sequence $a_0, a_1, a_2, \cdots$ defined by \[ a_0 = M + \frac{1}{2} \qquad \textrm{and} \qquad a_{k+1} = a_k\lfloor a_k \rfloor \quad \textrm{for} \, k = 0, 1, 2, \cdots \] contains at least one integer term.

$p$ is an odd prime. Show that $p$ divides $n(n+1)(n+2)(n+3) + 1$ for some integer $n$ iff $p$ divides $m^2 - 5$ for some integer $m$.

A box contains $900$ cards numbered from $100$ to $999$. Paulo randomly takes a certain number of cards from the box and calculates, for each card, the sum of the digits written on it. How many cards does Paulo need to take out of the box to be sure of finding at least three cards whose digit sums are the same?

Determine all pairs $(x, y)$ of positive integers such that \[\sqrt[3]{7x^2-13xy+7y^2}=|x-y|+1.\] [i]Proposed by Titu Andreescu, USA[/i]