For any positive integer $k$, denote the sum of digits of $k$ in its decimal representation by $S(k)$. Find all polynomials $P(x)$ with integer coefficients such that for any positive integer $n \geq 2016$, the integer $P(n)$ is positive and $$S(P(n)) = P(S(n)).$$ [i]Proposed by Warut Suksompong, Thailand[/i]

If $a$ is an odd number, show that $$a^4 + 4a^3 + 11a^2 + 6a+ 2$$ is a sum of three squares and is divisible by $4$.

Find all natural numbers $n$ such that the sum of the three largest divisors of $n$ is $1457$.

For a prime $p$, a subset $S$ of residues modulo $p$ is called a [i]sum-free multiplicative subgroup[/i] of $\mathbb F_p$ if $\bullet$ there is a nonzero residue $\alpha$ modulo $p$ such that $S = \left\{ 1, \alpha^1, \alpha^2, \dots \right\}$ (all considered mod $p$), and $\bullet$ there are no $a,b,c \in S$ (not necessarily distinct) such that $a+b \equiv c \pmod p$. Prove that for every integer $N$, there is a prime $p$ and a sum-free multiplicative subgroup $S$ of $\mathbb F_p$ such that $\left\lvert S \right\rvert \ge N$. [i]Proposed by Noga Alon and Jean Bourgain[/i]

Find the smallest integer $n > 3$ such that, for each partition of $\{3, 4,..., n\}$ in two sets, at least one of these sets contains three (not necessarily distinct) numbers $ a, b, c$ for which $ab = c$. (Alberto Alfarano)

What is the least positive integer $m$ such that $m \cdot 2! \cdot 3! \cdot 4! \cdot 5! \cdots 16!$ is a perfect square? $\textbf{(A) }30\qquad\textbf{(B) }30030\qquad\textbf{(C) }70\qquad\textbf{(D) }1430\qquad\textbf{(E) }1001$

Let $ x \equal{} \sqrt[3]{\frac{4}{25}}\,$. There is a unique value of $ y$ such that $ 0 < y < x$ and $ x^x \equal{} y^y$. What is the value of $ y$? Express your answer in the form $ \sqrt[c]{\frac{a}{b}}\,$, where $ a$ and $ b$ are relatively prime positive integers and $ c$ is a prime number.

Let $n=p_1p_2\cdots p_s$, where $p_1,\ldots,p_s$ are distinct odd prime numbers. (a) Prove that the expression $$F_n(x)=\prod\left(x^{\frac n{p_{i_1}\cdots p_{i_k}}}-1\right)^{(-1)^k},$$where the product goes over all subsets $\{p_{i_1},\ldots,p_{i_k}\}$ or $\{p_1,\ldots,p_s\}$ (including itself and the empty set), can be written as a polynomial in $x$ with integer coefficients. (b) Prove that if $p$ is a prime divisor of $F_n(2)$, then either $p\mid n$ or $n\mid p-1$.

Let $n$ be a positive integer and $a=2^n\cdot 7^{n+1}+11$ and $b=2^{n+1}\cdot 7^n+3$. $a)$ Prove that fraction $\frac{a}{b}$ is irreducible $b)$ Prove that number $a+b-7$ is not a perfect square for any positive integer $n$

Let $n \geq 2$ be a positive integer and define $k$ to be the number of primes $\leq n$. Let $A$ be a subset of $S = \{2,...,n\}$ such that $|A| \leq k$ and no two elements in $A$ divide each other. Show that one can find a set $B$ such that $|B| = k$, $A \subseteq B \subseteq S$ and no two elements in $B$ divide each other.

[url=https://artofproblemsolving.com/community/c675693][b]Macedonia JBMO TST 2017[/b][/url] [url=http://artofproblemsolving.com/community/c6h1663908p10569198][b]Problem 1[/b][/url]. Let $p$ be a prime number such that $3p+10$ is a sum of squares of six consecutive positive integers. Prove that $p-7$ is divisible by $36$. [url=http://artofproblemsolving.com/community/c6h1663916p10569261][b]Problem 2[/b][/url]. In the triangle $ABC$, the medians $AA_1$, $BB_1$, and $CC_1$ are concurrent at a point $T$ such that $BA_1=TA_1$. The points $C_2$ and $B_2$ are chosen on the extensions of $CC_1$ and $BB_2$, respectively, such that $$C_1C_2 = \frac{CC_1}{3} \quad \text{and} \quad B_1B_2 = \frac{BB_1}{3}.$$ Show that $TB_2AC_2$ is a rectangle. [url=http://artofproblemsolving.com/community/c6h1663918p10569305][b]Problem 3[/b][/url]. Let $x,y,z$ be positive reals such that $xyz=1$. Show that $$\frac{x^2+y^2+z}{x^2+2} + \frac{y^2+z^2+x}{y^2+2} + \frac{z^2+x^2+y}{z^2+2} \geq 3.$$ When does equality happen? [url=http://artofproblemsolving.com/community/c6h1663920p10569326][b]Problem 4[/b][/url]. In triangle $ABC$, the points $X$ and $Y$ are chosen on the arc $BC$ of the circumscribed circle of $ABC$ that doesn't contain $A$ so that $\measuredangle BAX = \measuredangle CAY$. Let $M$ be the midpoint of the segment $AX$. Show that $$BM + CM > AY.$$ [url=http://artofproblemsolving.com/community/c6h1663922p10569370][b]Problem 5[/b][/url]. Find all the positive integers $n$ so that $n$ has the same number of digits as its number of different prime factors and the sum of these different prime factors is equal to the sum of exponents of all these primes in factorization of $n$.

Is there any numbber $n$, such that the sum of its digits in the decimal notation is $1000$, and the sum of its square digits in the decimal notation is $1000000$?

Determine all integers $k$ for which there exists a function $f: \mathbb{Z}_{>0} \to \mathbb{Z}$ such that $f(2023) = 2024$ and $f(ab) = f(a) + f(b) + kf(\gcd(a,b))$ for all positive integers $a$ and $b$.

Prove that the equation $x^2 + x + 1 = py$ has solution $(x,y)$ for the infinite number of simple $p$.

Find all natural numbers $N$ for which $N(N-101)$ is a perfect square.

Let $(a_n )_{n\ge 1}$ be a sequence of integers that satisfies \[a_n = a_{n-1} -\text{min}(a_{n-2} , a_{n-3} )\] for all $n \ge 4$. Prove that for every positive integer $k$, there is an $n$ such that $a_n$ is divisible by $3^k$ .

Let be a finite group $ G $ that has an element $ a\neq 1 $ for which exists a prime number $ p $ such that $ x^{1+p}=a^{-1}xa, $ for all $ x\in G. $ [b]a)[/b] Prove that the order of $ G $ is a power of $ p. $ [b]b)[/b] Show that $ H:=\{x\in G|\text{ord} (x)=p\}\le G $ and $ \text{ord}^2(H)>\text{ord}(G). $

Find all integer values of $x$ for which the value of the expression \[x^2+6x+33\] is a perfect square.

An $\textit{Euclidean step}$ transforms a pair $(a, b)$ of positive integers, $a > b$, to the pair $(b, r)$, where $r$ is the remainder when a is divided by $b$. Let us call the $\textit{complexity}$ of a pair $(a, b)$ the number of Euclidean steps needed to transform it to a pair of the form $(s, 0)$. Prove that if $ad - bc = 1$, then the complexities of $(a, b)$ and $(c, d)$ differ at most by $2$.

Find the greatest prime factor of $20!+20!+21!$.

Let $n(n>1)$ be an odd. We define $x_k=(x^{(k)}_1,x^{(k)}_2,\cdots ,x^{(k)}_n)$ as follow: $x_0=(x^{(0)}_1,x^{(0)}_2,\cdots ,x^{(0)}_n)=(1,0,\cdots ,0,1)$; $ x^{(k)}_i =\begin{cases}0, \quad x^{(k-1)}_i=x^{(k-1)}_{i+1},\\ 1, \quad x^{(k-1)}_i\not= x^{(k-1)}_{i+1},\end{cases} $ $i=1,2,\cdots ,n$, where $x^{(k-1)}_{n+1}= x^{(k-1)}_1$. Let $m$ be a positive integer satisfying $x_0=x_m$. Prove that $m$ is divisible by $n$.

Consider the polynomial f(x) = cx(x - 2) where $c$ is a positive real number. For any $n \in Z^+$, the notation $g_n(x)$ is a composite function $n$ times of $f$ and assume that the equation $g_n(x) = 0$ has all of the $2^n$ solutions are real numbers. 1. For $c = 5$, find in terms of $n$, the sum of all the solutions of $g_n(x)$, of which each multiple (if any) is counted only once. 2. Prove that $c\ge 1$.

A single section at a stadium can hold either $7$ adults or $11$ children. When $N$ sections are completely lled, an equal number of adults and children will be seated in them. What is the least possible value of $N$?

Find the total number of primes $p<100$ such that $\lfloor (2+\sqrt{5})^p \rfloor-2^{p+1}$ is divisible by $p$. Here $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$.

Suppose that $a$ and $ b$ are positive integers such that $$c = a +\frac{b}{a} -\frac{1}{b}$$ is an integer. Prove that $c$ is a perfect square.