Let $n$ be a natural number, with the prime factorisation \[ n = p_1^{e_1} p_2^{e_2} \cdots p_r^{e_r} \] where $p_1, \ldots, p_r$ are distinct primes, and $e_i$ is a natural number. Define \[ rad(n) = p_1p_2 \cdots p_r \] to be the product of all distinct prime factors of $n$. Determine all polynomials $P(x)$ with rational coefficients such that there exists infinitely many naturals $n$ satisfying $P(n) = rad(n)$.

[u]Round 1[/u] [b]p1.[/b] How many distinct ways are there to scramble the letters in $EXETER$? [b]p2.[/b] Given that $\frac{x - y}{x - z}= 3$, find $\frac{x - z}{y - z}$. [b]p3.[/b] When written in base $10$, $9^9 =\overline{ABC420DEF}.$ Find the remainder when $A + B + C + D + E + F$ is divided by $9$. [u]Round 2[/u] [b]p4.[/b] How many positive integers, when expressed in base $7$, have exactly $3$ digits, but don't contain the digit $3$? [b]p5.[/b] Pentagon $JAMES$ is such that its internal angles satisfy $\angle J = \angle A = \angle M = 90^o$ and $\angle E = \angle S$. If $JA = AM = 4$ and $ME = 2$, what is the area of $JAMES$? [b]p6.[/b] Let $x$ be a real number such that $x = \frac{1+\sqrt{x}}{2}$ . What is the sum of all possible values of $x$? [u]Round 3[/u] [b]p7.[/b] Farmer James sends his favorite chickens, Hen Hao and PEAcock, to compete at the Fermi Estimation All Star Tournament (FEAST). The first problem at the FEAST requires the chickens to estimate the number of boarding students at Eggs-Eater Academy given the number of dorms $D$ and the average number of students per dorm $A$. Hen Hao rounds both $D$ and $A$ down to the nearest multiple of $10$ and multiplies them, getting an estimate of $1200$ students. PEAcock rounds both $D$ and $A$ up to the nearest multiple of $10$ and multiplies them, getting an estimate of $N$ students. What is the maximum possible value of $N$? [b]p8.[/b] Farmer James has decided to prepare a large bowl of egg drop soup for the Festival of Eggs-Eater Annual Soup Tasting (FEAST). To flavor the soup, Hen Hao drops eggs into it. Hen Hao drops $1$ egg into the soup in the first hour, $2$ eggs into the soup in the second hour, and so on, dropping $k$ eggs into the soup in the $k$th hour. Find the smallest positive integer $n$ so that after exactly n hours, Farmer James finds that the number of eggs dropped in his egg drop soup is a multiple of $200$. [b]p9.[/b] Farmer James decides to FEAST on Hen Hao. First, he cuts Hen Hao into $2018$ pieces. Then, he eats $1346$ pieces every day, and then splits each of the remaining pieces into three smaller pieces. How many days will it take Farmer James to eat Hen Hao? (If there are fewer than $1346$ pieces remaining, then Farmer James will just eat all of the pieces.) [u]Round 4[/u] [b]p10.[/b] Farmer James has three baskets, and each basket has one magical egg. Every minute, each magical egg disappears from its basket, and reappears with probability $\frac12$ in each of the other two baskets. Find the probability that after three minutes, Farmer James has all his eggs in one basket. [b]p11.[/b] Find the value of $\frac{4 \cdot 7}{\sqrt{4 +\sqrt7} +\sqrt{4 -\sqrt7}}$. [b]p12.[/b] Two circles, with radius $6$ and radius $8$, are externally tangent to each other. Two more circles, of radius $7$, are placed on either side of this configuration, so that they are both externally tangent to both of the original two circles. Out of these $4$ circles, what is the maximum distance between any two centers? PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2949222p26406222]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

If $n$ is positive integer and $p, q, r$ are primes solve the system: $pqr=n$ and $(p+1)(q+1)r=n+138$

Find the least possible number of elements which can be deleted from the set $\{1,2,...,20\}$ so that the sum of no two different remaining numbers is not a perfect square. N. Sedrakian , I.Voronovich

Let $n \geq 2$ be an integer. Define $x_i =1$ or $-1$ for every $i=1,2,3,\cdots, n$. Call an operation [i]adhesion[/i], if it changes the string $(x_1,x_2,\cdots,x_n)$ to $(x_1x_2, x_2x_3, \cdots ,x_{n-1}x_n, x_nx_1)$ . Find all integers $n \geq 2$ such that the string $(x_1,x_2,\cdots, x_n)$ changes to $(1,1,\cdots,1)$ after finitely [i]adhesion[/i] operations.

A triple integer $(a, b, c)$ is called [i]brilliant [/i] when it satisfies: (i) $a> b> c$ are prime numbers (ii) $a = b + 2c$ (iii) $a + b + c$ is a perfect square number Find the minimum value of $abc$ if triple $(a, b, c)$ is [i]brilliant[/i].

Let $P(x)$ be a polynomial with integer coefficients such that $P(0)=1$, and let $c > 1$ be an integer. Define $x_0=0$ and $x_{i+1} = P(x_i)$ for all integers $i \ge 0$. Show that there are infinitely many positive integers $n$ such that $\gcd (x_n, n+c)=1$. [i]Proposed by Milan Haiman and Carl Schildkraut[/i]

Find all the natural $n$ and $k$ such that $n^n$ has $k$ digits and $k^k$ has $n$ digits.

Prove that there are infinitely many positive integers $n$ such that $$3^{(n-2)^{n-1}-1} -1\vdots 17n^2$$ (I. Bliznets)

Given are $2021$ prime numbers written in a row. Each number, except for those in the two ends, differs from its two adjacent numbers with $6$ and $12$. Prove that there are at least two equal numbers.

Sequence $(G_n)$ is defined by $G_0 = 0, G_1 = 1$ and $G_n = G_{n-1} + G_{n-2} + 1$ for every $n \ge2$. Prove that for every positive integer $m$ there exist two consecutive terms in the sequence that are both divisible by $m$.

Show that for each integer $a$, there is a unique decomposition \[ a = \sum_{j=0}^{n} d_j 2^j , d_j \in (-1,0,1) \] such that no two consecutive $d_j$'s are nonzero. Show further that if $f$ is nondecreasing function from the set of all non-negative integers in to the set of all non-negative real numbers, and if $a = \sum_{j=0}^{n} c_j 2^j$ is any other decomposition of $a$ with $c_j \in (-1,0,1)$ , then \[ \sum_{j=0}^{n} |d_j| f(j) \leq \sum_{j=0}^{n} |c_j| f(j) \]

We consider positive integers written down in the (usual) decimal system. Within such an integer, we number the positions of the digits from left to right, so the leftmost digit (which is never a $0$) is at position $1$. An integer is called [i]even-steven[/i] if each digit at an even position (if there is one) is greater than or equal to its neighbouring digits (if these exist). An integer is called [i]oddball[/i] if each digit at an odd position is greater than or equal to its neighbouring digits (if these exist). For example, $3122$ is [i]oddball[/i] but not [i]even-steven[/i], $7$ is both [i]even-steven[/i] and [i]oddball[/i], and $123$ is neither [i]even-steven[/i] nor [i]oddball[/i]. (a) Prove: every oddball integer greater than $9$ can be obtained by adding two [i]oddball [/i] integers. (b) Prove: there exists an oddball integer greater than $9$ that cannot be obtained by adding two [i]even-steven[/i] integers.

a) Prove that the equation $2^x + 21^x = y^3$ has no solution in the set of natural numbers. b) Solve the equation $2^x + 21^y = z^2y$ in the set of non-negative integer numbers.

Each positive integer $a$ undergoes the following procedure in order to obtain the number $d = d\left(a\right)$: (i) move the last digit of $a$ to the first position to obtain the numb er $b$; (ii) square $b$ to obtain the number $c$; (iii) move the first digit of $c$ to the end to obtain the number $d$. (All the numbers in the problem are considered to be represented in base $10$.) For example, for $a=2003$, we get $b=3200$, $c=10240000$, and $d = 02400001 = 2400001 = d(2003)$.) Find all numbers $a$ for which $d\left( a\right) =a^2$. [i]Proposed by Zoran Sunic, USA[/i]

For natural numbers $x$ and $y$, let $(x,y)$ denote the greatest common divisor of $x$ and $y$. How many pairs of natural numbers $x$ and $y$ with $x \le y$ satisfy the equation $xy = x + y + (x, y)$?

Find all triples $(m,p,q)$ where $ m $ is a positive integer and $ p , q $ are primes. \[ 2^m p^2 + 1 = q^5 \]

Let $N_6$ be the answer to problem 6. Given positive integers $n$ and $a$, the $n$[i]th tetration of[/i] $a$ is defined as \[ ^{n}a=\underbrace{a^{a^{\cdot^{\cdot^{\cdot^a}}}}}_{n \text{ times}}. \] For example, $^{4}2=2^{2^{2^2}}=2^{2^4}=2^{16}=65536$. Compute the units digit of $^{2024}N_6$.

Let $ P$ be a regular polygon. A regular sub-polygon of $ P$ is a subset of vertices of $ P$ with at least two vertices such that divides the circumcircle to equal arcs. Prove that there is a subset of vertices of $ P$ such that its intersection with each regular sub-polygon has even number of vertices.

Let $k,m,n$ be natural numbers such that $m+k+1$ is a prime greater than $n+1$. Let $c_s=s(s+1)$. Prove that \[(c_{m+1}-c_k)(c_{m+2}-c_k)\ldots(c_{m+n}-c_k)\] is divisible by the product $c_1c_2\ldots c_n$.

Prove that for any integer the number $2n^3+3n^2+7n$ is divisible by $6$.

Find all triples $(x, y, z)$ of integers such that \[\frac{1}{x^2}+\frac{2}{y^2}+\frac{3}{z^2} =\frac 23\]

A sequence of natural numbers $c_1, c_2,\dots$ is called [i]perfect[/i] if every natural number $m$ with $1\le m \le c_1 +\dots+ c_n$ can be represented as $m =\frac{c_1}{a_1}+\frac{c_2}{a_2}+\dots+\frac{c_n}{a_n}$ Given $n$, find the maximum possible value of $c_n$ in a perfect sequence $(c_i)$.

Find all the pime numbers $(p,q)$ such that : $p^{3}+p=q^{2}+q$

All sequences of $k$ elements $(a_1,a_2,...,a_k)$ are considered, where each $a_i$ belongs to the set $\{1,2,... ,2021\}$. What is the sum of the smallest elements of all these sequences?