\[\int_0^{2\pi} \frac{1}{3+2 \sqrt{3} \cos x + \cos^2 x}\mathrm dx\] [i]Proposed by Robert Trosten[/i]

Compute the remainder when $98!$ is divided by $101$.

Let $n$ be a natural composite number. Prove that there are integers $a_1, a_2,. . . , a_k$ all greater than $ 1$, such that $$a_1 + a_2 +... + a_k = n \left(\frac{1}{a_1}+\frac{1}{a_2}+...+\frac{1}{a_k}\right)$$

Call a positive integer [i]monotonous[/i] if it is a one-digit number or its digits, when read from left to right, form either a strictly increasing or a strictly decreasing sequence. For example, 3, 23578, and 987620 are monotonous, but 88, 7434, and 23557 are not. How many monotonous positive integers are there? $\textbf{(A)} \text{ 1024} \qquad \textbf{(B)} \text{ 1524} \qquad \textbf{(C)} \text{ 1533} \qquad \textbf{(D)} \text{ 1536} \qquad \textbf{(E)} \text{ 2048}$

Numbers $1$ through $2014$ are written on a board. A valid operation is to erase two numbers $a$ and $b$ on the board and replace them with the greatest common divisor and the least common multiple of $a$ and $b$. Prove that, no matter how many operations are made, the sum of all the numbers that remain on the board is always larger than $2014$ $\times$ $\sqrt[2014]{2014!}$

Prove that in any described $8$-gon there is a side that does not exceed the diameter of the inscribed circle in length. [i]P.A.Kozhevnikov[/i]

For every positive integer $N\geq 2$ with prime factorisation $N=p_1^{a_1}p_2^{a_2}\cdots p_k^{a_k}$ we define \[f(N):=1+p_1a_1+p_2a_2+\cdots+p_ka_k.\] Let $x_0\geq 2$ be a positive integer. We define the sequence $x_{n+1}=f(x_n)$ for all $n\geq 0.$ Prove that this sequence is eventually periodic and determine its fundamental period.

The set of points in $3$-dimensional coordinate space that lie in the plane $x+y+z=75$ whose coordinates satisfy the inequalities $$x-yz<y-zx<z-xy$$forms three disjoint convex regions. Exactly one of those regions has finite area. The area of this finite region can be expressed in the form $a\sqrt{b},$ where $a$ and $b$ are positive integers and $b$ is not divisible by the square of any prime. Find $a+b.$

Define \[ S = \tan^{-1}(2020) + \sum_{j = 0}^{2020} \tan^{-1}(j^2 - j + 1). \] Then $S$ can be written as $\frac{m \pi}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Construct a set of $k$ integer weights that allows you to get any total integer weight from $1$ up to $55$ grams even if some of the weights of the set are lost. Consider two versions: (a) $k = 10$, and any one of the weights may be lost; (b) $k = 12$, and any two of the weights may be lost. (D Zvonkin) (In both cases prove that the set found has the property required.)

The plane $\alpha$ intersects the edges $AB$, $BC$, $CD$ and $DA$ of the tetrahedron $ABCD$ at points $X, Y, Z$ and $T$, respectively. It turned out, that points $Y$ and $T$ lie on a circle $\omega$ constructed with segment $XZ$ as the diameter. Point $P$ is marked in the plane $\alpha$ so that the lines $P Y$ and $P T$ are tangent to the circle $\omega$.Prove that the midpoints of the edges are $AB$, $BC$, $CD,$ $DA$ and the point $P$ lie in the same plane.

Find the flux of the vector field $\overrightarrow{r}/r^3$ through the surface \[(x-1)^2+y^2+z^2=2\]

Let $ABCD$ be a quadrilateral, let $O$ be the intersection point of diagonals $AC$ and $BD$, and let $P$ be the intersection point of sides $AB$ and $CD$. Consider the parallelograms $AODE$ and $BOCF$. Prove that $E, F$ and $P$ are collinear.

Solve the system of equation for $(x,y) \in \mathbb{R}$ $$\left\{\begin{matrix} \sqrt{x^2+y^2}+\sqrt{(x-4)^2+(y-3)^2}=5\\ 3x^2+4xy=24 \end{matrix}\right.$$ \\ Explain your answer

In a drawer, there are at most $ 2009$ balls, some of them are white, the rest are blue, which are randomly distributed. If two balls were taken at the same time, then the probability that the balls are both blue or both white is $ \frac12$. Determine the maximum amount of white balls in the drawer, such that the probability statement is true?

Prove that every convex $n$-gon of area $1$ contains a quadrilateral of area at least $\frac12 $. .

You are trying to maximize a function of the form $f(x, y, z) = ax + by + cz$, where $a$, $b$, and $c$ are constants. You know that $f(3, 1, 1) > f(2, 1, 1)$, $f(2, 2, 3) > f(2, 3, 4)$, and $f(3, 3, 4) > f(3, 3, 3)$. For $-5 \le x,y,z \le 5$, what value of $(x,y,z)$ maximizes the value of $f(x, y, z)$? Give your answer as an ordered triple.

Let $k>2$ be a positive integer. Elise and Xavier play a game that has four steps, in this order. [list=1] [*]Elise picks $2$ nonzero digits $(1-9)$, called $e$ and $f$. [*]Xavier then picks $k$ nonzero digits $(1-9)$, called $x_1,\cdots,x_k$. [*]Elise picks any positive integer $d$. [*]Xaiver picks an integer $b>10$.[/list] Each player's choices are known to the other player when the choices are made. The winner is determined as follows. Elise writes down the two-digit base $b$ number $ef_b$. Next, Xavier writes the $k$-digit base $b$ number that is constructed by concatenating his digits, \[(x_1\cdots x_k)_b.\] They then compute the greatest common divisor (gcd) of these two numbers. If this gcd is greater than or equal to the integer $d$ then Xavier wins. Otherwise Elise wins. (As an example game for $k=3$, Elise chooses the digits $(e, f) = (2, 4)$, Xavier chooses $(4, 4, 8)$, and then Elise picks $d = 100$. Xavier picks base $b = 25$. The base-25 numbers $2425$ and $44825$ are, respectively, equal to $54$ and $2608$. The greatest common divisor of these two is $2$, which is much less than $100$, so Elise wins handily.) Find all $k$ for which Xavier can force a win, no matter how Elise plays.

An acute-angled $ABC \ (AB<AC)$ is inscribed into a circle $\omega$. Let $M$ be the centroid of $ABC$, and let $AH$ be an altitude of this triangle. A ray $MH$ meets $\omega$ at $A'$. Prove that the circumcircle of the triangle $A'HB$ is tangent to $AB$. [i](A.I. Golovanov , A.Yakubov)[/i]

In the [i]minesweeper[/i] game below, each unopened square (for example, the one in the top left corner) is either empty or contains a mine. The other squares are empty and display the number of mines in the neighboring 8 squares (if this is 0, the square is unmarked). What is the minimum possible number of mines present on the field? [img]http://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvZS9hLzNlYTNhMjI2YWYyNmFkZGFiNWFmODBhNzA3YjA3OWM5MTZlNDlkLnBuZw==&rn=bWluZXN3ZWVwZXIucG5n[/img] [i]2016 CCA Math Bonanza Team #4[/i]

Prove that every positive integer $n$, except a finite number of them, can be represented as a sum of $2004$ positive integers: $n=a_1+a_2+\cdots +a_{2004}$, where $1\le a_1<a_2<\cdots <a_{2004}$, and $a_i \mid a_{i+1}$ for all $1\le i\le 2003$. [i]Chen Yonggao[/i]

The sides $PQ$ and $PR$ of triangle $PQR$ are respectively of lengths $4$ inches, and $7$ inches. The median $PM$ is $3\frac{1}{2}$ inches. Then $QR$, in inches, is: $\textbf{(A) }6\qquad\textbf{(B) }7\qquad\textbf{(C) }8\qquad\textbf{(D) }9\qquad \textbf{(E) }10$

If $q_1 ( x )$ and $r_ 1$ are the quotient and remainder, respectively, when the polynomial $x^ 8$ is divided by $x + \tfrac{1}{2}$ , and if $q_ 2 ( x )$ and $r_2$ are the quotient and remainder, respectively, when $q_ 1 ( x )$ is divided by $x + \tfrac{1}{2}$, then $r_2$ equals $\textbf{(A) }\frac{1}{256}\qquad\textbf{(B) }-\frac{1}{16}\qquad\textbf{(C) }1\qquad\textbf{(D) }-16\qquad\textbf{(E) }256$

If positive reals $ x_1,x_2,\cdots,x_n $ satisfy $\sum_{i=1}^{n}x_i=1.$ Prove that$$\sum_{i=1}^{n}\frac{1}{1+\sum_{j=1}^{i}x_j}<\sqrt{\frac{2}{3}\sum_{i=1}^{n}\frac{1}{x_i}} $$

In a triangle $ABC$, the line symmetric to the median through $A$ with respect to the bisector of the angle at $A$ intersects $BC$ at $M$. Points $P$ on $AB$ and $Q$ on $AC$ are chosen such that $MP\parallel AC$ and $MQ\parallel AB$. Prove that the circumcircle of the triangle $MPQ$ is tangent to the line $BC$.