The figure below consists of five isosceles triangles and ten rhombi. The bases of the isosceles triangles are $12$, $13$, $14$, $15$, as shown below. The top rhombus, which is shaded, is actually a square. Find the area of this square. [DIAGRAM NEEDED]

Prove that if a regular icosahedron and a regular dodecahedron have a common circumsphere, then they have a common insphere. [i](7 points)[/i]

Let $ ABCD$ be a rectangle with center $ O$, $ AB\neq BC$. The perpendicular from $ O$ to $ BD$ cuts the lines $ AB$ and $ BC$ in $ E$ and $ F$ respectively. Let $ M,N$ be the midpoints of the segments $ CD,AD$ respectively. Prove that $ FM \perp EN$.

Prove or disprove that there exists a positive real number $u$ such that $\lfloor u^n \rfloor -n$ is an even integer for all positive integer $n$.

Submit a positive integer $N$ between 1 and 20, inclusive. If $C$ is the total number of teams that submit $N$ for this question, your score will be $\lfloor\frac{N}{C}\rfloor$ [i]Lightning 5.4[/i]

Determine all digits $z$ such that for each integer $k \ge 1$ there exists an integer $n\ge 1$ with the property that the decimal representation of $n^9$ ends with at least $k$ digits $z$. [i](Proposed by Walther Janous)[/i]

Let $A=\{a_1,a_2,\cdots,a_n,b_1,b_2,\cdots,b_n\}$ be a set with $2n$ distinct elements, and $B_i\subseteq A$ for any $i=1,2,\cdots,m.$ If $\bigcup_{i=1}^m B_i=A,$ we say that the ordered $m-$tuple $(B_1,B_2,\cdots,B_m)$ is an ordered $m-$covering of $A.$ If $(B_1,B_2,\cdots,B_m)$ is an ordered $m-$covering of $A,$ and for any $i=1,2,\cdots,m$ and any $j=1,2,\cdots,n,$ $\{a_j,b_j\}$ is not a subset of $B_i,$ then we say that ordered $m-$tuple $(B_1,B_2,\cdots,B_m)$ is an ordered $m-$covering of $A$ without pairs. Define $a(m,n)$ as the number of the ordered $m-$coverings of $A,$ and $b(m,n)$ as the number of the ordered $m-$coverings of $A$ without pairs. $(1)$ Calculate $a(m,n)$ and $b(m,n).$ $(2)$ Let $m\geq2,$ and there is at least one positive integer $n,$ such that $\dfrac{a(m,n)}{b(m,n)}\leq2021,$ Determine the greatest possible values of $m.$

In a triangle $ABC$, $D$ is the orthogonal projection of the incenter $I$ onto $BC$. Line $DI$ meets the incircle again at $E$. Line $AE$ intersects side $BC$ at point $F$. Suppose that the segment IO is parallel to $BC$, where $O$ is the circumcenter of $\triangle ABC$. If $R$ is the circumradius and $r$ the inradius of the triangle, prove that $EF=2(R-2r)$.

There are sixteen buildings all on the same side of a street. How many ways can we choose a nonempty subset of the buildings such that there is an odd number of buildings between each pair of buildings in the subset? [i]Proposed by Yiming Zheng

Is it possible to choose a set of $100$ (or $200$) points on the boundary of a cube such that this set is fixed under each isometry of the cube into itself? Justify your answer.

There are a buch of 2000 stones. Two players play alternatively, following the next rules: ($a$)On each turn, the player can take 1, 2, 3, 4 or 5 stones [b]of[/b] the bunch. ($b$) On each turn, the player has forbidden to take the exact same amount of stones that the other player took just before of him in the last play. The loser is the player who can't make a valid play. Determine which player has winning strategy and give such strategy.

7. There are 100 chess bishops on white squares of a $100 \times 100$ chess board. Some of them are white and some of them are black. They can move in any order and capture the bishops of opposing color. What number of moves is sufficient for sure to retain only one bishop on the chess board?

The equations $ 2x \plus{} 7 \equal{} 3$ and $ bx\minus{}10 \equal{} \minus{}\!2$ have the same solution for $ x$. What is the value of $ b$? $ \textbf{(A)}\minus{}\!8 \qquad \textbf{(B)}\minus{}\!4 \qquad \textbf{(C)}\minus{}\!2 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 8$

At the beginning of the school year, $ 50\%$ of all students in Mr. Well's math class answered "Yes" to the question "Do you love math", and $ 50\%$ answered "No." At the end of the school year, $ 70\%$ answered "Yes" and $ 30\%$ answered "No." Altogether, $ x\%$ of the students gave a different answer at the beginning and end of the school year. What is the difference between the maximum and the minimum possible values of $ x$? $ \textbf{(A)}\ 0\qquad\textbf{(B)}\ 20\qquad\textbf{(C)}\ 40\qquad\textbf{(D)}\ 60\qquad\textbf{(E)}\ 80$

The side $AD$ of a square $ABCD$ is the base of an obtuse-angled isosceles triangle $AED$ with vertex $E$ lying inside the square. Let $AF$ be a diameter of the circumcircle of this triangle, and $G$ be a point on $CD$ such that $CG = DF$. Prove that angle $BGE$ is less than half of angle $AED$.

A convex polyhedron is floating in a sea. Can it happen that $90\%$ of its volume is below the water level, while more than half of its surface area is above the water level? (A Shapovalov)

Consider triangle $ABC$ in $xy$-plane where $ A$ is at the origin, $ B$ lies on the positive $x$-axis, $C$ is on the upper right quadrant, and $\angle A = 30^o$, $\angle B = 60^o$ ,$\angle C = 90^o$. Let the length $BC = 1$. Draw the angle bisector of angle $\angle C$, and let this intersect the $y$-axis at $D$. What is the area of quadrilateral $ADBC$?

A lattice point is a point $(x, y)$ with both $x$ and $y$ integers. Find, with proof, the smallest $n$ such that every set of $n$ lattice points contains three points that are the vertices of a triangle with integer area. (The triangle may be degenerate, in other words, the three points may lie on a straight line and hence form a triangle with area zero.)

A rectangle has side lengths $6$ and $8$. There are relatively prime positive integers $m$ and $n$ so that $\tfrac{m}{n}$ is the probability that a point randomly selected from the inside of the rectangle is closer to a side of the rectangle than to either diagonal of the rectangle. Find $m + n$.

Three friends are trying to meet for lunch at a cafe. Each friend will arrive independently at random between $1\!:\!00$ pm and $2\!:\!00$ pm. Each friend will only wait for $5$ minutes by themselves before leaving. However, if another friend arrives within those $5$ minutes, the pair will wait $15$ minutes from the time the second friend arrives. If the probability that the three friends meet for lunch can be expressed in simplest form as $\tfrac{m}{n}$, what is $m+n$?

In a triangle the sum of squares of the sides is $96$. What is the maximum possible value of the sum of the medians?

Let $a,b,c$ be sidelengths with $a\ge b\ge c$ and $s\ge a+1$ where $s$ be the semiperimeter of the triangle. Prove that $$ \frac{s-c}{\sqrt{a}}+\frac{s-b}{\sqrt{c}}+\frac{s-a}{\sqrt{b}}\ge \frac{s-b}{\sqrt{a}}+\frac{s-c}{\sqrt{b}}+\frac{s-a}{\sqrt{c}}$$

Let $\alpha, \beta, \gamma$ be the angles of some triangle. Prove that there is a triangle whose sides are equal to $\sin \alpha$, $\sin \beta$, $\sin \gamma$.

Prove that for all $n\in \mathbb{N}$ there exist natural numbers $a_1,a_2,...,a_n$ such that: $(i)a_1>a_2>...>a_n$ $(ii)a_i|a^2_{i+1},\forall i\in\{1,2,...,n-1\}$ $(iii)a_i\nmid a_j,\forall i,j\in \{1,2,...,n\},i\neq j$

Several policemen try to catch a thief who has $2m$ accomplices. To that end they place the accomplices under surveillance. In the beginning, the policemen shadow nobody. Every morning each policeman places under his surveillance one of the accomplices. Every evening the thief stops trusting one of his accomplices The thief is caught if by the $m$-th evening some policeman shadows exactly those $m$ accomplices who are still trusted by the thief. Prove that to guarantee the capture of the thief at least $2^m$ policemen are needed.