Circles with centers $ O$ and $ P$ have radii 2 and 4, respectively, and are externally tangent. Points $ A$ and $ B$ are on the circle centered at $ O$, and points $ C$ and $ D$ are on the circle centered at $ P$, such that $ \overline{AD}$ and $ \overline{BC}$ are common external tangents to the circles. What is the area of hexagon $ AOBCPD$? [asy] size(250);defaultpen(linewidth(0.8)); pair X=(-6,0), O=origin, P=(6,0), B=tangent(X, O, 2, 1), A=tangent(X, O, 2, 2), C=tangent(X, P, 4, 1), D=tangent(X, P, 4, 2); pair top=X+15*dir(X--A), bottom=X+15*dir(X--B); draw(Circle(O, 2)^^Circle(P, 4)); draw(bottom--X--top); draw(A--O--B^^O--P^^D--P--C); pair point=X; label("$2$", midpoint(O--A), dir(point--midpoint(O--A))); label("$4$", midpoint(P--D), dir(point--midpoint(P--D))); label("$O$", O, SE); label("$P$", P, dir(point--P)); pair point=O; label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); pair point=P; label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); fill((-3,7)--(-3,-7)--(-7,-7)--(-7,7)--cycle, white);[/asy] $ \textbf{(A) } 18\sqrt {3} \qquad \textbf{(B) } 24\sqrt {2} \qquad \textbf{(C) } 36 \qquad \textbf{(D) } 24\sqrt {3} \qquad \textbf{(E) } 32\sqrt {2}$

Call a day a [i]perfect[/i] day if the sum of the digits of the month plus sum of the digits of the day equals the sum of digits of the year. For example, February $28$th, $2028$ is a perfect day because $2+2+8=2+0+2+8$. Find the number of perfect days in $2018$. [i]2018 CCA Math Bonanza Team Round #5[/i]

Given an integer $ n\ge 2$, find the maximal constant $ \lambda (n)$ having the following property: if a sequence of real numbers $ a_{0},a_{1},a_{2},\cdots,a_{n}$ satisfies $ 0 \equal{} a_{0}\le a_{1}\le a_{2}\le \cdots\le a_{n},$ and $ a_{i}\ge\frac {1}{2}(a_{i \plus{} 1} \plus{} a_{i \minus{} 1}),i \equal{} 1,2,\cdots,n \minus{} 1,$ then $ (\sum_{i \equal{} 1}^n{ia_{i}})^2\ge \lambda (n)\sum_{i \equal{} 1}^n{a_{i}^2}.$

Is it possible to fill a $3 \times 3$ grid with each of the numbers $1,2,\ldots,9$ once each such that the sum of any two numbers sharing a side is prime?

Let $S$ be an infinite set of positive integers, such that there exist four pairwise distinct $a,b,c,d \in S$ with $\gcd(a,b) \neq \gcd(c,d)$. Prove that there exist three pairwise distinct $x,y,z \in S$ such that $\gcd(x,y)=\gcd(y,z) \neq \gcd(z,x)$.

Determine the smallest positive integer $A$ with an odd number of digits and this property, that both $A$ and the number $B$ created by removing the middle digit of the number $A$ are divisible by $2018$.

$ABCD$ is a convex quadrilateral with $AB + BD = AC + CD$. Prove that $AB < AC$.

Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.

Mr. Earl E. Bird leaves his house for work at exactly 8:00 A.M. every morning. When he averages $ 40$ miles per hour, he arrives at his workplace three minutes late. When he averages $ 60$ miles per hour, he arrives three minutes early. At what average speed, in miles per hour, should Mr. Bird drive to arrive at his workplace precisely on time? $ \textbf{(A)}\ 45 \qquad \textbf{(B)}\ 48 \qquad \textbf{(C)}\ 50 \qquad \textbf{(D)}\ 55 \qquad \textbf{(E)}\ 58$

Prove that there are infinitely many positive $n$ that for all prime divisors $p$ of $n^2 + 3, \exists 0 \leq k \leq \sqrt{n}$ and $p \mid k^2+3$

For a given $n$, consider the points $(x,y)\in \mathbb{N}^2$ such that $x\leq y\leq n$. An ant starts from $(0,1)$ and, every move, it goes from $(a,b)$ to point $(c,d)$ if $bc-ad=1$ and $d$ is maximized over all such points. Let $g_n$ be the number of moves made by the ant until no more moves can be made. Find $g_{2023} - g_{2022}$. [i]Proposed by David Tang[/i]

The tetrahedron $ S.ABC$ has the faces $ SBC$ and $ ABC$ perpendicular. The three angles at $ S$ are all $ 60^{\circ}$ and $ SB \equal{} SC \equal{} 1$. Find the volume of the tetrahedron.

In some city there are $2000000$ citizens. In every group of $2000$ citizens there are $3$ pairwise friends. Prove, that there are $4$ pairwise friends in city.

Let $a_1,a_2,\dots, a_n$ be positive integers with product $P,$ where $n$ is an odd positive integer. Prove that $$\gcd(a_1^n+P,a_2^n+P,\dots, a_n^n+P)\le 2\gcd(a_1,\dots, a_n)^n.$$ [i]Proposed by Daniel Liu[/i]

Alice writes $1001$ letters on a blackboard, each one chosen independently and uniformly at random from the set $S=\{a, b, c\}$. A move consists of erasing two distinct letters from the board and replacing them with the third letter in $S$. What is the probability that Alice can perform a sequence of moves which results in one letter remaining on the blackboard? [i]Proposed by Daniel Zhu.[/i]

Let $X= \{A_1, A_2, A_3, A_4\}$ be a set of four distinct points in the plane. Show that there exists a subset $Y$ of $X$ with the property that there is no (closed) disk $K$ such that $K\cap X = Y$.

If $p$, $q$, and $r$ are nonzero integers satisfying \[p^2+q^2 = r^2,\] compute the smallest possible value of $(p+q+r)^2$. [i]Proposed by David Altizio[/i]

Given right $n$-gon wit the point $O$ -- its centre. All the vertices are marked either with $+1$ or $-1$. We may change all the signs in the vertices of regular $k$-gon ($2 \le k \le n$) with the same centre $O$. (By $2$-gon we understand a segment, being halved by $O$.) Prove that in a), b) and c) cases there exists such a set of $(+1)$s and $(-1)$s, that we can never obtain a set of $(+1)$s only. a) $n = 15$, b) $n = 30$, c) $n > 2$, d) Let us denote $K(n)$ the maximal number of $(+1)$ and $(-1)$ sets such, that it is impossible to obtain one set from another. Prove, for example, that $K(200) = 2^{80}$

Suppose that $\tan \alpha =\frac{p}{q}$, where $p$ and $q$ are integers and $q \neq 0$. Prove the number $\tan \beta$ for which $\tan 2\beta =\tan 3\alpha$ is rational only when $p^2 +q^2$ is the square of an integer.

Inscribed circle of triangle $ABC$ touches sides $BC$, $CA$ and $AB$ at the points $X$, $Y$ and $Z$, respectively. Let $AA_{1}$, $BB_{1}$ and $CC_{1}$ be the altitudes of the triangle $ABC$ and $M$, $N$ and $P$ be the incenters of triangles $AB_{1}C_{1}$, $BC_{1}A_{1}$ and $CA_{1}B_{1}$, respectively. a) Prove that $M$, $N$ and $P$ are orthocentres of triangles $AYZ$, $BZX$ and $CXY$, respectively. b) Prove that common external tangents of these incircles, different from triangle sides, are concurent at orthocentre of triangle $XYZ$.

Let $\mathbb{Q}^{+}$ denote the set of positive rational numbers. Find, with proof, all functions $f:\mathbb{Q}^+ \to \mathbb{Q}^+$ such that, for all positive rational numbers $x$ and $y,$ we have \[f(x)=f(x+y)+f(x+x^2f(y)).\]

A sit of tiles numbered 1 through 100 is modified repeatedly by the following operation: remove all tiles numbered with a perfect square, and renumber the remaining tiles consecutively starting with 1. How many times must the operation be performed to reduce the number of tiles in the set to one? $ \text{(A)}\ 10 \qquad \text{(B)}\ 11 \qquad \text{(C)}\ 18 \qquad \text{(D)}\ 19 \qquad \text{(E)}\ 20$

Problem 2. Prove that for every n≥3, there exists a convex polygon with n sides, such that one can divide it into n-2 triangles that are all similar, but pairwise non-congruent. [color=#00f]Moved to HSO. ~ oVlad[/color]

The leader of the Gnome country wants to print banknotes in $12$ different denominations (each with an integer number) in such a way that it is possible to pay an arbitrary amount from $1$ to $6543$ with these banknotes without a balance, using a maximum of $8$ banknotes. (Several bills with the same denomination can be used during payment.) Can the leader of the land of Gnomes do it?

Equilateral triangles $\triangle{ABC}$ and $\triangle{DEF}$ are drawn such that points $B, E, F,$ and $C$ lie on a line in this order, and point $D$ lies inside triangle $\triangle{ABC}.$ If $BE=14, EF=15,$ and $FC=16,$ compute $AD.$