For distinct real numbers $x$ and $y$, let $M(x,y)$ be the larger of $x$ and $y$ and let $m(x,y)$ be the smaller of $x$ and $y$. If $a<b<c<d<e$, then \[ M(M(a,m(b,c)),m(d,m(a,e)))= \] $ \textbf{(A)}\ a \qquad\textbf{(B)}\ b \qquad\textbf{(C)}\ c \qquad\textbf{(D)}\ d \qquad\textbf{(E)}\ e $

Given an $a\times b$ chessboard where $a,b\ge3$, alice wants to use only $L$-dominoes (as the figure shows) to cover this chessboard. How many grids, at least, are covered even times? [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvNi82LzhmZDkwMGQzZjU3M2QxMzk4Y2NjNDg5ZTMwM2ZmYjJiMWU3MmUwLnBuZw==&rn=MjAxOC1DMy5wbmc=[/img]

If a right triangle can be covered by two unit circles, find the maximal area of the right triangle.

It is known that $\triangle ABC$ is an acute triangle. Let $C'$ be the foott of the perpendicular from $C$ to $AB$, and $D$, $E$ two distinct points on $CC'$. The feet of the perpendiculars from $D$ to $AC$ and $BC$ are $F$ and $G$, respectively. Show that if $DGEF$ is a parallelogram then $ABC$ is isosceles.

Consider triangle $ABC$ with $AB = AC$ and $\angle A = 40 ^o$. The points $S$ and $T$ are on the sides $AB$ and $BC$, respectively, so that $\angle BAT = \angle BCS= 10 ^o$. The lines $AT$ and $CS$ intersect at point $P$. Prove that $BT = 2PT$.

For two rational numbers $r,s$ we say:$$r\mid s$$whenever there exists $k\in\mathbb{Z}$ such that:$$s=kr$$ ${(a_n)}_{n\in\mathbb{N}}$ is an increasing sequence of pairwise coprime natural numbers and ${(b_n)}_{n\in\mathbb{N}}$ is a sequence of distinct natural numbers. Assume that for all $n\in\mathbb{N}$ we have: $$\sum_{i=1}^{n}\frac{1}{a_i}\mid\sum_{i=1}^{n}\frac{1}{b_i}$$ Prove that [b]for all[/b] $n\in\mathbb{N}$ we have: $a_n=b_n$.

Suppose that 13 cards numbered $1, 2, 3, \dots, 13$ are arranged in a row. The task is to pick them up in numerically increasing order, working repeatedly from left to right. In the example below, cards 1, 2, 3 are picked up on the first pass, 4 and 5 on the second pass, 6 on the third pass, 7, 8, 9, 10 on the fourth pass, and 11, 12, 13 on the fifth pass. For how many of the $13!$ possible orderings of the cards will the $13$ cards be picked up in exactly two passes? [asy] size(11cm); draw((0,0)--(2,0)--(2,3)--(0,3)--cycle); label("7", (1,1.5)); draw((3,0)--(5,0)--(5,3)--(3,3)--cycle); label("11", (4,1.5)); draw((6,0)--(8,0)--(8,3)--(6,3)--cycle); label("8", (7,1.5)); draw((9,0)--(11,0)--(11,3)--(9,3)--cycle); label("6", (10,1.5)); draw((12,0)--(14,0)--(14,3)--(12,3)--cycle); label("4", (13,1.5)); draw((15,0)--(17,0)--(17,3)--(15,3)--cycle); label("5", (16,1.5)); draw((18,0)--(20,0)--(20,3)--(18,3)--cycle); label("9", (19,1.5)); draw((21,0)--(23,0)--(23,3)--(21,3)--cycle); label("12", (22,1.5)); draw((24,0)--(26,0)--(26,3)--(24,3)--cycle); label("1", (25,1.5)); draw((27,0)--(29,0)--(29,3)--(27,3)--cycle); label("13", (28,1.5)); draw((30,0)--(32,0)--(32,3)--(30,3)--cycle); label("10", (31,1.5)); draw((33,0)--(35,0)--(35,3)--(33,3)--cycle); label("2", (34,1.5)); draw((36,0)--(38,0)--(38,3)--(36,3)--cycle); label("3", (37,1.5)); [/asy] $\textbf{(A) }4082\qquad\textbf{(B) }4095\qquad\textbf{(C) }4096\qquad\textbf{(D) }8178\qquad\textbf{(E) }8191$

Find the number of pairs of integers $(a,b)$ with $0 \le a,b \le 2019$ where $ax \equiv b \pmod{2020}$ has exactly $2$ integer solutions $0 \le x \le 2019$. [i]Proposed by Richard Chen[/i]

Let $ABCD$ be a tetrahedron with $BA \perp AC,DB \perp (BAC)$. Denote by $O$ the midpoint of $AB$, and $K$ the foot of the perpendicular from $O$ to $DC$. Suppose that $AC = BD$. Prove that $\frac{V_{KOAC}}{V_{KOBD}}=\frac{AC}{BD}$ if and only if $2AC \cdot BD = AB^2$.

Let $n \ge 2$ be a positive integer, and write in a digit form \[\frac{1}{n}=0.a_1a_2\dots.\] Suppose that $n = a_1 + a_2 + \cdots$. Determine all possible values of $n$.

The following game is played with a group of $n$ people and $n+1$ hats are numbered from $1$ to $n+1.$ The people are blindfolded and each of them puts one of the $n+1$ hats on his head (the remaining hat is hidden). Now, a line is formed with the $n$ people, and their eyes are uncovered: each of them can see the numbers on the hats of the people standing in front of him. Now, starting from the last person (who can see all the other players) the players take turns to guess the number of the hat on their head, but no two players can guess the same number (each player hears all the guesses from the other players). What is the highest number of guaranteed correct guesses, if the $n$ people can discuss a common strategy? [i]Proposed by Viktor Kiss, Budapest[/i]

$P$ is a point inside the triangle $ABC$ is a triangle. The distance of $P$ from the lines $BC, CA, AB$ is $d_a, d_b, d_c$ respectively. If $r$ is the inradius, show that $$\frac{2}{ \frac{1}{d_a} + \frac{1}{d_b} + \frac{1}{d_c}} < r < \frac{d_a + d_b + d_c}{2}$$

Prove that a triangle $ABC$ is right-angled if and only if \[\sin A + \sin B + \sin C = \cos A + \cos B + \cos C + 1\]

a) A game is played on an infinite plane. There are fifty one pieces, one “wolf” and $50$ “sheep”. There are two players. The first commences by moving the wolf. Then the second player moves one of the sheep, the first player moves the wolf, the second player moves a sheep, and so on. The wolf and the sheep can move in any direction through a distance of up to one metre per move. Is it true that for any starting position the wolf will be able to capture at least one sheep? b) A game is played on an infinite plane. There are two players. One has a piece known as a “wolf”, while the other has $K$ pieces known as “sheep”. The first player moves the wolf, then the second player moves a sheep, the first player moves the wolf again, the second player moves a sheep, and so on. The wolf and the sheep can move in any direction, with a maximum distance of one metre per move. Is it true that for any value of $K$ there exists an initial position from which the wolf can not capture any sheep? PS. (a) was the junior version, (b) the senior one

The numbers $ x,\,y,\,z$ are proportional to $ 2,\,3,\,5$. The sum of $ x$, $ y$, and $ z$ is $ 100$. The number $ y$ is given by the equation $ y \equal{} ax \minus{} 10$. Then $ a$ is: $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ \frac{3}{2}\qquad \textbf{(C)}\ 3\qquad \textbf{(D)}\ \frac{5}{2}\qquad \textbf{(E)}\ 4$

Consider a board with $n$ rows and $4$ columns. In the first line are written $4$ zeros (one in each house). Next, each line is then obtained from the previous line by performing the following operation: one of the houses, (that you can choose), is maintained as in the previous line; the other three are changed: * if in the previous line there was a $0$, then in the down square $1$ is placed; * if in the previous line there was a $1$, then in the down square $2$ is placed; * if in the previous line there was a $2$, then in the down square $0$ is placed; Build the largest possible board with all its distinct lines and demonstrate that it is impossible to build a larger board.

Let $ABC$ be a triangle with $AB = AC$ with centroid $G$. Let $M$ and $N$ be the midpoints of $AB$ and $AC$ respectively and $O$ be the circumcenter of triangle $BCN$ . Prove that $MBOG$ is a cyclic quadrilateral .