Let $P_1(x, y)$ and $P_2(x, y)$ be two relatively prime polynomials with complex coefficients. Let $Q(x, y)$ and $R(x, y)$ be polynomials with complex coefficients and each of degree not exceeding $d$. Prove that there exist two integers $A_1, A_2$ not simultaneously zero with $|A_i| \leq d + 1 \ (i = 1, 2)$ and such that the polynomial $A_1P_1(x, y) + A_2P_2(x, y)$ is coprime to $Q(x, y)$ and $R(x, y).$

Given two odd natural numbers $ a,b$ prove that for each $ n\in\mathbb{N}$ there exists $ m\in\mathbb{N}$ such that either $ a^mb^2-1$ or $ b^ma^2-1$ is multiple of $ 2^n.$

Find all numbers $x \in \mathbb Z$ for which the number \[x^4 + x^3 + x^2 + x + 1\] is a perfect square.

Find all $7$-digit numbers which use only the digits $5$ and $7$ and are divisible by $35$.

A positive integer $n$ is called $oeirense$ if there exist two positive integers $a$ and $b$, not necessarily distinct, such that $n=a^2+b^2$. Determine the greatest integer $k$ such that there exist infinitely many positive integers $n$ such that $n$, $n+1$, $\dots$, $n+k$ are oeirenses.

What are last three digits of $2^{2^{2004}}$ ?

Two players, Aurelio and Bernardo, play the following game. Aurelio begins by writing the number $1$. Next it is Bernardo's turn, who writes number $2$. From then on, each player chooses whether to add $1$ to the number just written by the previous player, or whether multiply that number by $2$. Then write the result and it's the other player's turn. The first player to write a number greater than $ 2007$ loses the game. Determine if one of the players can ensure victory no matter what the other does.

For some positive integer $n$, Katya wrote on the board next to each other numbers $2^n$ and $14^n$ (in this order), thus forming a new number $A$. Can the number $A - 1$ be prime? [i]Proposed by Oleksii Masalitin[/i]

Find the greatest positive integer $n$ such that there exist positive integers $a_1, a_2, ..., a_n$ for which the following holds $a_{k+2} = \dfrac{(a_{k+1}+a_k)(a_{k+1}+1)}{a_k}$ for all $1 \le k \le n-2$. [i]Proposed by Mykhailo Shtandenko and Oleksii Masalitin[/i]

Let $n$ be a positive integer. For a positive integer $m$, we partition the set $\{1, 2, 3,...,m\}$ into $n$ subsets, so that the product of two different elements in the same subset is never a perfect square. In terms of $n$, find the largest positive integer $m$ for which such a partition exists.

Prove that for any integer $a$ there exist infinitely many positive integers $n$ such that $a^{2^n}+2^n$ is not a prime. [b]proposed by S. Berlov[/b]

[b]p1.[/b] Compute $$\left(\frac{1}{10}\right)^{\frac12}\left(\frac{1}{10^2}\right)^{\frac{1}{2^4}}\left(\frac{1}{10^3}\right)^{\frac{1}{2^3}} ...$$ [b]p2.[/b] Consider the sequence $1, 2, 2, 3, 3, 3, 4, 4, 4, 4,...,$ where the positive integer $m$ appears $m$ times. Let $d(n)$ denote the $n$th element of this sequence starting with $n = 1$. Find a closed-form formula for $d(n)$. [b]p3.[/b] Let $0 < \theta < \frac{\pi}{2}$, prove that $$ \left( \frac{\sin^2 \theta}{2}+\frac{2}{\cos^2 \theta} \right)^{\frac14}+ \left( \frac{\cos^2 \theta}{2}+\frac{2}{\sin^2 \theta} \right)^{\frac14} \ge (68)^{\frac14} $$ and determine the value of \theta when the inequality holds as equality. [b]p4.[/b] In $\vartriangle ABC$, parallel lines to $AB$ and $AC$ are drawn from a point $Q$ lying on side $BC$. If $a$ is used to represent the ratio of the area of parallelogram $ADQE$ to the area of the triangle $\vartriangle ABC$, (i) find the maximum value of $a$. (ii) find the ratio $\frac{BQ}{QC}$ when $a =\frac{24}{49}.$ [img]https://cdn.artofproblemsolving.com/attachments/5/8/eaa58df0d55e6e648855425e581a6ba0ad3ea6.png[/img] [b]p5.[/b] Prove the following inequality $$\frac{1}{2009} < \frac{1}{2} \cdot \frac{3}{4} \cdot \frac{5}{6} \cdot \frac{7}{8}...\frac{2007}{2008}<\frac{1}{40}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].Thanks to gauss202 for sending the problems.

Let $p>2$ be a prime number and let $L=\{0,1,\dots,p-1\}^2$. Prove that we can find $p$ points in $L$ with no three of them collinear.

For positive integers $k$ and $n$, we know $k \geq n!$. Prove that $ \phi (k) \geq (n-1)!$

For positive integers $m$ and $n$, find the smalles possible value of $|2011^m-45^n|$. [i](Swiss Mathematical Olympiad, Final round, problem 3)[/i]

Determine all positive integers $n$ for which the equation \[ x^n + (2+x)^n + (2-x)^n = 0 \] has an integer as a solution.

For each positive integer $k$, let $S(k)$ be the sum of its digits. For example, $S(21) = 3$ and $S(105) = 6$. Let $n$ be the smallest integer for which $S(n) - S(5n) = 2013$. Determine the number of digits in $n$.

Let $ m$ and $ n$ be two positive integers. If there are infinitely many integers $ k$ such that $ k^2\plus{}2kn\plus{}m^2$ is a perfect square, prove that $ m\equal{}n$.

Find all positive integers $n \geq 2$ such that for all integers $i,j$ that $ 0 \leq i,j\leq n$ , $i+j$ and $ {n\choose i}+ {n \choose j}$ have same parity. [i]Proposed by Mr.Etesami[/i]

We call a triple of natural numbers $(a, b, c)$ [i]square [/i] if they form an arithmetic progression (in exactly this order), the number $b$ is coprime to each of the numbers $a$ and $c$, and the number $abc$ is a perfect square. Prove that for any given a square triple, there is another square triple that has at least one common number with it.

Solve over $\mathbb{Z}$: \[ x^4y^3(y-x)=x^3y^4-216 \]

Let $n$ be a positive integer. Prove that \[ 3^{\dfrac{5^{2^n}-1}{2^{n+2}}} \equiv (-5)^{\dfrac{3^{2^n}-1}{2^{n+2}}} \pmod{2^{n+4}}. \]

There are 2023 natural written in a row. The first number is 12, and each number starting from the third is equal to the product of the previous two numbers, or to the previous number increased by 4. What is the largest number of perfect squares that can be among the 2023 numbers? [i]Based on the British Mathematical Olympiad[/i]

Find all the pairs positive integers $(x, y)$ such that $\frac{1}{x}+\frac{1}{y}+\frac{1}{[x, y]}+\frac{1}{(x, y)}=\frac{1}{2}$ , where $(x, y)$ is the greatest common divisor of $x, y$ and $[x, y]$ is the least common multiple of $x, y$.

Prove that for all integers $ a > 1$ and $ b > 1$ there exists a function $ f$ from the positive integers to the positive integers such that $ f(a\cdot f(n)) \equal{} b\cdot n$ for all $ n$ positive integer.