Given a real sequence $\left \{ x_n \right \}_{n=1}^{\infty}$ with $x_1^2 = 1$. Prove that for each integer $n \ge 2$, $$\sum_{i|n}\sum_{j|n}\frac{x_ix_j}{\textup{lcm} \left ( i,j \right )} \ge \prod_{\mbox{\tiny$\begin{array}{c} p \: \textup{is prime} \\ p|n \end{array}$} }\left ( 1-\frac{1}{p} \right ). $$

Find unequal integers $m, n$ such that $mn + n$ and $mn + m$ are both squares. Can you find such integers between $988$ and $1991$?

Prove that the product of 4 consecutive natural numbers cannot be a perfect cube.

Prove that there is a positive integer $M$ for which the following statement holds: For all prime numbers $p$, there is an integer $n$ for which $\sqrt{p} \le n \le M\sqrt{p}$ and $p \mod n \le \frac{n}{2020}$ . Note: Here, $p \mod n$ denotes the unique integer $r \in {0, 1, ..., n - 1}$ for which $n|p -r$. In other words, $p \mod n$ is the residue of $p$ upon division by $n$.

Prove that the product of three consecutive positive integers is never a perfect square.

[b]p1.[/b] Solve the equation $3^x + 9^x = 27^x$. [b]p2.[/b] An equilateral triangle in inscribed in a circle of area $1$ m$^2$. Then the second circle is inscribed in the triangle. Find the radius of the second circle. [b]p3.[/b] Solve the inequality: $2\sqrt{x^2 - 5x + 4} + 3\sqrt{x^2 + 2x - 3} \le 5\sqrt{6 - x - x^2}$ [b]p4.[/b] Peter and John played a game. Peter wrote on a blackboard all integers from $1$ to $18$ and offered John to choose $8$ different integers from this list. To win the game John had to choose 8 integers such that among them the difference between any two is either less than $7$ or greater than $11$. Can John win the game? Justify your answer. [b]p5.[/b] Prove that given $100$ different positive integers such that none of them is a multiple of $100$, it is always possible to choose several of them such that the last two digits of their sum are zeros. [b]p6.[/b] Given $100$ different squares such that the sum of their areas equals $1/2$ m$^2$ , is it possible to place them on a square board with area $1$ m$^2$ without overlays? Justify your answer. PS. You should use hide for answers.

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 $x,y$ be integer number with $x,y\neq-1$ so that $\frac{x^{4}-1}{y+1}+\frac{y^{4}-1}{x+1}\in\mathbb{Z}$. Prove that $x^{4}y^{44}-1$ is divisble by $x+1$

[u]Set 4[/u] [b]G10.[/b] Let $ABCD$ be a square with side length $1$. It is folded along a line $\ell$ that divides the square into two pieces with equal area. The minimum possible area of the resulting shape is $A$. Find the integer closest to $100A$. [b]G11.[/b] The $10$-digit number $\underline{1A2B3C5D6E}$ is a multiple of $99$. Find $A + B + C + D + E$. [b]G12.[/b] Let $A, B, C, D$ be four points satisfying $AB = 10$ and $AC = BC = AD = BD = CD = 6$. If $V$ is the volume of tetrahedron $ABCD$, then find $V^2$. [u]Set 5[/u] [b]G13.[/b] Nate the giant is running a $5000$ meter long race. His first step is $4$ meters, his next step is $6$ meters, and in general, each step is $2$ meters longer than the previous one. Given that his $n$th step will get him across the finish line, find $n$. [b]G14.[/b] In square $ABCD$ with side length $2$, there exists a point $E$ such that $DA = DE$. Let line $BE$ intersect side $AD$ at $F$ such that $BE = EF$. The area of $ABE$ can be expressed in the form $a -\sqrt{b}$ where $a$ is a positive integer and $b$ is a square-free integer. Find $a + b$. [b]G15.[/b] Patrick the Beetle is located at $1$ on the number line. He then makes an infinite sequence of moves where each move is either moving $1$, $2$, or $3$ units to the right. The probability that he does reach $6$ at some point in his sequence of moves is $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [u]Set 6[/u] [b]G16.[/b] Find the smallest positive integer $c$ greater than $1$ for which there do not exist integers $0 \le x, y \le9$ that satisfy $2x + 3y = c$. [b]G17.[/b] Jaeyong is on the point $(0, 0)$ on the coordinate plane. If Jaeyong is on point $(x, y)$, he can either walk to $(x + 2, y)$, $(x + 1, y + 1)$, or $(x, y + 2)$. Call a walk to $(x + 1, y + 1)$ an Brilliant walk. If Jaeyong cannot have two Brilliant walks in a row, how many ways can he walk to the point $(10, 10)$? [b]G18.[/b] Deja vu? Let $ABCD$ be a square with side length $1$. It is folded along a line $\ell$ that divides the square into two pieces with equal area. The maximum possible area of the resulting shape is $B$. Find the integer closest to $100B$. PS. You should use hide for answers. Sets 1-3 have been posted [url=https://artofproblemsolving.com/community/c3h3131303p28367061]here [/url] and 7-9 [url=https://artofproblemsolving.com/community/c3h3131308p28367095]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that there do not exist natural numbers $x$ and $y$ with $x>1$ such that , \[ \frac{x^7-1}{x-1}=y^5+1 \]

$\pi(n)$ is the number of primes that are not bigger than $n$. For $n=2,3,4,6,8,33,\dots$ we have $\pi(n)|n$. Does exist infinitely many integers $n$ that $\pi(n)|n$?

Find all positive integers $x$ and $y$ such that $x^{x+y}=y^{3x}$.

Let $ c$ be a positive integer. The sequence $ a_1,a_2,\ldots$ is defined as follows $ a_1\equal{}c$, $ a_{n\plus{}1}\equal{}a_n^2\plus{}a_n\plus{}c^3$ for all positive integers $ n$. Find all $ c$ so that there are integers $ k\ge1$ and $ m\ge2$ so that $ a_k^2\plus{}c^3$ is the $ m$th power of some integer.

Today the age of Pedro is written and then the age of Luisa, obtaining a number of four digits that is a perfect square. If the same is done in $33$ years from now, there would be a perfect square of four digits . Find the current ages of Pedro and Luisa.

Determine all non-constant polynomials $ f\in \mathbb{Z}[X]$ with the property that there exists $ k\in\mathbb{N}^*$ such that for any prime number $ p$, $ f(p)$ has at most $ k$ distinct prime divisors.

Determine all triples of nonzero decimal digits $(x,y,z)$ for which the equality $\sqrt{ \underbrace{xxx...x}_{2n}- \underbrace{yy...y}_{n}}= \underbrace{zzz...z}_{n}$ holds for at least two different natural numbers $n$.

Let $ a,b$ be two distinct odd natural numbers.Define a Sequence $ { < a_n > }_{n\ge 0}$ like following: $ a_1 \equal{} a \\ a_2 \equal{} b \\ a_n \equal{} \text{largest odd divisor of }(a_{n \minus{} 1} \plus{} a_{n \minus{} 2})$. Prove that there exists a natural number $ N$ such that $ a_n \equal{} gcd(a,b) \forall n\ge N$.

Let $n$ be a positive integer. (a) Prove that there exists a set $S$ of $6n$ pairwise different positive integers, such that the least common multiple of any two elements of $S$ is no larger than $32n^2$. (b) Prove that every set $T$ of $6n$ pairwise different positive integers contains two elements the least common multiple of which is larger than $9n^2$.

Find all functions $ f: \mathbb{N^{*}}\to \mathbb{N^{*}}$ satisfying \[ \left(f^{2}\left(m\right)+f\left(n\right)\right) \mid \left(m^{2}+n\right)^{2}\] for any two positive integers $ m$ and $ n$. [i]Remark.[/i] The abbreviation $ \mathbb{N^{*}}$ stands for the set of all positive integers: $ \mathbb{N^{*}}=\left\{1,2,3,...\right\}$. By $ f^{2}\left(m\right)$, we mean $ \left(f\left(m\right)\right)^{2}$ (and not $ f\left(f\left(m\right)\right)$). [i]Proposed by Mohsen Jamali, Iran[/i]

* Given several numbers each of which is less than $1951$ and the least common multiple of any two of which is greater than $1951$. Prove that the sum of their reciprocals is less than $2$.

For a positive integer $k$, let $s(k)$ denote the sum of the digits of $k$. Show that there are infinitely many natural numbers $n$ such that $s(2^n) > s(2^{n+1})$.

Find all positive integers $n$ with the following property: the $k$ positive divisors of $n$ have a permutation $(d_1,d_2,\ldots,d_k)$ such that for $i=1,2,\ldots,k$, the number $d_1+d_2+\cdots+d_i$ is a perfect square.

Find all positive integers $n$ such that $\phi(n)$ is the fourth power of some prime.

Hesam chose $10$ distinct positive integers and he gave all pairwise $\gcd$'s and pairwise ${\text lcm}$'s (a total of $90$ numbers) to Masoud. Can Masoud always find the first $10$ numbers, just by knowing these $90$ numbers? [i]Proposed by Morteza Saghafian [/i]

Positive integers $a, b, n$ are given. Assume that $a$ and $n$ are even, $b$ is odd and the number $ab(a+b)^{n-1}$ is divisible by $a^n+b^n$. Prove that there exist a prime number $p$, such that $p^{n+1}$ divides $a^n+b^n$.