$S$ is a subset of Natural numbers which has infinite members. $$S’=\left\{x^y+y^x: \, x,y\in S, \, x\neq y\right\}$$ Prove the set of prime divisors of $S’$ has also infinite members [i]Proposed by Yahya Motevassel[/i]

There is a unique positive integer $n$ such that \[\log_2{(\log_{16}{n})} = \log_4{(\log_4{n})}.\] What is the sum of the digits of $n?$ $\textbf{(A) } 4 \qquad \textbf{(B) } 7 \qquad \textbf{(C) } 8 \qquad \textbf{(D) } 11 \qquad \textbf{(E) } 13$

Positive intenger $n\geq3$. $a_1,a_2,\cdots,a_n$ are $n$ positive intengers that are pairwise coprime, satisfying that there exists $k_1,k_2,\cdots,k_n\in\{-1,1\}, \sum_{i=1}^{n}k_ia_i=0$. Are there positive intengers $b_1,b_2,\cdots,b_n$, for any $k\in\mathbb{Z}_+$, $b_1+ka_1,b_2+ka_2,\cdots,b_n+ka_n$ are pairwise coprime?

Let $ R_1,R_2, \ldots$ be the family of finite sequences of positive integers defined by the following rules: $ R_1 \equal{} (1),$ and if $ R_{n - 1} \equal{} (x_1, \ldots, x_s),$ then \[ R_n \equal{} (1, 2, \ldots, x_1, 1, 2, \ldots, x_2, \ldots, 1, 2, \ldots, x_s, n).\] For example, $ R_2 \equal{} (1, 2),$ $ R_3 \equal{} (1, 1, 2, 3),$ $ R_4 \equal{} (1, 1, 1, 2, 1, 2, 3, 4).$ Prove that if $ n > 1,$ then the $ k$th term from the left in $ R_n$ is equal to 1 if and only if the $ k$th term from the right in $ R_n$ is different from 1.

It is known that the graph of the function $y = f(x)$ after a rotation of $45^o$ around a certain point turns into the graph of the function $y = x^3 + ax^2 + 19x + 97$. At what $a$ is this possible?

There are $n \ge 2$ positive integers written on the whiteboard. A move consists of three steps: calculate the least common multiple $N$ of all numbers then choose any number $a$ and replace $a$ by $N/a$ . Prove that, using a finite number of moves, you can always make all the numbers on the whiteboard equal to $ 1$.

Each term of an infinite sequence of natural numbers is obtained from the previous term by adding to it one of its nonzero digits. Prove that this sequence contains an even number.

Let $a_1,a_2,\cdots$ be a strictly increasing sequence on positive integers. Is it always possible to partition the set of natural numbers $\mathbb{N}$ into infinitely many subsets with infinite cardinality $A_1,A_2,\cdots$, so that for every subset $A_i$, if we denote $b_1<b_2<\cdots$ be the elements of $A_i$, then for every $k\in \mathbb{N}$ and for every $1\le i\le a_k$, it satisfies $b_{i+1}-b_{i}\le k$?

We define the sequence $a_n=(2n)^2+1$ for each natural number $n$. We will call one number [i]bad[/i], if there don’t exist natural numbers $a>1$ and $b>1$ such that $a_n=a^2+b^2$. Prove that the natural number $n$ is [i]bad[/i], if and only if $a_n$ is prime.

Let $ n$ be a positive integer and let $ a_1,a_2,a_3,\ldots,a_k$ $ ( k\ge 2)$ be distinct integers in the set $ { 1,2,\ldots,n}$ such that $ n$ divides $ a_i(a_{i + 1} - 1)$ for $ i = 1,2,\ldots,k - 1$. Prove that $ n$ does not divide $ a_k(a_1 - 1).$ [i]Proposed by Ross Atkins, Australia [/i]

Let $n \geq 3$ be an integer and $a_1,a_2,...,a_n$ be positive real numbers such that $m$ is the smallest and $M$ is the largest of these numbers. It is known that for any distinct integers $1 \leq i,j,k \leq n$, if $a_i \leq a_j \leq a_k$ then $a_ia_k \leq a_j^2$. Show that \[ a_1a_2 \cdots a_n \geq m^2M^{n-2} \] and determine when equality holds

Determine the largest real number $c$ such that for any $2017$ real numbers $x_1, x_2, \dots, x_{2017}$, the inequality $$\sum_{i=1}^{2016}x_i(x_i+x_{i+1})\ge c\cdot x^2_{2017}$$ holds.

Lil Wayne, the rain god, determines the weather. If Lil Wayne makes it rain on any given day, the probability that he makes it rain the next day is $75\%$. If Lil Wayne doesn't make it rain on one day, the probability that he makes it rain the next day is $25\%$. He decides not to make it rain today. Find the smallest positive integer $n$ such that the probability that Lil Wayne [i]makes it rain[/i] $n$ days from today is greater than $49.9\%$.

The nonzero numbers $x{}$ and $y{}$ satisfy the inequalities $x^{2n}-y^{2n}>x$ and $y^{2n}-x^{2n}>y$ for some natural number $n{}$. Can the product $xy$ be a negative number? [i]Proposed by N. Agakhanov[/i]

Let $n>1$ be an integer. A set $S \subset \{ 0,1,2, \ldots, 4n-1\}$ is called [i]rare[/i] if, for any $k\in\{0,1,\ldots,n-1\}$, the following two conditions take place at the same time (1) the set $S\cap \{4k-2,4k-1,4k, 4k+1, 4k+2 \}$ has at most two elements; (2) the set $S\cap \{4k+1,4k+2,4k+3\}$ has at most one element. Prove that the set $\{0,1,2,\ldots,4n-1\}$ has exactly $8 \cdot 7^{n-1}$ rare subsets.

Find all pairs $(n,r)$ with $n$ a positive integer and $r$ a real such that $2x^2+2x+1$ divides $(x+1)^n - r$.

Let $S$ be the set of all triangles $ABC$ for which \[ 5 \left( \dfrac{1}{AP} + \dfrac{1}{BQ} + \dfrac{1}{CR} \right) - \dfrac{3}{\min\{ AP, BQ, CR \}} = \dfrac{6}{r}, \] where $r$ is the inradius and $P, Q, R$ are the points of tangency of the incircle with sides $AB, BC, CA,$ respectively. Prove that all triangles in $S$ are isosceles and similar to one another.

[i](5 pts)[/i] Let $n$ be a positive integer, $K = \{1, 2, \dots, n\}$, and $\sigma : K \rightarrow K$ be a function with the property that $\sigma(i) = \sigma(j)$ if and only if $i = j$ (in other words, $\sigma$ is a \textit{bijection}). Show that there is a positive integer $m$ such that \[ \underbrace{\sigma(\sigma( \dots \sigma(i) \dots ))}_\textrm{$m$ times} = i \] for all $i \in K$.

To $m$ ounces of a $m\%$ solution of acid, $x$ ounces of water are added to yield a $(m-10)\%$ solution. If $m>25$, then $x$ is $\textbf{(A)}\ \frac{10m}{m-10} \qquad \textbf{(B)}\ \frac{5m}{m-10} \qquad \textbf{(C)}\ \frac{m}{m-10} \qquad \textbf{(D)}\ \frac{5m}{m-20} \\ \textbf{(E)}\ \text{not determined by the given information}$

$ a,b,c,d,e,f $ are real numbers. It is true that: $ a+b+c+d+e+f=20 $ $ (a-2)^2+(b-2)^2+...+(f-2)^2=24 $ Find the maximum value of d.

Let $ ABCD$ be an isosceles trapezium with $ AB \parallel{} CD$ and $ \bar{BC} \equal{} \bar{AD}.$ The parallel to $ AD$ through $ B$ meets the perpendicular to $ AD$ through $ D$ in point $ X.$ The line through $ A$ drawn which is parallel to $ BD$ meets the perpendicular to $ BD$ through $ D$ in point $ Y.$ Prove that points $ C,X,D$ and $ Y$ lie on a common circle.

Pablo and Nacho write together a succession of positive integers of $2006$ terms, according to the following rules: Pablo begins, who in his first turn writes $1$, and from then on, each one in his turn writes an integer positive that is greater than or equal to the last number that the opponent wrote and less than or equal to triple the last number that the opponent wrote. When the two of them have written the $2006$ numbers, the sum $S$ of the first $ 2005$ numbers written (all except the last one) and the sum $T$ of the $2006$ numbers written. If $S$ and $T $ are co-cousins, Nacho wins. Otherwise, Pablo wins. Determine which of the two players has a winning strategy, describe the strategy and demonstrate that it is a winning one.

John can purchase pieces of gum in packs of $4$, $14$, and $20$ pieces. Given that he purchases at least one of each kind of pack, what is the positive difference between the greatest and least number of packs he can purchase to end up with exactly $86$ pieces of gum? $\textbf{(A) }5\qquad\textbf{(B) }6\qquad\textbf{(C) }7\qquad\textbf{(D) }8\qquad\textbf{(E) }9$

Let $A$ and $B$ be two sets such that $A \cup B$ is the set of the positive integers, and $A \cap B$ is the empty set. It is known that if two positive integers have a prime larger than $2013$ as their difference, then one of them is in $A$ and the other is in $B$. Find all the possibilities for the sets $A$ and $B$.

Determine all the complex numbers $w = a + bi$ with $a, b \in \mathbb{R}$, such that there exists a polinomial $p(z)$ whose coefficients are real and positive such that $p(w) = 0.$