Find a set of positive integers with the greatest possible number of elements such that the least common multiple of all of them is less than $2011$.

If $f(x)=x^4+4x^3+7x^2+6x+2022$, compute $f'(3)$.

It is known that in a set of five coins three are genuine (and have the same weight) while two coins are fakes, each of which has a different weight from a genuine coin. What is the smallest number of weighings on a scale with two cups that is needed to locate one genuine coin?

Seven teams play a soccer tournament in which each team plays every other team exactly once. No ties occur, each team has a $50\%$ chance of winning each game it plays, and the outcomes of the games are independent. In each game, the winner is awarded a point and the loser gets 0 points. The total points are accumilated to decide the ranks of the teams. In the first game of the tournament, team $A$ beats team $B$. The probability that team $A$ finishes with more points than team $B$ is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Let there be $320$ points arranged on a circle, labeled $1$, $2$, $3$, $\dots$, $8$, $1$, $2$, $3$, $\dots$, $8$, $\dots$ in order. Line segments may only be drawn to connect points labelled with the same number. What the largest number of non-intersecting line segments one can draw? (Two segments sharing the same endpoint are considered to be intersecting).

Show that if $x_1+x_2+x_3 = 0$ for real numbers $x_1,x_2,x_3$, then $x_1x_2+x_2x_3+x_3x_1\le 0$. Find all $n \ge 4$ for which $x_1+x_2+...+x_n = 0$ implies $x_1x_2+x_2x_3+...+x_{n-1}x_n+x_nx_1 \le 0$.

Let $n\ge 1$ be a positive integer. A square of side length $n$ is divided by lines parallel to each side into $n^2$ squares of side length $1$. Find the number of parallelograms which have vertices among the vertices of the $n^2$ squares of side length $1$, with both sides smaller or equal to $2$, and which have tha area equal to $2$. (Greece)

The sequence of digits \[ 1 2 3 4 5 6 7 8 9 1 0 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 2 0 2 1 \dots \] is obtained by writing the positive integers in order. If the $10^n$-th digit in this sequence occurs in the part of the sequence in which the $m$-digit numbers are placed, define $f(n)$ to be $m$. For example, $f(2)=2$ because the 100th digit enters the sequence in the placement of the two-digit integer 55. Find, with proof, $f(1987)$.

Let $ABC$ be a triangle with $\angle{A} = 60^\circ$. The midperpendicular of segment $AB$ meets line $AC$ at point $C_1$. The midperpendicular of segment $AC$ meets line $AB$ at point $B_1$. Prove that line $B_1C_1$ touches the incircle of triangle $ABC$.

The incircle of triangle $ABC$ touches $BC$, $CA$, $AB$ at points $A_1$, $B_1$, $C_1$, respectively. The perpendicular from the incenter $I$ to the median from vertex $C$ meets the line $A_1B_1$ in point $K$. Prove that $CK$ is parallel to $AB$.

For every positive integer $x$, let $k(x)$ denote the number of composite numbers that do not exceed $x$. Find all positive integers $n$ for which $(k (n))! $ lcm $(1, 2,..., n)> (n - 1) !$ .

There are three stacks of tokens on the table: the first contains $a,$ the second contains $b,$ and the third contains $c$ where $a \ge b \ge c.$ Players $A$ and $B$ take turns playing a game of swapping tokens. $A$ starts first. On each turn, the player who gets his turn chooses two stacks, then takes at least one token from the stack with the lowest number of tokens and places them on the stack with the highest number of tokens. If the number of tokens in the two piles he/she chooses is equal, then he/she takes at least one token from any of them and puts it in the other. If only one pile remains after a player's move, that player is considered a winner. At what values of $a, b, c$ who has the winning strategy ($A$ or $B$)?

In a triangle $ABC$, the bisector of $\angle BAC$ meets the side $BC$ at the point $D$. Knowing that $|BD|\cdot |CD|=|AD|^2$ and $\angle ADB=45^{\circ}$, determine the angles of triangle $ABC$.

Let $ a, b, c $ be positive real numbers greater or equal to $ 3 $. Prove that $$ 3(abc+b+2c)\ge 2(ab+2ac+3bc) $$ and determine all equality cases.

Given the tetrahedron $ABCD$ whose edges $AB$ and $CD$ have lengths $a$ and $b$ respectively. The distance between the skew lines $AB$ and $CD$ is $d$, and the angle between them is $\omega$. Tetrahedron $ABCD$ is divided into two solids by plane $\epsilon$, parallel to lines $AB$ and $CD$. The ratio of the distances of $\epsilon$ from $AB$ and $CD$ is equal to $k$. Compute the ratio of the volumes of the two solids obtained.

Given a finite set $S \subset \mathbb{R}^3$, define $f(S)$ to be the mininum integer $k$ such that there exist $k$ planes that divide $\mathbb{R}^3$ into a set of regions, where no region contains more than one point in $S$. Suppose that \[M(n) = \max\{f(S) : |S| = n\} \text{ and } m(n) = \min\{f(S) : |S| = n\}.\] Evaluate $M(200) \cdot m(200)$.

On the occasion of the 47th Mathematical Olympiad 2016 the numbers 47 and 2016 are written on the blackboard. Alice and Bob play the following game: Alice begins and in turns they choose two numbers $a$ and $b$ with $a > b$ written on the blackboard, whose difference $a-b$ is not yet written on the blackboard and write this difference additionally on the board. The game ends when no further move is possible. The winner is the player who made the last move. Prove that Bob wins, no matter how they play. (Richard Henner)

Call a set $S$ [i]product-free[/i] if there do not exist $a, b, c \in S$ (not necessarily distinct) such that $a b = c$. For example, the empty set and the set $\{16, 20\}$ are product-free, whereas the sets $\{4, 16\}$ and $\{2, 8, 16\}$ are not product-free. Find the number of product-free subsets of the set $\{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\}$.

The point $P$ lies on the edge $AB$ of a quadrilateral $ABCD$. The angles $BAD, ABC$ and $CPD$ are right, and $AB = BC + AD$. Show that $BC = BP$ or $AD = BP$.

In English class, you have discovered a mysterious phenomenon -- if you spend $n$ hours on an essay, your score on the essay will be $100\left( 1-4^{-n} \right)$ points if $2n$ is an integer, and $0$ otherwise. For example, if you spend $30$ minutes on an essay you will get a score of $50$, but if you spend $35$ minutes on the essay you somehow do not earn any points. It is 4AM, your English class starts at 8:05AM the same day, and you have four essays due at the start of class. If you can only work on one essay at a time, what is the maximum possible average of your essay scores? [i]Proposed by Evan Chen[/i]

Say a number is [i]tico[/i] if the sum of it's digits is a multiple of $2003$. $\text{(i)}$ Show that there exists a positive integer $N$ such that the first $2003$ multiples, $N,2N,3N,\ldots 2003N$ are all tico. $\text{(ii)}$ Does there exist a positive integer $N$ such that all it's multiples are tico?

The plane has a circle $\omega$ and a point $A$ outside it. For any point $C$, the point $B$ on the circle $\omega$ is defined such that $ABC$ is an equilateral triangle with vertices $A, B$ and $C$ listed clockwise. Prove that if point $B$ moves along the circle $\omega$, then point $C$ also moves along a circle.

Each angle of a rectangle is trisected. The intersections of the pairs of trisectors adjacent to the same side always form: $ \textbf{(A)}\ \text{a square} \qquad\textbf{(B)}\ \text{a rectangle} \qquad\textbf{(C)}\ \text{a parallelogram with unequal sides} \\ \textbf{(D)}\ \text{a rhombus} \qquad\textbf{(E)}\ \text{a quadrilateral with no special properties}$

Rectangle $ABCD$ is given with $AB=63$ and $BC=448.$ Points $E$ and $F$ lie on $AD$ and $BC$ respectively, such that $AE=CF=84.$ The inscribed circle of triangle $BEF$ is tangent to $EF$ at point $P,$ and the inscribed circle of triangle $DEF$ is tangent to $EF$ at point $Q.$ Find $PQ.$

Let $k$ be an odd number that is greater than or equal to $3$. Prove that there exists a $k^{th}$-degree integer-valued polynomial with non-integer-coefficients that has the following properties: (1) $f(0)=0$ and $f(1)=1$; and. (2) There exist infinitely many positive integers $n$ so that if the following equation: \[ n= f(x_1)+\cdots+f(x_s), \] has integer solutions $x_1, x_2, \dots, x_s$, then $s \geq 2^k-1$.