For a positive integer $k$, define the $k$-[i]pop[/i] of a positive integer $n$ as the infinite sequence of integers $a_1, a_2, ...$ such that $a_1 = n$ and $$a_{i+1}= \left\lfloor \frac{a_i}{k} \right\rfloor , i = 1, 2, ..$$ where $ \lfloor x\rfloor $ denotes the greatest integer less than or equal to $x$. Furthermore, define a positive integer $m$ to be $k$-[i]pop avoiding[/i] if $k$ does not divide any nonzero term in the $k$-pop of $m$. For example, $14$ is 3-pop avoiding because $3$ does not divide any nonzero term in the $3$-pop of $14$, which is $14, 4, 1, 0, 0, ....$ Suppose that the number of positive integers less than $13^{2018}$ which are $13$-pop avoiding is equal to N. What is the remainder when $N$ is divided by $1000$?

Find the largest $ 85$-digit integer which has property: the sum of its digits equals to the product of its digits.

Let $b$ be a number greater than $5$. For each positive integer $n$, consider the number $$x_n=\underbrace{11\ldots1}_{n-1}\underbrace{22\ldots2}_n5,$$ written in base $b$. Prove that the following condition holds if and only if $b=10$: There exists a positive integer $M$ such that for every integer $n$ greater than $M$, the number $x_n$ is a perfect square.

Thirty numbers are arranged on a circle in such a way that each number equals the absolute difference of its two neighbors. Given that the sum of the numbers is $2000$, determine the numbers.

Let $ p$ and $ q$ be relatively prime positive integers. A subset $ S$ of $ \{0, 1, 2, \ldots \}$ is called [b]ideal[/b] if $ 0 \in S$ and for each element $ n \in S,$ the integers $ n \plus{} p$ and $ n \plus{} q$ belong to $ S.$ Determine the number of ideal subsets of $ \{0, 1, 2, \ldots \}.$

Eight consecutive numbers are chosen from the Fibonacci sequence $1, 2, 3, 5, 8, 13, 21,...$. Prove that the sequence does not contain the sum of chosen numbers.

[b]p1.[/b] Denote $S_n = 1 + \frac12 + \frac13 + ...+ \frac{1}{n}$. What is $144169\cdot S_{144169} - (S_1 + S_2 + ... + S_{144168})$? [b]p2.[/b] Let $A,B,C$ be three collinear points, with $AB = 4$, $BC = 8$, and $AC = 12$. Draw circles with diameters $AB$, $BC$, and $AC$. Find the radius of the two identical circles that will lie tangent to all three circles. [b]p3.[/b] Let $s(i)$ denote the number of $1$’s in the binary representation of $i$. What is $$\sum_{x=1}{314}\left( \sum_{i=0}^{2^{576}-2} x^{s(i)} \right) \,\, mod \,\,629 ?$$ [b]p4.[/b] Parallelogram $ABCD$ has an area of $S$. Let $k = 42$. $E$ is drawn on AB such that $AE =\frac{AB}{k}$ . $F$ is drawn on $CD$ such that $CF = \frac{CD}{k}$ . $G$ is drawn on $BC$ such that $BG = \frac{BC}{k}$ . $H$ is drawn on $AD$ such that $DH = \frac{AD}{k}$ . Line $CE$ intersects $BH$ at $M$, and $DG$ at $N$. Line $AF$ intersects $DG$ at $P$, and $BH$ at $Q$. If $S_1$ is the area of quadrilateral $MNPQ$, find $\frac{S_1}{S}$. [b]p5.[/b] Let $\phi$ be the Euler totient function. What is the sum of all $n$ for which $\frac{n}{\phi(n)}$ is maximal for $1 \le n \le 500$? [b]p6.[/b] Link starts at the top left corner of an $12 \times 12$ grid and wants to reach the bottom right corner. He can only move down or right. A turn is defined a down move immediately followed by a right move, or a right move immediately followed by a down move. Given that he makes exactly $6$ turns, in how many ways can he reach his destination? PS. You had better use hide for answers.

Find all positive integers $d$ with the following property: there exists a polynomial $P$ of degree $d$ with integer coefficients such that $\left|P(m)\right|=1$ for at least $d+1$ different integers $m$.

What is the smallest positive integer $n$ such that $2016n$ is a perfect cube?

[b]p1.[/b] Let $A(S)$ denote the average value of a set $S$. Let $T$ be the set of all subsets of the set $\{1, 2, 3, 4, ... , 2012\}$, and let $R$ be $\{A(K)|K \in T \}$. Compute $A(R)$. [b]p2.[/b] Consider the minute and hour hands of the Campanile, our clock tower. During one single day ($12:00$ AM - $12:00$ AM), how many times will the minute and hour hands form a right-angle at the center of the clock face? [b]p3.[/b] In a regular deck of $52$ face-down cards, Billy flips $18$ face-up and shuffles them back into the deck. Before giving the deck to Penny, Billy tells her how many cards he has flipped over, and blindfolds her so she can’t see the deck and determine where the face-up cards are. Once Penny is given the deck, it is her job to split the deck into two piles so that both piles contain the same number of face-up cards. Assuming that she knows how to do this, how many cards should be in each pile when he is done? [b]p4.[/b] The roots of the equation $x^3 + ax^2 + bx + c = 0$ are three consecutive integers. Find the maximum value of $\frac{a^2}{b+1}$. [b]p5.[/b] Oski has a bag initially filled with one blue ball and one gold ball. He plays the following game: first, he removes a ball from the bag. If the ball is blue, he will put another blue ball in the bag with probability $\frac{1}{437}$ and a gold ball in the bag the rest of the time. If the ball is gold, he will put another gold ball in the bag with probability $\frac{1}{437}$ and a blue ball in the bag the rest of the time. In both cases, he will put the ball he drew back into the bag. Calculate the expected number of blue balls after $525600$ iterations of this game. [b]p6.[/b] Circles $A$ and $B$ intersect at points $C$ and $D$. Line $AC$ and circle $B$ meet at $E$, line $BD$ and circle $A$ meet at $F$, and lines $EF$ and $AB$ meet at $G$. If $AB = 10$, $EF = 4$, $FG = 8$, find $BG$. PS. You had better use hide for answers.

We say that two sequences $x,y \colon \mathbb{N} \to \mathbb{N}$ are [i]completely different[/i] if $x_n \neq y_n$ holds for all $n\in \mathbb{N}$. Let $F$ be a function assigning a natural number to every sequence of natural numbers such that $F(x)\neq F(y)$ for any pair of completely different sequences $x$, $y$, and for constant sequences we have $F \left((k,k,\dots)\right)=k$. Prove that there exists $n\in \mathbb{N}$ such that $F(x)=x_{n}$ for all sequences $x$.

[b]p16[/b] Madelyn is being paid $\$50$/hour to find useful [i]Non-Functional Trios[/i], where a Non-Functional Trio is defined as an ordered triple of distinct real numbers $(a, b, c)$, and a Non- Functional Trio is [i]useful [/i] if $(a, b)$, $(b, c)$, and $(c, a)$ are collinear in the Cartesian plane. Currently, she’s working on the case $a+b+c = 2022$. Find the number of useful Non-Functional Trios $(a, b, c)$ such that $a + b + c = 2022$. [b]p17[/b] Let $p(x) = x^2 - k$, where $k$ is an integer strictly less than $250$. Find the largest possible value of k such that there exist distinct integers $a, b$ with $p(a) = b$ and $p(b) = a$. [b]p18[/b] Let $ABC$ be a triangle with orthocenter $H$ and circumcircle $\Gamma$ such that $AB = 13$, $BC = 14$, and $CA = 15$. $BH$ and $CH$ meet $\Gamma$ again at points $D$ and $E$, respectively, and $DE$ meets $AB$ and $AC$ at $F$ and $G$, respectively. The circumcircles of triangles $ABG$ and $ACF$ meet BC again at points $P$ and $Q$. If $PQ$ can be expressed as $\frac{a}{b}$ for positive integers $a, b$ with $gcd (a, b) = 1$, find $a + b$.

We say that a set $S$ of integers is [i]rootiful[/i] if, for any positive integer $n$ and any $a_0, a_1, \cdots, a_n \in S$, all integer roots of the polynomial $a_0+a_1x+\cdots+a_nx^n$ are also in $S$. Find all rootiful sets of integers that contain all numbers of the form $2^a - 2^b$ for positive integers $a$ and $b$.

Let $d(n)$ be the number of divisors of a nonnegative integer $n$ (we set $d(0)=0$). Find all positive integers $d$ such that there exists a two-variable polynomial $P(x,y)$ of degree $d$ with integer coefficients such that: [list] [*] for any positive integer $y$, there are infinitely many positive integers $x$ such that $\gcd(x,y)=1$ and $d(|P(x,y)|) \mid x$, and [*] for any positive integer $x$, there are infinitely many positive integers $y$ such that $\gcd(x,y)=1$ and $d(|P(x,y)|) \mid y$. [/list] [i]Allen Wang[/i]

Find the maximum number of pairwise disjoint sets of the form $S_{a,b} = \{n^{2}+an+b | n \in \mathbb{Z}\}$, $a, b \in \mathbb{Z}$.

Associate to any point $ (h,k) $ in the integer net of the cartesian plane a real number $ a_{h,k} $ so that $$ a_{h,k}=\frac{1}{4}\left( a_{h-1,k} +a_{h+1,k}+a_{h,k-1}+a_{h,k+1}\right) ,\quad\forall h,k\in\mathbb{Z} . $$ [b]a)[/b] Prove that it´s possible that all the elements of the set $ A:=\left\{ a_{h,k}\big| h,k\in\mathbb{Z}\right\} $ are different. [b]b)[/b] If so, show that the set $ A $ hasn´t any kind of boundary.

Let $x,y$ and $z$ be positive real numbers that satisfy the following system of equations: $$\log_2\left({x \over yz}\right) = {1 \over 2}$$ $$\log_2\left({y \over xz}\right) = {1 \over 3}$$ $$\log_2\left({z \over xy}\right) = {1 \over 4}$$ Then the value of $\left|\log_2(x^4y^3z^2)\right|$ is ${m \over n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$

Let $n \geq 0$ be an integer. Prove that \[ \lceil \sqrt n +\sqrt{n+1}+\sqrt{n+2} \rceil = \lceil \sqrt{9n+8} \rceil\] Where $\lceil x \rceil $ is the smallest integer which is greater or equal to $x.$

Let $a_1,a_2 \dots a_n$ and $x_1, x_2 \dots x_n$ be integers and $r\geq 2$ be an integer. It is known that \[\sum_{j=0}^{n} a_j x_j^k =0 \qquad \text{for} \quad k=1,2, \dots r.\] Prove that \[\sum_{j=0}^{n} a_j x_j^m \equiv 0 \pmod m, \qquad \text{for all}\quad m \in \{ r+1, r+2, \cdots, 2r+1 \}.\]

Which number is bigger : the number of positive integers not exceeding 1000000 that can be represented by the form $2x^{2}-3y^{2}$ with integral $x$ and $y$ or that of positive integers not exceeding 1000000 that can be represented by the form $10xy-x^{2}-y^{2}$ with integral $x$ and $y?$ [i]Proposed by A. Golovanov[/i]

Prove that for every square-free integer $n>1$, there exists a prime number $p$ and an integer $m$ satisfying \[ p \mid n \quad \text{and} \quad n \mid p^2+p\cdot m^p. \]

Suppose $\, q_{0}, \, q_{1}, \, q_{2}, \ldots \; \,$ is an infinite sequence of integers satisfying the following two conditions: (i) $\, m-n \,$ divides $\, q_{m}-q_{n}\,$ for $\, m > n \geq 0,$ (ii) there is a polynomial $\, P \,$ such that $\, |q_{n}| < P(n) \,$ for all $\, n$ Prove that there is a polynomial $\, Q \,$ such that $\, q_{n}= Q(n) \,$ for all $\, n$.

Show that $n$ divides $2^n + 1$ for infinitely many positive integers $n$.

Let $a$ be a fixed integer. Find all integer solutions $x, y, z$ of the system \[5x + (a + 2)y + (a + 2)z = a,\]\[(2a + 4)x + (a^2 + 3)y + (2a + 2)z = 3a - 1,\]\[(2a + 4)x + (2a + 2)y + (a^2 + 3)z = a + 1.\]

We say that a set $S$ of integers is [i]rootiful[/i] if, for any positive integer $n$ and any $a_0, a_1, \cdots, a_n \in S$, all integer roots of the polynomial $a_0+a_1x+\cdots+a_nx^n$ are also in $S$. Find all rootiful sets of integers that contain all numbers of the form $2^a - 2^b$ for positive integers $a$ and $b$.