The circle divides each side of an equilateral triangle into three equal parts. Prove that the sum of the squares of the distances from any point of this circle to the vertices of the triangle is constant.

There are 60 empty boxes $B_1,\ldots,B_{60}$ in a row on a table and an unlimited supply of pebbles. Given a positive integer $n$, Alice and Bob play the following game. In the first round, Alice takes $n$ pebbles and distributes them into the 60 boxes as she wishes. Each subsequent round consists of two steps: (a) Bob chooses an integer $k$ with $1\leq k\leq 59$ and splits the boxes into the two groups $B_1,\ldots,B_k$ and $B_{k+1},\ldots,B_{60}$. (b) Alice picks one of these two groups, adds one pebble to each box in that group, and removes one pebble from each box in the other group. Bob wins if, at the end of any round, some box contains no pebbles. Find the smallest $n$ such that Alice can prevent Bob from winning. [i]Czech Republic[/i]

There are $28$ students who have to be separated into two groups such that the number of students in each group is a multiple of $4$. The number of ways to split them into the groups can be written as $$\sum_{k \ge 0} 2^k a_k = a_0 +2a_1 +4a_2 +...$$ where each $a_i$ is either $0$ or $1$. Find the value of $$\sum_{k \ge 0} ka_k = 0+ a_1 +2a_2 +3a3_ +....$$

A segment of length $1$ is drawn such that its endpoints lie on a unit circle, dividing the circle into two parts. Compute the area of the larger region.

[b]N[/b]ew this year at HMNT: the exciting game of RNG baseball! In RNG baseball, a team of infinitely many people play on a square field, with a base at each vertex; in particular, one of the bases is called the home base. Every turn, a new player stands at home base and chooses a number n uniformly at random from $\{0, 1, 2, 3, 4\}$. Then, the following occurs: • If $n>0$, then the player and everyone else currently on the field moves (counterclockwise) around the square by n bases. However, if in doing so a player returns to or moves past the home base, he/she leaves the field immediately and the team scores one point. • If $n=0$ (a strikeout), then the game ends immediately; the team does not score any more points. What is the expected number of points that a given team will score in this game?

Evaluate \[\int_0^{\frac{\pi}{6}} \frac{(\tan ^ 2 2x)\sqrt{\cos 2x}+2}{(\cos ^ 2 x)\sqrt{\cos 2x}}dx.\] Own

Let $a,b,c \in \mathbb{R}^+$ where $a^2+b^2+c^2=1$. Find the minimum value of . $$a+b+c+\frac{3}{ab+bc+ca}$$ [i](PP-nine)[/i]

Two circles $\omega_1$ and $\omega_2$ have centers $O_1$ and $O_2$, respectively, and intersect at points $M$ and $N$. The radii of $\omega_1$ and $\omega_2$ are $12$ and $15$, respectively, and $O_1O_2 = 18$. A point $X$ is chosen on segment $MN$. Line $O_1X$ intersects $\omega_2$ at points $A$ and $C$, where $A$ is inside $\omega_1$. Similarly, line $O_2X$ intersects $\omega_1$ at points $B$ and $D$, where $B$ is inside $\omega_2$. The perpendicular bisectors of segments $AB$ and $CD$ intersect at point $P$. Given that $PO_1 = 30$, find $PO_2^2$. [i]Proposed by Andrew Zhao[/i]

Given that the expression $\frac{20^{21}}{20^{20}} +\frac{20^{20}}{20^{21}}$ can be written in the form $m/n$ , where $m$ and $n$ are relatively prime positive integers, find $m +n$. [i]Proposed by Ada Tsui[/i]

Let $\alpha\neq0$ be a real number. Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that $$f(f(x+y))=f(x+y)+f(x)f(y)+\alpha xy$$ for all $x;y\in\mathbb{R}$

Let $w, x, y, z$ be integers from $0$ to $3$ inclusive. Find the number of ordered quadruples of $(w, x, y, z)$ such that $5x^2 + 5y^2 + 5z^2 - 6wx-6wy -6wz$ is divisible by $4$. [i]Proposed by Timothy Qian[/i]

Let $ABCD$ be a convex quadrilateral with $\angle ABC>90$, $CDA>90$ and $\angle DAB=\angle BCD$. Denote by $E$ and $F$ the reflections of $A$ in lines $BC$ and $CD$, respectively. Suppose that the segments $AE$ and $AF$ meet the line $BD$ at $K$ and $L$, respectively. Prove that the circumcircles of triangles $BEK$ and $DFL$ are tangent to each other. $\emph{Slovakia}$

What is the smallest positive integer $n$ such that there exists a choice of signs for which \[1^2\pm2^2\pm3^2\ldots\pm n^2=0\] is true? [i]2019 CCA Math Bonanza Team Round #5[/i]

Let $ q $ be an even positive number. Prove that for every natural number $ n $ number $q^{(q+1)^n}+1$ is divisible by $ (q + 1)^{n+1} $ but not divisible by $ (q + 1)^{n+2} $.

Eight guests arrive to a hotel with four rooms. Each guest dislikes at most three other guests and doesn’t want to share a room with any of them (this feeling is mutual). Show that the guests can reside in the four rooms, with two persons in each room

Have you ever found it strange that “almost the same” numbers can look very different? For example, in the decimal system $29$ and $30$ only differ by one unit but do not contain any common digits. The ALPHABETA numbering system uses only the digits$ 0$ and $1$ and avoids this situation: [img]https://cdn.artofproblemsolving.com/attachments/d/f/dcdf284b3baeea8775de56ece091c80d3449a8.png[/img] In it, the rule for constructing the successor of a number is as follows: without repeating a previous number in the list, change the digit as far to the right as possible, otherwise a 1 is placed to the left. (a) What number in the decimal system is represented in the ALPHABETA code by the number $111111$? (b) What is the next number in this code? (c) Describe an algorithm to find, given any number in the ALPHABETA code, the next number in this code.

Adam the spider is sitting at the bottom left of a 4 × 4 coordinate grid, where adjacent parallel grid lines are each separated by one unit. He wants to crawl to the top right corner of the square, and starts off with 9 “crumb’s” worth of energy. Adam only walks in one-unit segments along the grid lines, and cannot walk off of the grid. Walking one unit costs him one crumb’s worth of energy, and Adam cannot move anymore once he runs out of energy. Also, Adam stops moving once he reaches the top right corner. There is also a single crumb on the grid located one unit to the right and one unit up from Adam’s starting position. If he goes to this point and eats the crumb, he will gain one crumb’s worth of energy. How many paths can Adam take to get to the upper right corner of the grid? Note that Adam does not care if he has extra energy left over once he arrives at his destination.

Let $\omega$ be a circle with center $O$ and let $A$ be a point outside $\omega$. The tangents from $A$ touch $\omega$ at points $B$, and $C$. Let $D$ be the point at which the line $AO$ intersects the circle such that $O$ is between $A$ and $D$. Denote by $X$ the orthogonal projection of $B$ onto $CD$, by $Y$ the midpoint of the segment $BX$ and by $Z$ the second point of intersection of the line $DY$ with $\omega$. Prove that $ZA$ and $ZC$ are perpendicular to each other.

Shelby drives her scooter at a speed of 30 miles per hour if it is not raining, and 20 miles per hour if it is raining. Today she drove in the sun in the morning and in the rain in the evening, for a total of 16 miles in 40 minutes. How many minutes did she drive in the rain? $ \textbf{(A)}\ 18\qquad\textbf{(B)}\ 21\qquad\textbf{(C)}\ 24\qquad\textbf{(D)}\ 27\qquad\textbf{(E)}\ 30$

We consider permutations $f$ of the set $\mathbb{N}$ of non-negative integers, i.e. bijective maps $f$ from $\mathbb{N}$ to $\mathbb{N}$, with the following additional properties: \[f(f(x)) = x \quad \mbox{and}\quad \left| f(x)-x\right| \leqslant 3\quad\mbox{for all } x \in\mathbb{N}\mbox{.}\] Further, for all integers $n > 42$, \[\left.M(n)=\frac{1}{n+1}\sum_{j=0}^n \left|f(j)-j\right|<2,011\mbox{.}\right.\] Show that there are infinitely many natural numbers $K$ such that $f$ maps the set \[\left\{ n\mid 0\leqslant n\leqslant K\right\}\] onto itself.

A number is written in each cell of the $N \times N$ square. Let's call cell $C$ [i]good[/i] if in one of the cells adjacent to $C$ on the side, there is a number $1$ more than in $C$, and in some other of the cells adjacent to $C$ on the side, there is a number $3$ more than in $C$. What is the largest possible number of good cells? [i] Proposed by A. Chebotarev [/i]

The base-$7$ representation of number $n$ is $\overline{abc}_{(7)}$, and the base-$9$ representation of number $n$ is $\overline{cba}_{(9)}$. What is the decimal (base-$10$) representation of $n$?

We are given an isosceles triangle $ABC$ such that $BC=a$ and $AB=BC=b$. The variable points $M\in (AC)$ and $N\in (AB)$ satisfy $a^2\cdot AM \cdot AN = b^2 \cdot BN \cdot CM$. The straight lines $BM$ and $CN$ intersect in $P$. Find the locus of the variable point $P$. [i]Dan Branzei[/i]

Let $K$ be the intersection of the diagonals of a convex quadrilateral $ABCD$. Let $L\in [AD]$, $M \in [AC]$, $N \in [BC]$ such that $KL\parallel AB$, $LM\parallel DC$, $MN\parallel AB$. Show that \[\dfrac{Area(KLMN)}{Area(ABCD)} < \dfrac {8}{27}.\]

In his bag, Salman has a number of stones. The weight of each stone is not greater than $0.5$ kg and the total weight of the stones is not greater than $2.5$ kg. Prove that Salman can divide his stones into $4$ groups, each group has a total weight not greater than $1$ kg Trần Nam Dũng