[b]p1.[/b] Consider a cube with side length $2$. Take any one of its vertices and consider the three midpoints of the three edges emanating from that vertex. What is the distance from that vertex to the plane formed by those three midpoints? [b]p2.[/b] Digits $H$, $M$, and $C$ satisfy the following relations where $\overline{ABC}$ denotes the number whose digits in base $10$ are $A$, $B$, and $C$. $$\overline{H}\times \overline{H} = \overline{M}\times \overline{C} + 1$$ $$\overline{HH}\times \overline{H} = \overline{MC}\times \overline{C} + 1$$ $$\overline{HHH}\times \overline{H} = \overline{MCC}\times \overline{C} + 1$$ Find $\overline{HMC}$. [b]p3.[/b] Two players play the following game on a table with fair two-sided coins. The first player starts with one, two, or three coins on the table, each with equal probability. On each turn, the player flips all the coins on the table and counts how many coins land heads up. If this number is odd, a coin is removed from the table. If this number is even, a coin is added to the table. A player wins when he/she removes the last coin on the table. Suppose the game ends. What is the probability that the first player wins? [b]p4.[/b] Cyclic quadrilateral $[BLUE]$ has right $\angle E$. Let $R$ be a point not in $[BLUE]$. If $[BLUR] =[BLUE]$, $\angle ELB = 45^o$, and $\overline{EU} = \overline{UR}$, find $\angle RUE$. [b]p5.[/b] There are two tracks in the $x, y$ plane, defined by the equations $$y =\sqrt{3 - x^2}\,\,\, \text{and} \,\,\,y =\sqrt{4- x^2}$$ A baton of length $1$ has one end attached to each track and is allowed to move freely, but no end may be picked up or go past the end of either track. What is the maximum area the baton can sweep out? [b]p6.[/b] For integers $1 \le a \le 2$, $1 \le b \le 10$,$ 1 \le c \le 12$, $1 \le d \le 18$, let $f(a, b, c, d)$ be the unique integer between $0$ and $8150$ inclusive that leaves a remainder of a when divided by $3$, a remainder of $b$ when divided by $11$, a remainder of $c$ when divided by $13$, and a remainder of $d$ when divided by $19$. Compute $$\sum_{a+b+c+d=23}f(a, b, c, d).$$ [b]p7.[/b] Compute $\cos ( \theta)$ if $$\sum^{\infty}_{n=0} \frac{ \cos (n\theta)}{3^n} = 1.$$ [b]p8.[/b] How many solutions does this equation $$\left(\frac{a+b}{2}\right)^2=\left(\frac{b+c}{2019}\right)^2$$ have in positive integers $a, b, c$ that are all less than $2019^2$? [b]p9.[/b] Consider a square grid with vertices labeled $1, 2, 3, 4$ clockwise in that order. Fred the frog is jumping between vertices, with the following rules: he starts at the vertex label $1$, and at any given vertex he jumps to the vertex diagonally across from him with probability $\frac12$ and the vertices adjacent to him each with probability $\frac14$ . After $2019$ jumps, suppose the probability that the sum of the labels on the last two vertices he has visited is $3$ can be written as $2^{-m} -2^{-n}$ for positive integers $m,n$. Find $m + n$. [b]p10.[/b] The base ten numeral system uses digits $0-9$ and each place value corresponds to a power of $10$. For example, $$2019 = 2 \cdot 10^3 + 0 \cdot 10^2 + 1 \cdot 10^1 + 9 \cdot 10^0.$$ Let $\phi =\frac{1 +\sqrt5}{2}$. We can define a similar numeral system, base , where we only use digits $0$ and $1$, and each place value corresponds to a power of . For example, $$11.01 = 1 \cdot \phi^1 + 1 \cdot \phi^0 + 0 \cdot \phi^{-1} + 1 \cdot \phi^{-2}$$ Note that base  representations are not unique, because, for example, $100_{\phi} = 11_{\phi}$. Compute the base $\phi$ representation of $7$ with the fewest number of $1$s. [b]p11.[/b] Let $ABC$ be a triangle with $\angle BAC = 60^o$ and with circumradius $1$. Let $G$ be its centroid and $D$ be the foot of the perpendicular from $A$ to $BC$. Suppose $AG =\frac{\sqrt6}{3}$ . Find $AD$. [b]p12.[/b] Let $f(a, b)$ be a function with the following properties for all positive integers $a \ne b$: $$f(1, 2) = f(2, 1)$$ $$f(a, b) + f(b, a) = 0$$ $$f(a + b, b) = f(b, a) + b$$ Compute: $$\sum^{2019}_{i=1} f(4^i - 1, 2^i) + f(4^i + 1, 2^i)$$ [b]p13.[/b] You and your friends have been tasked with building a cardboard castle in the two-dimensional Cartesian plane. The castle is built by the following rules: 1. There is a tower of height $2^n$ at the origin. 2. From towers of height $2^i \ge 2$, a wall of length $2^{i-1}$ can be constructed between the aforementioned tower and a new tower of height $2^{i-1}$. Walls must be parallel to a coordinate axis, and each tower must be connected to at least one other tower by a wall. If one unit of tower height costs $\$9$ and one unit of wall length costs $\$3$ and $n = 1000$, how many distinct costs are there of castles that satisfy the above constraints? Two castles are distinct if there exists a tower or wall that is in one castle but not in the other. [b]p14.[/b] For $n$ digits, $(a_1, a_2, ..., a_n)$ with $0 \le a_i < n$ for $i = 1, 2,..., n$ and $a_1 \ne 0$ define $(\overline{a_1a_2 ... a_n})_n$ to be the number with digits $a_1$, $a_2$, $...$, $a_n$ written in base $n$. Let $S_n = \{(a_1, a_2, a_3,..., a_n)| \,\,\, (n + 1)| (\overline{a_1a_2 ... a_n})_n, a_1 \ge 1\}$ be the set of $n$-tuples such that $(\overline{a_1a_2 ... a_n})_n$ is divisible by $n + 1$. Find all $n > 1$ such that $n$ divides $|S_n| + 2019$. [b]p15.[/b] Let $P$ be the set of polynomials with degree $2019$ with leading coefficient $1$ and non-leading coefficients from the set $C = \{-1, 0, 1\}$. For example, the function $f = x^{2019} - x^{42} + 1$ is in $P$, but the functions $f = x^{2020}$, $f = -x^{2019}$, and $f = x^{2019} + 2x^{21}$ are not in $P$. Define a [i]swap [/i]on a polynomial $f$ to be changing a term $ax^n$ to $bx^n$ where $b \in C$ and there are no terms with degree smaller than $n$ with coefficients equal to $a$ or $b$. For example, a swap from $x^{2019} + x^{17} - x^{15} + x^{10}$ to $x^{2019} + x^{17} - x^{15} - x^{10}$ would be valid, but the following swaps would not be valid: $$x^{2019} + x^3 \,\,\, \text{to} \,\,\, x^{2019}$$ $$x^{2019} + x^3 \,\,\, \text{to} \,\,\, x^{2019} + x^3 + x^2$$ $$x^{2019} + x^2 + x + 1 \,\,\, \text{to} \,\,\, x^{2019} - x^2 - x - 1$$ Let $B$ be the set of polynomials in $P$ where all non-leading terms have the same coefficient. There are $p$ polynomials that can be reached from each element of $B$ in exactly $s$ swaps, and there exist $0$ polynomials that can be reached from each element of $B$ in less than $s$ swaps. Compute $p \cdot s$, expressing your answer as a prime factorization. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find the function $\displaystyle{f : \mathbb{R}-\left\{ 0\,\right\} \rightarrow \mathbb{R} }$ such that $$f(x)+f(1-\frac{1}{x}) = \frac{1}{x},\,\,\, \forall x \in \mathbb{R}- \{ 0, 1\,\}$$ [i](-InnoXenT-)[/i]

In a game, a participant chooses a nine-digit positive integer $\overline{ABCDEFGHI}$ with distinct non-zero digits. The score of the participant is $A^{B^{C^{D^{E^{F^{G^{H^{I}}}}}}}}$. Which nine-digit number should be chosen in order to maximise the score?

Let $f: \mathbb{R}\to\mathbb{R}$ be a continuous function, and $a<b$ be two points in the image of $f$ (that is, there exists $x,y$ such that $f(x)=a$ and $f(y)=b$). Show that there is an interval $I$ such that $f(I)=[a,b]$.

For an integer $n \ge 1$ we consider sequences of $2n$ numbers, each equal to $0, -1$ or $1$. The [i]sum product value[/i] of such a sequence is calculated by first multiplying each pair of numbers from the sequence, and then adding all the results together. For example, if we take $n = 2$ and the sequence $0,1, 1, -1$, then we find the products $0\cdot 1, 0\cdot 1, 0\cdot -1, 1\cdot 1, 1\cdot -1, 1\cdot -1$. Adding these six results gives the sum product value of this sequence: $0+0+0+1+(-1)+(-1) = -1$. The sum product value of this sequence is therefore smaller than the sum product value of the sequence $0, 0, 0, 0$, which equals $0$. Determine for each integer $n \ge 1$ the smallest sum product value that such a sequence of $2n$ numbers could have. [i]Attention: you are required to prove that a smaller sum product value is impossible.[/i]

The price of a diamond is proportional to the square of its weight. Show that, breaking it into two parts, there is a depreciation of its value. When is it the maximum depreciation?

A polynomial $ f(x)\equal{}x^3\plus{}ax^2\plus{}bx\plus{}c$ is such that $ b<0$ and $ ab\equal{}9c$. Prove that the polynomial $ f$ has three different real roots.

The set $S\subseteq \mathbb{R}$ is given with the properties: $(a) \mathbb{Z}\subset S$, $(b) (\sqrt 2 +\sqrt 3)\in S$, $(c)$ If $x,y\in S$ then $x+y\in S$, and $(d)$ If $x,y\in S$ then $x\cdot y\in S$. Prove that $(\sqrt 2+\sqrt 3)^{-1}\in S$.

Consider infinite sequences $a_1,a_2,\dots$ of positive integers satisfying $a_1=1$ and $$a_n \mid a_k+a_{k+1}+\dots+a_{k+n-1}$$ for all positive integers $k$ and $n.$ For a given positive integer $m,$ find the maximum possible value of $a_{2m}.$ [i]Proposed by Krit Boonsiriseth[/i]

Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that for every $x,y\in\mathbb{R}$ the following equality holds: $$f(xf(y)+x^2+y)=f(x)f(y)+xf(x)+f(y).$$

Prove that for a prime $p$, $x^{p-1}+x^{p-2}+ \cdots +x+1$ is irreducible in $\mathbb{Q}[x]$.

Suppose that $p>3$ is prime. Prove that the products of the primitive roots of $p$ between $1$ and $p-1$ is congruent to $1$ modulo $p$.

Let $n$ be a positive integer. Find the number of all polynomials $P$ with coefficients from the set $\{0,1,2,3\}$ and for which $P(2)=n$.

Show that, if $a,b,...,n$ are distinct natural numbers, none divisible by any primes greater than $3$, then $$\frac{1}{a}+\frac{1}{b}+...+ \frac{1}{n}< 3$$

Determine all possible values of the expression$$x-\left [\frac{x}{2}\right ]-\left [\frac{x}{3}\right ]-\left [\frac{x} {6}\right ]$$by varying $x$ in the real numbers. Clarification: The brackets indicate the integer part of the number they enclose.

Let $\Bbb{Z}^+$ denote the set of positive integers. Find all functions $f:\Bbb{Z}^+\to \Bbb{Z}^+$ that satisfy the following condition: for each positive integer $n,$ there exists a positive integer $k$ such that $$\sum_{i=1}^k f_i(n)=kn,$$ where $f_1(n)=f(n)$ and $f_{i+1}(n)=f(f_i(n)),$ for $i\geq 1. $

Define the polymonial sequence $\left \{ f_n\left ( x \right ) \right \}_{n\ge 1}$ with $f_1\left ( x \right )=1$, $$f_{2n}\left ( x \right )=xf_n\left ( x \right ), \; f_{2n+1}\left ( x \right ) = f_n\left ( x \right )+ f_{n+1} \left ( x \right ), \; n\ge 1.$$ Look for all the rational number $a$ which is a root of certain $f_n\left ( x \right ).$

Let $D$ be the interior of the circle $C$ and let $A \in C$. Show that the function $f : D \to \mathbb R, f(M)=\frac{|MA|}{|MM'|}$ where $M' = AM \cap C$, is strictly convex; i.e., $f(P) <\frac{f(M_1)+f(M_2)}{2}, \forall M_1,M_2 \in D, M_1 \neq M_2$ where $P$ is the midpoint of the segment $M_1M_2.$

In the sequence of the natural (i.e. positive integers) numbers every member from the third equals the absolute value of the difference of the two previous. What is the maximal possible length of such a sequence, if every member is less or equal to $1967$?

Let $\mathbb{Z}$ be the set of integers. Find all functions $f : \mathbb{Z} \to \mathbb{Z}$ such that for all integers $a$ and $b$, we have: $$f(a^2+ab)+f(b^2+ab)=(a+b)f(a+b).$$ Proposed by Heidar Shushtari

Let $X = Q-\{-1,0,1\}$. We consider the function $f: X\to X$ given by $f (x) = x -\frac{1}{x} .$ Is there an $a \in X$ such that for every natural number n there is a $y \in X$ with $f (f (...( f (y)) ...)) = a$ where $f$ occurs exactly $n$ times on the left side?

For any natural number $ n\ge 2, $ define $ m(n) $ to be the minimum number of elements of a set $ S $ that simultaneously satisfy: $ \text{(i)}\quad \{ 1,n\} \subset S\subset \{ 1,2,\ldots ,n\} $ $ \text{(ii)}\quad $ any element of $ S, $ distinct from $ 1, $ is equal to the sum of two (not necessarily distinct) elements from $ S. $ [b]a)[/b] Prove that $ m(n)\ge 1+\left\lfloor \log_2 n \right\rfloor ,\quad\forall n\in\mathbb{N}_{\ge 2} . $ [b]b)[/b] Prove that there are infinitely many natural numbers $ n\ge 2 $ such that $ m(n)=m(n+1). $ $ \lfloor\rfloor $ denotes the usual integer part.

Find all functions $f:\mathbb{Z}_{\ge 1}\to \mathbb{R}_{>0}$ such that for all positive integers $n$ the following relation holds: $$\sum_{d|n} f(d)^3=\left (\sum_{d|n} f(d) \right )^2,$$ where both sums are taken over the positive divisors of $n$. [i] (Vlad Robu) [/i]

For any positive integer $n$, we define $$S_n=\sum_{k=1}^n \frac{2^k}{k^2}.$$ Prove that there are no polynomials $P,Q$ with real coefficients such that for any positive integer $n$, we have $\frac{S_{n+1}}{S_n}=\frac{P(n)}{Q(n)}$.

Does there exist a function $f: \mathbb{R}\rightarrow\mathbb{R}$ such that $f(x+f(y))=f(x)+\sin y$, for all reals $x,y$ ?