The non-decreasing functions $f,g: \mathbb{R}\rightarrow \mathbb{R}$ are such that $f(r)\leq g(r)$ for $\forall$ rational numbers $r$. Is it true that $f(x)\leq g(x)$ for $\forall$ real numbers $x$?

Given triangle $ ABC$. Let the tangent lines of the circumcircle of $ AB$ at $ B$ and $ C$ meet at $ A_0$. Define $ B_0$ and $ C_0$ similarly. a) Prove that $ AA_0,BB_0,CC_0$ are concurrent. b) Let $ K$ be the point of concurrency. Prove that $ KG\parallel BC$ if and only if $ 2a^2\equal{}b^2\plus{}c^2$.

Rohan keeps a total of 90 guppies in 4 fish tanks. There is 1 more guppy in the 2nd tank than the 1st tank. There are 2 more guppies the the 3rd tank than the 2nd tank. There are 3 more guppies in the 4th tank than the 3rd tank. How many guppies are in the 4th tank? $\textbf{(A) } 20\qquad\textbf{(B) } 21\qquad\textbf{(C) } 23\qquad\textbf{(D) } 24\qquad\textbf{(E) } 26$

[b]p1.[/b] Two robots race on the plane from $(0, 0)$ to $(a, b)$, where $a$ and $b$ are positive real numbers with $a < b$. The robots move at the same constant speed. However, the first robot can only travel in directions parallel to the lines $x = 0$ or $y = 0$, while the second robot can only travel in directions parallel to the lines $y = x$ or $y = -x$. Both robots take the shortest possible path to $(a, b)$ and arrive at the same time. Find the ratio $\frac{a}{b}$ . [b]p2.[/b] Suppose $x + \frac{1}{x} + y + \frac{1}{y} = 12$ and $x^2 + \frac{1}{x^2} + y^2 + \frac{1}{y^2} = 70$. Compute $x^3 + \frac{1}{x^3} + y^3 + \frac{1}{y^3}$. [b]p3.[/b] Find the largest non-negative integer $a$ such that $2^a$ divides $$3^{2^{2018}}+ 3.$$ [b]p4.[/b] Suppose $z$ and $w$ are complex numbers, and $|z| = |w| = z \overline{w}+\overline{z}w = 1$. Find the largest possible value of $Re(z + w)$, the real part of $z + w$. [b]p5.[/b] Two people, $A$ and $B$, are playing a game with three piles of matches. In this game, a move consists of a player taking a positive number of matches from one of the three piles such that the number remaining in the pile is equal to the nonnegative difference of the numbers of matches in the other two piles. $A$ and $B$ each take turns making moves, with $A$ making the first move. The last player able to make a move wins. Suppose that the three piles have $10$, $x$, and $30$ matches. Find the largest value of $x$ for which $A$ does not have a winning strategy. [b]p6.[/b] Let $A_1A_2A_3A_4A_5A_6$ be a regular hexagon with side length $1$. For $n = 1$,$...$, $6$, let $B_n$ be a point on the segment $A_nA_{n+1}$ chosen at random (where indices are taken mod $6$, so $A_7 = A_1$). Find the expected area of the hexagon $B_1B_2B_3B_4B_5B_6$. [b]p7.[/b] A termite sits at the point $(0, 0, 0)$, at the center of the octahedron $|x| + |y| + |z| \le 5$. The termite can only move a unit distance in either direction parallel to one of the $x$, $y$, or $z$ axes: each step it takes moves it to an adjacent lattice point. How many distinct paths, consisting of $5$ steps, can the termite use to reach the surface of the octahedron? [b]p8.[/b] Let $$P(x) = x^{4037} - 3 - 8 \cdot \sum^{2018}_{n=1}3^{n-1}x^n$$ Find the number of roots $z$ of $P(x)$ with $|z| > 1$, counting multiplicity. [b]p9.[/b] How many times does $01101$ appear as a not necessarily contiguous substring of $0101010101010101$? (Stated another way, how many ways can we choose digits from the second string, such that when read in order, these digits read $01101$?) [b]p10.[/b] A perfect number is a positive integer that is equal to the sum of its proper positive divisors, that is, the sum of its positive divisors excluding the number itself. For example, $28$ is a perfect number because $1 + 2 + 4 + 7 + 14 = 28$. Let $n_i$ denote the ith smallest perfect number. Define $$f(x) =\sum_{i|n_x}\sum_{j|n_i}\frac{1}{j}$$ (where $\sum_{i|n_x}$ means we sum over all positive integers $i$ that are divisors of $n_x$). Compute $f(2)$, given there are at least $50 $perfect numbers. [b]p11.[/b] Let $O$ be a circle with chord $AB$. The perpendicular bisector to $AB$ is drawn, intersecting $O$ at points $C$ and $D$, and intersecting $AB$ at the midpoint $E$. Finally, a circle $O'$ with diameter $ED$ is drawn, and intersects the chord $AD$ at the point $F$. Given $EC = 12$, and $EF = 7$, compute the radius of $O$. [b]p12.[/b] Suppose $r$, $s$, $t$ are the roots of the polynomial $x^3 - 2x + 3$. Find $$\frac{1}{r^3 - 2}+\frac{1}{s^3 - 2}+\frac{1}{t^3 - 2}.$$ [b]p13.[/b] Let $a_1$, $a_2$,..., $a_{14}$ be points chosen independently at random from the interval $[0, 1]$. For $k = 1$, $2$,$...$, $7$, let $I_k$ be the closed interval lying between $a_{2k-1}$ and $a_{2k}$ (from the smaller to the larger). What is the probability that the intersection of $I_1$, $I_2$,$...$, $I_7$ is nonempty? [b]p14.[/b] Consider all triangles $\vartriangle ABC$ with area $144\sqrt3$ such that $$\frac{\sin A \sin B \sin C}{ \sin A + \sin B + \sin C}=\frac14.$$ Over all such triangles $ABC$, what is the smallest possible perimeter? [b]p15.[/b] Let $N$ be the number of sequences $(x_1,x_2,..., x_{2018})$ of elements of $\{1, 2,..., 2019\}$, not necessarily distinct, such that $x_1 + x_2 + ...+ x_{2018}$ is divisible by $2018$. Find the last three digits of $N$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all integers $k\ge 3$ with the following property: There exist integers $m,n$ such that $1<m<k$, $1<n<k$, $\gcd (m,k)=\gcd (n,k) =1$, $m+n>k$ and $k\mid (m-1)(n-1)$.

Consider a polyhedron with at least five faces such that exactly three edges emerge from each of its vertices. Two players play the following game: Each, in turn, signs his or her name on a previously unsigned face. The winner is the player who first succeeds in signing three faces that share a common vertex. Show that the player who signs first will always win by playing as well as possible.

Let $C', A', B'$ be the midpoints of sides $[AB]$, $[BC]$, $[CA]$ of $\triangle ABC$, respectively. Let $H$ be the foot of perpendicular from $A$ to $BC$. If $|A'C'| = 6$, what is $|B'H|$? $ \textbf{a)}\ 5 \qquad\textbf{b)}\ 6 \qquad\textbf{c)}\ 5\sqrt 2 \qquad\textbf{d)}\ 6\sqrt 2 \qquad\textbf{e)}\ 7 $

In triangle $ABC$, $M$ is the point of intersection of the medians, $O$ is the center of the inscribed circle, $A', B', C'$ are the touchpoints with the sides $BC, CA, AB$, respectively. Prove that if $CA'= AB$, then $OM$ and $AB$ are perpendicular. PS. There is a a typo

We consider an integer $n > 1$ with the following property: for every positive divisor $d$ of $n$ we have that $d + 1$ is a divisor of$ n + 1$. Prove that $n$ is a prime number.

Let $P, Q,R$ be three polynomials with real coefficients such that \[P(Q(x)) + P(R(x))=\text{constant}\] for all $x$. Prove that $P(x)=\text{constant}$ or $Q(x)+R(x)=\text{constant}$ for all $x$.

Let $a,b$ and $c$ be the lengths of the edges of a triangle whose angles are $\alpha=40^\circ,\beta=60^\circ$ and $\gamma=80^\circ$. Prove that $$a(a+b+c)=b(b+c).$$

The numbers $1, 2, 3, \ldots , 10$ are written on the blackboard. In each step, Andrew chooses two numbers $a, b$ which are written on the blackboard such that $a\geqslant 2b$, he erases them, and in their place writes the number $a-2b$. Find all numbers $n$, such that after a sequence of steps as above, at the end only the number $n$ will remain on the blackboard.

Let $ABCD$ be a rhombus of sides $AB = BC = CD= DA = 13$. On the side $AB$ construct the rhombus $BAFE$ outside $ABCD$ and such that the side $AF$ is parallel to the diagonal $BD$ of $ABCD$. If the area of $BAFE$ is equal to $65$, calculate the area of $ABCD$.

Determine the maximal length $L$ of a sequence $a_1,\dots,a_L$ of positive integers satisfying both the following properties: [list=disc] [*]every term in the sequence is less than or equal to $2^{2023}$, and [*]there does not exist a consecutive subsequence $a_i,a_{i+1},\dots,a_j$ (where $1\le i\le j\le L$) with a choice of signs $s_i,s_{i+1},\dots,s_j\in\{1,-1\}$ for which \[s_ia_i+s_{i+1}a_{i+1}+\dots+s_ja_j=0.\] [/list]

Positive integers 1 to 9 are written in each square of a $ 3 \times 3 $ table. Let us define an operation as follows: Take an arbitrary row or column and replace these numbers $ a, b, c$ with either non-negative numbers $ a-x, b-x, c+x $ or $ a+x, b-x, c-x$, where $ x $ is a positive number and can vary in each operation. (1) Does there exist a series of operations such that all 9 numbers turn out to be equal from the following initial arrangement a)? b)? \[ a) \begin{array}{ccc} 1 & 2 & 3 \\ 4 & 5 & 6 \\ 7 & 8 & 9 \end{array} )\] \[ b) \begin{array}{ccc} 2 & 8 & 5 \\ 9 & 3 & 4 \\ 6 & 7 & 1 \end{array} )\] (2) Determine the maximum value which all 9 numbers turn out to be equal to after some steps.

Let triangle $ABC$ be an acute triangle with circumcircle $\Gamma$. Let $X$ and $Y$ be the midpoints of minor arcs $AB$ and $AC$ of $\Gamma$, respectively. If line $XY$ is tangent to the incircle of triangle $ABC$ and the radius of $\Gamma$ is $R$, find, with proof, the value of $XY$ in terms of $R$.

Let $m,n\ge 1$ and $a_1 < a_2 < \ldots < a_n$ be integers. Prove that there exists a subset $T$ of $\mathbb{N}$ such that \[|T| \leq 1+ \frac{a_n-a_1}{2n+1}\] and for every $i \in \{1,2,\ldots , m\}$, there exists $t \in T$ and $s \in [-n,n]$, such that $a_i=t+s$.

Find the largest number $n$ that for which there exists $n$ positive integers such that non of them divides another one, but between every three of them, one divides the sum of the other two. [i]Proposed by Morteza Saghafian[/i]

King Arthur one day had to fight the Dragon with Three Heads and Three Tails. His task became easier when he managed to find a magic sword that could, with a single blow, do one (and only one) of the following things: $\bullet$ cut off a head, $\bullet$ cut off two heads, $\bullet$ cut a tail, $\bullet$ cut off two tails. Furthermore, Fairy Morgana revealed to him the dragon's secret: $\bullet$ if a head is cut off, a new one grows, $\bullet$ if two heads are cut off nothing happens, $\bullet$ in place of a tail, two new tails are born, $\bullet$ if two tails are cut off a new head grow, $\bullet$ and the dragon dies if it loses its three heads and three tails. How many hits are needed to kill the dragon?

A uniform disk rotates at a fixed angular velocity on an axis through its center normal to the plane of the disk, and has kinetic energy $E$. If the same disk rotates at the same angular velocity about an axis on the edge of the disk (still normal to the plane of the disk), what is its kinetic energy? (a) $\frac{1}{2}E$ (b) $\frac{3}{2}E$ (c) $2E$ (d) $3E$ (e) $4E$

Find all integer solutions to the equation $$x^3+2y^3+4z^3+8xyz=0$$

Suppose that for every $n$ the number $m(n)$ is chosen such that $m(n)\ln(m(n))=n-\frac 12$. Show that $b_n$ is asymptotic to the following expression where $b_n$ is the $n-$th Bell number, that is the number of ways to partition $\{1,2,\ldots,n\}$: \[ \frac{m(n)^ne^{m(n)-n-\frac 12}}{\sqrt{\ln n}}. \] Two functions $f(n)$ and $g(n)$ are asymptotic to each other if $\lim_{n\rightarrow \infty}\frac{f(n)}{g(n)}=1$.

Let $n$ be a positive integer. There are $n$ islands with $n-1$ bridges connecting them such that one can travel from any island to another. One afternoon, a fire breaks out in one of the islands. Every morning, it spreads to all neighbouring islands. (Two islands are neighbours if they are connected by a bridge.) To control the spread, one bridge is destroyed every night until the fire has nowhere to spread the next day. Let $X$ be the minimum possible number of bridges one has to destroy before the fire stops spreading. Find the maximum possible value of $X$ over all possible configurations of bridges and island where the fire starts at.

When placing each of the digits $2,4,5,6,9$ in exactly one of the boxes of this subtraction problem, what is the smallest difference that is possible? $\text{(A)}\ 58 \qquad \text{(B)}\ 123 \qquad \text{(C)}\ 149 \qquad \text{(D)}\ 171 \qquad \text{(E)}\ 176$ \[\begin{tabular}[t]{cccc} & \boxed{} & \boxed{} & \boxed{} \\ - & & \boxed{} & \boxed{} \\ \hline \end{tabular}\]

Prove that a number of the form $80\dots01$ (there is at least 1 zero) can't be a perfect square.