The vertices of hexagon $ABCDEF$ lie on a circle. Sides $AB = CD = EF = 6$, and sides $BC = DE = F A = 10$. The area of the hexagon is $m\sqrt3$. Find $m$.

Given $n$ points in a circle, Arnaldo write 0 or 1 in all the points. Bernado can do a operation, he can chosse some point and change its number and the numbers of the points on the right and left side of it. Arnaldo wins if Bernado can´t change all the numbers in the circle to 0, and Bernado wins if he can a) Show that Bernado can win if $n=101$ b) Show that Arnaldo wins if $n=102$

Let $p$ be a prime number and $a_1, \ldots, a_{p-1}$ be not necessarily distinct nonzero elements of the $p$-element $\mathbb Z_p \pmod{p}$ group. Prove that each element of $\mathbb Z_p$ equals a sum of some of the $a_i$'s (the empty sum is $0$). (translated by Miklós Maróti)

Let $ABC$ be a triangle with $AB = 80, BC = 100, AC = 60$. Let $D, E, F$ lie on $BC, AC, AB$ such that $CD = 10, AE = 45, BF = 60$. Let $P$ be a point in the plane of triangle $ABC$. The minimum possible value of $AP+BP+CP+DP+EP+FP$ can be expressed in the form $\sqrt{x}+\sqrt{y}+\sqrt{z}$ for integers $x, y, z$. Find $x+y+z$. [i]Proposed by Yang Liu[/i]

Let $ p\in\mathbb{R}_\plus{}$ and $ k\in\mathbb{R}_\plus{}$. The polynomial $ F(x)\equal{}x^4\plus{}a_3x^3\plus{}a_2x^2\plus{}a_1x\plus{}k^4$ with real coefficients has $ 4$ negative roots. Prove that $ F(p)\geq(p\plus{}k)^4$

Chandler the Octopus is making a concoction to create the perfect ink. He adds $1.2$ grams of melanin, $4.2$ grams of enzymes, and $6.6$ grams of polysaccharides. But Chandler accidentally added n grams of an extra ingredient to the concoction, Chemical $X$, to create glue. Given that Chemical $X$ contains none of the three aforementioned ingredients, and the percentages of melanin, enzymes, and polysaccharides in the final concoction are all integers, find the sum of all possible positive integer values of $n$. [i]Proposed by Taiki Aiba[/i]

Given $n > 1$ monic square trinomials $x^2 - a_1x + b_1$,$...$, $x^2-a_nx + b_n$, and all $2n$ numbers are $a_1$,$...$, $a_n$, $b_1$,$...$, $b_n$ are different. Can it happen that each of the numbers $a_1$,$...$, $a_n$, $b_1$,$...$, $b_n is the root of one of these trinomials?

In the convex pentagon $ABCDE$: $\angle A = \angle C = 90^o$, $AB = AE, BC = CD, AC = 1$. Find the area of the pentagon.

Consider the points $A(0,12)$, $B(10,9)$, $C(8,0)$, and $D(-4,7)$. There is a unique square $S$ such that each of the four points is on a different side of $S$. Let $K$ be the area of $S$. Find the remainder when $10K$ is divided by $1000$.

Let $ABC$ be an acute triangle. Variable points $E$ and $F$ are on sides $AC$ and $AB$ respectively such that $BC^2 = BA\cdot BF + CE \cdot CA$ . As $E$ and $F$ vary prove that the circumcircle of $AEF$ passes through a fixed point other than $A$ .

If $x$ is a real number, then the quantity $(1-|x|)(1+x)$ is positive if and only if $\textbf{(A) }|x|<1\qquad\textbf{(B) }|x|>1\qquad\textbf{(C) }x<-1\text{ or }-1<x<1\qquad$ $\textbf{(D) }x<1\qquad \textbf{(E) }x<-1$

Find the smallest number $a$ such that a square of side $a$ can contain five disks of radius $1$, so that no two of the disks have a common interior point.

Find all quadruplets $(x_1, x_2, x_3, x_4)$ of real numbers such that the next six equalities apply: $$\begin{cases} x_1 + x_2 = x^2_3 + x^2_4 + 6x_3x_4\\ x_1 + x_3 = x^2_2 + x^2_4 + 6x_2x_4\\ x_1 + x_4 = x^2_2 + x^2_3 + 6x_2x_3\\ x_2 + x_3 = x^2_1 + x^2_4 + 6x_1x_4\\ x_2 + x_4 = x^2_1 + x^2_3 + 6x_1x_3 \\ x_3 + x_4 = x^2_1 + x^2_2 + 6x_1x_2 \end{cases}$$

For which $a$, there is a function $f: R \to R$, different from a constant, such that $$f(a(x + y)) = f(x) + f(y) ?$$

A tourist has arrived on an island where $100$ wizards live, each of whom can be a knight or a liar. He knows that at the time of his arrival, one of the hundred wizards is a knight (but does not know who exactly), and the rest are liars. A tourist can choose any two wizards $A$ and $B$ and ask $A$ to spell on $B$ with the spell "Whoosh"!, which changes the essence (turns a knight into a liar, and a liar into a knight). Wizards fulfill the tourist's requests, but if at that moment wizard $A$ is a knight, then the essence of $B$ really changes, and if $A$ is a liar, that doesn't change. The tourist wants to know the essence of at least $k$ wizards at the same time after several consecutive requests. For which maximum $k$ will he be able to achieve his goal?

With $ \$1000$ a rancher is to buy steers at $ \$25$ each and cows at $ \$26$ each. If the number of steers $ s$ and the number of cows $ c$ are both positive integers, then: $ \textbf{(A)}\ \text{this problem has no solution}\qquad\\ \textbf{(B)}\ \text{there are two solutions with }{s}\text{ exceeding }{c}\qquad \\ \textbf{(C)}\ \text{there are two solutions with }{c}\text{ exceeding }{s}\qquad \\ \textbf{(D)}\ \text{there is one solution with }{s}\text{ exceeding }{c}\qquad \\ \textbf{(E)}\ \text{there is one solution with }{c}\text{ exceeding }{s}$

The fraction $\frac{3}{10}$ can be written as a sum of two reciprocals in exactly two ways: \[\frac{3}{10}=\frac{1}{5}+\frac{1}{10}=\frac{1}{4}+\frac{1}{20}\] a) In how many ways can $\frac{3}{2021}$ be written as a sum of two reciprocals? b) Is there a positive integer $n$ not divisible by $3$ with the property that $\frac{3}{n}$ can be written as a sum of two reciprocals in exactly $2021$ ways?

The quadrilateral $ABCD$ is inscribed in a circle and has perpendicular diagonals. Points $K,L,M,Q$ are the points of intersection of the altitudes of the triangles $ABD, ACD, BCD, ABC$, respectively. Prove that the quadrilateral $KLMQ$ is equal to the quadrilateral $ABCD$. (Rozhkova Maria)

Alice, Bob, Carol, and David decide that they will share meals and that one of them will cook each night. Because David enjoys cooking, he will cook on $4$ days of the week, while Alice, Bob, and Carol each pick a day of the week to cook on. If Alice, Bob, and Carol each choose the day they cook uniformly at random so as to avoid overlap, what is the probability that David does not cook on three consecutive days? For example, Monday, Tuesday and Wednesday are considered as three consecutive days, so are Saturday, Sunday and Monday.

A rectangular box $\mathcal{P}$ has distinct edge lengths $a, b,$ and $c$. The sum of the lengths of all $12$ edges of $\mathcal{P}$ is $13$, the sum of the areas of all $6$ faces of $\mathcal{P}$ is $\frac{11}{2}$, and the volume of $\mathcal{P}$ is $\frac{1}{2}$. What is the length of the longest interior diagonal connecting two vertices of $\mathcal{P}$? $\textbf{(A)}~2\qquad\textbf{(B)}~\frac{3}{8}\qquad\textbf{(C)}~\frac{9}{8}\qquad\textbf{(D)}~\frac{9}{4}\qquad\textbf{(E)}~\frac{3}{2}$

Let $B = (-1, 0)$ and $C = (1, 0)$ be fixed points on the coordinate plane. A nonempty, bounded subset $S$ of the plane is said to be [i]nice[/i] if $\text{(i)}$ there is a point $T$ in $S$ such that for every point $Q$ in $S$, the segment $TQ$ lies entirely in $S$; and $\text{(ii)}$ for any triangle $P_1P_2P_3$, there exists a unique point $A$ in $S$ and a permutation $\sigma$ of the indices $\{1, 2, 3\}$ for which triangles $ABC$ and $P_{\sigma(1)}P_{\sigma(2)}P_{\sigma(3)}$ are similar. Prove that there exist two distinct nice subsets $S$ and $S'$ of the set $\{(x, y) : x \geq 0, y \geq 0\}$ such that if $A \in S$ and $A' \in S'$ are the unique choices of points in $\text{(ii)}$, then the product $BA \cdot BA'$ is a constant independent of the triangle $P_1P_2P_3$.

The dates of three Sundays of a month were even numbers. What day of the week was the $20$th of the month?

Two angles of an isosceles triangle measure $ 70^\circ$ and $ x^\circ$. What is the sum of the three possible values of $ x$? $ \textbf{(A)}\ 95 \qquad \textbf{(B)}\ 125 \qquad \textbf{(C)}\ 140 \qquad \textbf{(D)}\ 165 \qquad \textbf{(E)}\ 180$

Let $ABC$ be a triangle and $I$ its incenter. The circle passing through $A, C$ and $I$ intersect the line $BC$ for second time at point $X$. The circle passing through $B, C$ and $I$ intersects the line $AC$ for second time at point $Y$. Show that the segments $AY$ and $BX$ have equal length.

In a country with $2015$ cities there is exactly one two-way flight between each city. The three flights made between three cities belong to at most two different airline companies. No matter how the flights are shared between some number of companies, if there is always a city in which $k$ flights belong to the same airline, what is the maximum value of $k$?