Let the maximum and minimum value of $f(x)=\cos \left(x^{2018}\right) \sin x$ are $M$ and $m$ respectively where $x \in[-2 \pi, 2 \pi] .$ Then $$ M+m= $$ [list=1] [*] $\frac{1}{2}$ [*] $-\frac{1}{\sqrt{2}}$ [*] $\frac{1}{2018}$ [*] Does not exists [/list]

Rosa and Sara play with a triangle $ABC$, right at $B$. Rosa begins by marking two interior points of the hypotenuse $AC$, then Sara marks an interior point of the hypotenuse $AC$ different from those of Rosa. Then, from these three points the perpendiculars to the sides $AB$ and $BC$ are drawn, forming the following figure. [img]https://cdn.artofproblemsolving.com/attachments/9/9/c964bbacc4a5960bee170865cc43902410e504.png[/img] Sara wins if the area of the shaded surface is equal to the area of the unshaded surface, in other case wins Rosa. Determine who of the two has a winning strategy.

Let $n$ be a positive integer prove that $$6\nmid \lfloor (\sqrt[3]{28}-3)^{-n} \rfloor.$$

Let $\triangle{ABC}$ be an equilateral triangle with side length $4.$ Across all points $P$ inside triangle $\triangle{ABC}$ satisfying $[PAB]+[PAC]=[PBC],$ compute the minimal possible length of $PA.$ (Here, $[XYZ]$ denotes the area of triangle $\triangle{XYZ}.$)

The sum of several positive integers, not necessarily different, all of them less than or equal to $10$, is equal to $S$. We want to distribute all these numbers into two groups such that the sum of the numbers in each group is less than or equal to $80.$ Determine all values ​​of $S$ for which this is possible.

Let $M$ be a point in the triangle $ABC$ such that \[\text{area}(ABM)=2 \cdot \text{area}(ACM)\] Show that the locus of all such points is a straight line.

Given that, a function $f(n)$, defined on the natural numbers, satisfies the following conditions: (i)$f(n)=n-12$ if $n>2000$; (ii)$f(n)=f(f(n+16))$ if $n \leq 2000$. (a) Find $f(n)$. (b) Find all solutions to $f(n)=n$.

Find all pairs $(a,b)$ of positive integers such that $a!+b$ and $b!+a$ are both powers of $5$. [i]Nikola Velov, North Macedonia[/i]

Start with an angle of $60^\circ$ and bisect it, then bisect the lower $30^\circ$ angle, then the upper $15^\circ$ angle, and so on, always alternating between the upper and lower of the previous two angles constructed. This process approaches a limiting line that divides the original $60^\circ$ angle into two angles. Find the measure (degrees) of the smaller angle.

$ n$ sets $ S_1$, $ S_2$ $ \cdots$, $ S_n$ consists of non-negative numbers. $ x_i$ is the sum of all elements of $ S_i$, prove that there is a natural number $ k$, $ 1<k<n$, and: \[ \sum_{i\equal{}1}^n x_i < \frac{1}{k\plus{}1} \left[ k \cdot \frac{n(n\plus{}1)(2n\plus{}1)}{6} \minus{} (k\plus{}1)^2 \cdot \frac{n(n\plus{}1)}{2} \right]\] and there exists subscripts $ i$, $ j$, $ t$, and $ l$ (at least $ 3$ of them are distinct) such that $ x_i \plus{} x_j \equal{} x_t \plus{} x_l$.

Let $S$ be a set of integers such that if $a$ and $b$ are in $S$ then $3a-2b$ is also in $S$. How many ways are there to construct $S$ such that $S$ contains exactly $4$ elements in the interval $[0,40]$? [i]Proposed by Harry Kim[/i]

There are three solutions with different percentages of alcohol. If you mix them in a ratio of $1:2:3$, you get a $20\%$ solution. If you mix them in a ratio of $5: 4: 3,$ you will get a solution with $50\%$ alcohol content. What percentage of alcohol will the solution contain if equal amounts of the original solutions are mixed?

a) Let $\{a_n\}_{n=1}^\infty$ is sequence of integers bigger than 1. Proove that if $x>0$ is irrational, then $\ds x_n>\frac{1}{a_{n+1}}$ for infinitely many $n$, where $x_n$ is fractional part of $a_na_{n-1}\dots a_1x$. b)Find all sequences $\{a_n\}_{n=1}^\infty$ of positive integers, for which exist infinitely many $x\in(0,1)$ such that $\ds x_n>\frac{1}{a_{n+1}}$ for all $n$. [i]Nikolai Nikolov, Emil Kolev[/i]

Every cell of a $m \times n$ chess board, $m\ge 2,n\ge 2$, is colored with one of four possible colors, e.g white, green, red, blue. We call such coloring good if the four cells of any $2\times 2$ square of the chessboard are colored with pairwise different colors. Determine the number of all good colorings of the chess board. [i]Proposed by N. Beluhov[/i]

A right circular cone has base of radius 1 and height 3. A cube is inscribed in the cone so that one face of the cube is contained in the base of the cone. What is the side-length of the cube?

Let $b \geq 2$ be a positive integer. (a) Show that for an integer $N$, written in base $b$, to be equal to the sum of the squares of its digits, it is necessary either that $N = 1$ or that $N$ have only two digits. (b) Give a complete list of all integers not exceeding $50$ that, relative to some base $b$, are equal to the sum of the squares of their digits. (c) Show that for any base b the number of two-digit integers that are equal to the sum of the squares of their digits is even. (d) Show that for any odd base $b$ there is an integer other than $1$ that is equal to the sum of the squares of its digits.

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$.

Given a $20 \times 101$ square table with $20$ rows and $101$ columns. One wants to fill numbers $0$ and $1$ in the unit squares of the table satisfying the following conditions: $[\text{i}]$ Each square has exactly one number to be filled in. $[\text{ii}]$ Each column is filled with exactly two $1'$s. $[\text{iii}]$ Any two rows with no more than one column are filled with two $1'$s. $a.$ How many ways to fill the numbers satisfying the given conditions? $b.$ With a satisfied numbering way, we number the rows in order from top to bottom. A triple of row (distinct, unordered) $\{a; b; c\}$ is said to be [i]united[/i] if the sets of numbers in the three rows are $(a_1, a_2, . . . , a_{101}), (b_1, b_2, . . . . , b_{101}),$ and $(c_1, c_2, . . . . , c_{101})$ satisfied$$\sum\limits_{i = 1}^{101} {({a_i}{b_i} + {b_i}{c_i} + {c_i}{a_i})} = 3.$$ Prove that: there are at least $10$ [i]united[/i] sets.

Let $s$ be any arc of the unit circle lying entirely in the first quadrant. Let $A$ be the area of the region lying below $s$ and above the $x$-axis and let $B$ be the area of the region lying to the right of the $y$-axis and to the left of $s$. Prove that $A+B$ depends only on the arc length, and not on the position, of $s$.

Let $a,b,c,d$ be positive real numbers such that $\frac{1}{a+1}+\frac{1}{b+1}+\frac{1}{c+1}+\frac{1}{d+1}=2$. Prove that $$\sum_{cyc} \sqrt{\frac{a^2+1}{2}} \geq (3.\sum_{cyc} \sqrt{a}) -8$$

A number is [i]additive[/i] if it has three digits, all of them are different and the sum of two of the digits is equal to the remaining one. (For example, $123 (1+2=3), 945 (4+5=9)$). Find the sum of all additive numbers.

Two different integers $u$ and $v$ are written on a board. We perform a sequence of steps. At each step we do one of the following two operations: (i) If $a$ and $b$ are different integers on the board, then we can write $a + b$ on the board, if it is not already there. (ii) If $a$, $b$ and $c$ are three different integers on the board, and if an integer $x$ satisfies $ax^2 +bx+c = 0$, then we can write $x$ on the board, if it is not already there. Determine all pairs of starting numbers $(u, v)$ from which any integer can eventually be written on the board after a finite sequence of steps.

An ATM password at Fred's Bank is composed of four digits from $0$ to $9$, with repeated digits allowable. If no password may begin with the sequence $9,1,1,$ then how many passwords are possible? $\textbf{(A)}\mbox{ }30\qquad\textbf{(B)}\mbox{ }7290\qquad\textbf{(C)}\mbox{ }9000\qquad\textbf{(D)}\mbox{ }9990\qquad\textbf{(E)}\mbox{ }9999$

Ben "One Hunna Dolla" Franklin is flying a kite $KITE$ such that $IE$ is the perpendicular bisector of $KT$. Let $IE$ meet $KT$ at $R$. The midpoints of $KI,IT,TE,EK$ are $A,N,M,D,$ respectively. Given that $[MAKE]=18,IT=10,[RAIN]=4,$ find $[DIME]$. Note: $[X]$ denotes the area of the figure $X$.

Find out which of the two numbers is greater: $$\dfrac{2}{2 +\dfrac{2}{2 +\dfrac{2}{... +\dfrac{2}{2+\frac22}}}} \,\,\, \text{or} \,\,\, \dfrac{3}{3 +\dfrac{3}{3 +\dfrac{3}{... +\dfrac{3}{3+\frac33}}}}$$ (Each expression has $2022$ fraction signs.)