In triangle $ABC$, let $O$ be the circumcenter and let $G$ be the centroid. The line perpendicular to $OG$ at $O $ intersects $BC$ at $M$ such that $M$, $G$, and $A$ are collinear and $OM = 3$. Compute the area of $ABC$, given that $OG = 1$.

We denote with $m_a$, $m_g$ the arithmetic mean and geometrical mean, respectively, of the positive numbers $x,y$. a) If $m_a+m_g=y-x$, determine the value of $\dfrac xy$; b) Prove that there exists exactly one pair of different positive integers $(x,y)$ for which $m_a+m_g=40$.

Find all pairs of natural numbers $x$ and $y$ for which $x^2+3y$ and $y^2+3x$ are simultaneously squares of natural numbers.

The diagram below shows the circular face of a clock with radius $20$ cm and a circular disk with radius $10$ cm externally tangent to the clock face at $12$ o'clock. The disk has an arrow painted on it, initially pointing in the upward vertical direction. Let the disk roll clockwise around the clock face. At what point on the clock face will the disk be tangent when the arrow is next pointing in the upward vertical direction? [asy] size(170); defaultpen(linewidth(0.9)+fontsize(13pt)); draw(unitcircle^^circle((0,1.5),0.5)); path arrow = origin--(-0.13,-0.35)--(-0.06,-0.35)--(-0.06,-0.7)--(0.06,-0.7)--(0.06,-0.35)--(0.13,-0.35)--cycle; for(int i=1;i<=12;i=i+1) { draw(0.9*dir(90-30*i)--dir(90-30*i)); label("$"+(string) i+"$",0.78*dir(90-30*i)); } dot(origin); draw(shift((0,1.87))*arrow); draw(arc(origin,1.5,68,30),EndArrow(size=12));[/asy] $ \textbf{(A) }\text{2 o'clock} \qquad\textbf{(B) }\text{3 o'clock} \qquad\textbf{(C) }\text{4 o'clock} \qquad\textbf{(D) }\text{6 o'clock} \qquad\textbf{(E) }\text{8 o'clock} $

Let $ \theta_1, \theta_2,\ldots , \theta_{2008}$ be real numbers. Find the maximum value of $ \sin\theta_1\cos\theta_2 \plus{} \sin\theta_2\cos\theta_3 \plus{} \ldots \plus{} \sin\theta_{2007}\cos\theta_{2008} \plus{} \sin\theta_{2008}\cos\theta_1$

Points $C_0$ and $B_0$ are the respective midpoints of sides $AB$ and $AC$ of a non-isosceles acute triangle $ABC$, $O$ is its circumscenter and $H$ is the orthocenter. Lines $BH$ and $OC_0$ intersect at $P$, while lines $CH$ and $OB_0$ intersect at $Q$. $OPHQ$ is rhombus. Prove that points $A$, $P$ and $Q$ are collinear. (Author: L. Emelyanov)

There is a $8\times 8$ table, drawn in a plane and painted in a chess board fashion. Peter mentally chooses a square and an interior point in it. Basil can draws any polygon (without self-intersections) in the plane and ask Peter whether the chosen point is inside or outside this polygon. What is the minimal number of questions suffcient to determine whether the chosen point is black or white?

Find all positive integers $n$ such that we can put $n$ equal squares on the plane that their sides are horizontal and vertical and the shape after putting the squares has at least $3$ axises.

Let $M$ be the greatest integer such that both $M + 1213$ and $M + 3773$ are perfect squares. What is the units digit of $M$? $ \textbf{(A) }1 \qquad \textbf{(B) }2 \qquad \textbf{(C) }3 \qquad \textbf{(D) }6 \qquad \textbf{(E) }8 \qquad $

Prove that every convex polygon has at most one triangulation consisting entirely of acute triangles.

Alice and Bob play a game on the infinite side of a checkered strip, in which the cells are numbered with consecutive integers from left to right (..., $-2$, $-1$, $0$, $1$, $2$, ...). Alice in her turn puts one cross in any free cell, and Bob in his turn puts zeros in any 2020 free cells. Alice will win if he manages to get such 4 cells marked with crosses, the corresponding cell numbers will form an arithmetic progression. Bob's goal in this game is to prevent Alice from winning. They take turns and Alice moves first. Will Alice be able to win no matter how Bob plays?

Let $ABC$ be a triangle with $\angle BAC = 90^\circ$. Construct the square $BDEC$ such as $A$ and the square are at opposite sides of $BC$. Let the angle bisector of $\angle BAC$ cut the sides $[BC]$ and $[DE]$ at $F$ and $G$, respectively. If $|AB|=24$ and $|AC|=10$, calculate the area of quadrilateral $BDGF$.

Let $a,b,c,d,x,y$ denote the lengths of the sides $AB, BC,CD,DA$ and the diagonals $AC,BD$ of a cyclic quadrilateral $ABCD$ respectively. Prove that $$(\frac{1}{a}+\frac{1}{c})^2+(\frac{1}{b}+\frac{1}{d})^2 \geq 8 ( \frac{1}{x^2}+\frac{1}{y^2})$$

Does there exist an infinite sequence of positive integers $a_1, a_2, a_3, . . .$ such that $a_m$ and $a_n$ are coprime if and only if $|m - n| = 1$?

For $p>1,\frac1p+\frac1q=1$ and $r>1$. If $x_{00},y_{00}>0$, and reals $x_{ij},y_{ij},i=1,2,\ldots,n$, $j=1,2,\ldots,m$, then prove that $$\left(\frac{\left(\displaystyle\sum_{j=1}^m\displaystyle\sum_{i=1}^n(x_{ij}+y_{ij})^r\right)^{1/r}}{(x_{00}+y_{00})^{1/q}}\right)^p\le\left(\frac{\left(\displaystyle\sum_{j=1}^m\displaystyle\sum_{i=1}^nx_{ij}^r\right)^{1/r}}{x_{00}^{1/q}}\right)^p+\left(\frac{\left(\displaystyle\sum_{j=1}^m\displaystyle\sum_{i=1}^ny_{ij}^r\right)^{1/r}}{y_{00}^{1/q}}\right)^p$$ with equality if and only if either $x_{ij}=y_{ij}=0$ for $i=1,\ldots,n,j=1,\ldots,m$ or $x_{ij}=\alpha y_{ij}$ for $i=0,1,\ldots,n,j=0,1,\ldots,m$, and some $\alpha>0$. [i]Proposed by Chang-Jian Zhao[/i]

Compute the number of sequences of integers $(a_1,\ldots,a_{200})$ such that the following conditions hold. [list] [*] $0\leq a_1<a_2<\cdots<a_{200}\leq 202.$ [*] There exists a positive integer $N$ with the following property: for every index $i\in\{1,\ldots,200\}$ there exists an index $j\in\{1,\ldots,200\}$ such that $a_i+a_j-N$ is divisible by $203$. [/list]

Determine all functions $f : \mathbb R \to \mathbb R$ such that for all real numbers $x$ and $y$, $$f(x^2 + xy) = f(x)f(y) + yf(x) + xf(x+y).$$ [i]Proposed by Walther Janous, Austria[/i]

In each square of a $10\times 10$ board, there is an arrow pointing upwards, downwards, left, or right. Prove that it is possible to remove $50$ arrows from the board, such that no two remaining arrows point at each other.

Find all real values of the real parameter $a$ such that the equation \[ 2x^{2}-6ax+4a^{2}-2a-2+\log_{2}(2x^{2}+2x-6ax+4a^{2})= \] \[ =\log_{2}(x^{2}+2x-3ax+2a^{2}+a+1). \] has a unique solution.

For some positive integer $n$, the sum of all odd positive integers between $n^2-n$ and $n^2+n$ is a number between $9000$ and $10000$, inclusive. Compute $n$. [i]2020 CCA Math Bonanza Lightning Round #3.1[/i]

Mereduth has many red boxes and many blue boxes. Coloon has placed five green boxes in a row on the ground, and Mereduth wants to arrange some number of her boxes on top of his row. Assume that each box must be placed so that it straddles two lower boxes. Including the one with no boxes, how many arrangements can Mereduth make?

$ n > 2 $ points are chosen on a circle and each of them is connected to every other by a segment. Is it possible to draw all of these segments in one sequence, i.e. so that the end of the first segment is the beginning of the second, the end of the second - the beginning of the third, etc., and so that the end of the last segment is the beginning of the first?

Let be a positive real number $ r, $ a natural number $ n, $ and a function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ satisfying $ f(rxy)=(f(x)f(y))^n, $ for any real numbers $ x,y. $ [b]a)[/b] Give three distinct examples of what $ f $ could be if $ n=1. $ [b]b)[/b] For a fixed $ n\ge 2, $ find all possibilities of what $ f $ could be. [i]Bogdan Blaga[/i]

Let $S$ be a finite set and $P$ the set of all subsets of $S$. Show that one can label the elements of $P$ as $A_i$ such that (1) $A_1 =\emptyset$. (2) For each $n\geq1 $ we either have $A_{n-1}\subset A_{n}$ and $|A_{n} \setminus A_{n-1}|=1$ or $A_{n}\subset A_{n-1}$ and $|A_{n-1} \setminus A_{n}|=1.$

If $a$, $b$ ,$c$ are three positive real numbers such that $ab+bc+ca = 1$, prove that \[ \sqrt[3]{ \frac{1}{a} + 6b} + \sqrt[3]{\frac{1}{b} + 6c} + \sqrt[3]{\frac{1}{c} + 6a } \leq \frac{1}{abc}. \]