A polynomial $P$ with integer coefficients has at least $13$ distinct integer roots. Prove that if an integer $n$ is not a root of $P$, then $|P(n)| \geq 7 \cdot 6!^2$, and give an example for equality.

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]

Let $a,b,k$ be positive integers such that $gcd(a,b)^2+lcm(a,b)^2+a^2b^2=2020^k$ Prove that $k$ is an even number.

Determine if there exist positive integer pairs $(m,n)$, such that (i) the greatest common divisor of m and $n$ is $1$, and $m \le 2007$, (ii) for any $k=1,2,..., 2007$, $\big[\frac{nk}{m}\big]=\big[\sqrt2 k\big]$ . (Here $[x]$ stands for the greatest integer less than or equal to $x$.)

Prove that numbers $1,2,...,16$ can be divided in sequence such that sum of any two neighboring numbers is perfect square

Let $S$ be the set of positive integers $n$ such that the inequality \[ \phi(n) \cdot \tau(n) \geq \sqrt{\frac{n^3}{3}} \] holds, where $\phi(n)$ is the number of positive integers $k \le n$ that are relatively prime to $n$, and $\tau(n)$ is the number of positive divisors of $n$. Prove that $S$ is finite.

Find all the natural numbers $x, y, z$ that satisfy simultaneously $$\begin{cases} x y z=4104 \\ x+y+z=77 \end{cases}$$

Let $\mathcal{S}$ be a set consisting of $n \ge 3$ positive integers, none of which is a sum of two other distinct members of $\mathcal{S}$. Prove that the elements of $\mathcal{S}$ may be ordered as $a_1, a_2, \dots, a_n$ so that $a_i$ does not divide $a_{i - 1} + a_{i + 1}$ for all $i = 2, 3, \dots, n - 1$.

If $n$ is a positive integer such that $8n+1$ is a perfect square, then $\textbf{(A)}~n\text{ must be odd}$ $\textbf{(B)}~n\text{ cannot be a perfect square}$ $\textbf{(C)}~n\text{ cannot be a perfect square}$ $\textbf{(D)}~\text{None of the above}$

[u]Round 6 [/u] [b]p16.[/b] Let $a$ be a solution to $x^3 -x +1 = 0$. Find $a^6 -a^2 +2a$. [b]p17.[/b] For a positive integer $n$, $\phi (n)$ is the number of positive integers less than $n$ that are relatively prime to $n$. Compute the sum of all $n$ for which $\phi (n) = 24$. [b]p18.[/b] Let $x$ be a positive integer such that $x^2 \equiv 57$ (mod $59$). Find the least possible value of $x$. [u]Round 7[/u] [b]p19.[/b] In the diagram below, find the number of ways to color each vertex red, green, yellow or blue such that no two vertices of a triangle have the same color. [img]https://cdn.artofproblemsolving.com/attachments/1/e/01418af242c7e2c095a53dd23e997b8d1f3686.png[/img] [b]p20.[/b] In a set with $n$ elements, the sum of the number of ways to choose $3$ or $4$ elements is a multiple of the sumof the number of ways to choose $1$ or $2$ elements. Find the number of possible values of $n$ between $4$ and $120$ inclusive. [b]p21.[/b] In unit square $ABCD$, let $\Gamma$ be the locus of points $P$ in the interior of $ABCD$ such that $2AP < BP$. The area of $\Gamma$ can be written as $\frac{a\pi +b\sqrt{c}}{d}$ for integers $a,b,c,d$ with $c$ squarefree and $gcd(a,b,d) = 1$. Find $1000000a +10000b +100c +d$. [u]Round 8 [/u] [b]p22.[/b] Ephram, GammaZero, and Orz walk into a bar. Each write some permutation of the letters “LMT” once, then concatenate their permutations one after the other (i.e. LTMTLMTLM would be a possible string, but not LLLMMMTTT). Suppose that the probability that the string “LMT” appears in that order among the new $9$-character string can be written as $\frac{A}{B}$ for relatively prime positive integers $A$ and $B$. Find $1000A+B$. [b]p23.[/b] In $\vartriangle ABC$ with side lengths $AB = 27$, $BC = 35$, and $C A = 32$, let $D$ be the point at which the incircle is tangent to $BC$. The value of $\frac{\sin \angle C AD }{\sin\angle B AD}$ can be expressed as $\frac{A}{B}$ for relatively prime positive integers $A$ and $B$. Find $1000A+B$. [b]p24.[/b] Let $A$ be the greatest possible area of a square contained in a regular hexagon with side length $1$. Let B be the least possible area of a square that contains a regular hexagon with side length $1$. The value of $B-A$ can be expressed as $a\sqrt{b}-c$ for positive integers $a$, $b$, and $c$ with $b$ squarefree. Find $10000a +100b +c$. [u]Round 9[/u] [b]p25.[/b] Estimate how many days before today this problem was written. If your estimation is $E$ and the actual answer is $A$, you will receive $\max \left( \left \lfloor 10 - \left| \frac{E-A}{2} \right| \right \rfloor , 0 \right)$ points. [b]p26.[/b] Circle $\omega_1$ is inscribed in unit square $ABCD$. For every integer $1 < n \le 10,000$, $\omega_n$ is defined as the largest circle which can be drawn inside $ABCD$ that does not overlap the interior of any of $\omega_1$,$\omega_2$, $...$,$\omega_{n-1}$ (If there are multiple such $\omega_n$ that can be drawn, one is chosen at random). Let r be the radius of ω10,000. Estimate $\frac{1}{r}$ . If your estimation is $E$ and the actual answer is $A$, you will receive $\max \left( \left \lfloor 10 - \left| \frac{E-A}{200} \right| \right \rfloor , 0 \right)$ points. [b]p27.[/b] Answer with a positive integer less than or equal to $20$. We will compare your response with the response of every other team that answered this problem. When two equal responses are compared, neither team wins. When two unequal responses $A > B$ are compared, $A$ wins if $B | A$, and $B$ wins otherwise. If your team wins n times, you will receive $\left \lfloor \frac{n}{2} \right \rfloor$ points. PS. You should use hide for answers. Rounds 1-5 have been posted [url=https://artofproblemsolving.com/community/c3h3167135p28823324]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all positive integers $n$ such that $$\phi(n) + \sigma(n) = 2n + 8.$$

For every positive integer $ n$, let $ \phi(n)$ denotes the number of positive integers less than $ n$ that is relatively prime to $ n$ and $ \tau(n)$ denote the sum of all positive divisors of $ n$. Let $ n$ be a positive integer such that $ \phi(n)|n\minus{}1$ and that $ n$ is not a prime number. Prove that $ \tau(n)>2009$.

Let $ S$ be a set of all positive integers which can be represented as $ a^2 \plus{} 5b^2$ for some integers $ a,b$ such that $ a\bot b$. Let $ p$ be a prime number such that $ p \equal{} 4n \plus{} 3$ for some integer $ n$. Show that if for some positive integer $ k$ the number $ kp$ is in $ S$, then $ 2p$ is in $ S$ as well. Here, the notation $ a\bot b$ means that the integers $ a$ and $ b$ are coprime.

Six children stand in a line outside their classroom. When they enter the classroom, they sit in a circle in random order. There are relatively prime positive integers $m$ and $n$ so that $\tfrac{m}{n}$ is the probability that no two children who stood next to each other in the line end up sitting next to each other in the circle. Find $m + n$.

Five circles in a row are each labeled with a positive integer. As shown in the diagram, each circle is connected to its adjacent neighbor(s). The integers must be chosen such that the sum of the digits of the neighbor(s) of a given circle is equal to the number labeling that point. In the example, the second number $23 = (1+8)+(5+9)$, but the other four numbers do not have the needed value. [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvMi9lL2M2MzVkMmMyYTRlZjliNWEzYWNkOTM2OGVmY2NkOGZmOWVkN2VmLnBuZw==&rn=MjAxMSBCQU1PIDIucG5n[/img] What is the smallest possible sum of the five numbers? How many possible arrangements of the five numbers have this sum? Justify your answers.

Find all the triples $(x,y,z)$ of positive integers such that $xy+yz+zx-xyz=2015$

Find integer solutions of $x^3+y^3-2xy+x+y+2=0$

Prove that there exist infinitely many pairs $\left(x;\;y\right)$ of different positive rational numbers, such that the numbers $\sqrt{x^2+y^3}$ and $\sqrt{x^3+y^2}$ are both rational.

Is it possible for Pingu to choose $2025$ positive integers $a_1, ..., a_{2025}$ such that: 1. The sequence $a_i$ is increasing; 2. $\gcd(a_1,a_2)>\gcd(a_2,a_3)>...>\gcd(a_{2024},a_{2025})>\gcd(a_{2025},a_1)>1$? [i](Proposed by Tan Rui Xuen and Ivan Chan Guan Yu)[/i]

Prove that among any 7 integers there exist three numbers $ a,b,c$ such that $ a^2\plus{}b^2\plus{}c^2\minus{}ab\minus{}bc\minus{}ac$ is divisible by 7.

Find all triples $ (x,y,z) $ of natural numbers that are in geometric progression and verify the inequalities $$ 4016016\le x<y<z\le 4020025. $$

We have $2012$ sticks with integer length, and sum of length is $n$. We need to have sticks with lengths $1,2,....,2012$. For it we can break some sticks ( for example from stick with length $6$ we can get $1$ and $4$). For what minimal $n$ it is always possible?

Suppose that $a, b, c,d$ are pairwise distinct positive integers such that $a+b = c+d = p$ for some odd prime $p > 3$ . Prove that $abcd$ is not a perfect square.

A positive integer has exactly $50$ divisors. Is it possible that no difference of two different divisors is divisible by $100$? [i]Proposed by A. Chironov[/i]

Show that for any rational number $a$ the equation $y =\sqrt{x^2 +a}$ has infinitely many solutions in rational numbers $x$ and $y$.