If $a$ and $b$ are positive real numbers and each of the equations \[x^2+ax+2b = 0\quad\text{and}\quad x^2+2bx+a = 0\] has real roots, then the smallest possible value of $a+b$ is $\textbf{(A) }2\qquad \textbf{(B) }3\qquad \textbf{(C) }4\qquad \textbf{(D) }5\qquad \textbf{(E) }6$

Let $a,b,c$ be three positive real numbers such that $ a \le b \le c$ and $a+b+c=1$. Prove that \[\frac{a+c}{\sqrt{a^2+c^2}}+\frac{b+c}{\sqrt{b^2+c^2}}+\frac{a+b}{\sqrt{a^2+b^2}} \le \frac{3\sqrt{6}(b+c)^2}{\sqrt{(a^2+b^2)(b^2+c^2)(c^2+a^2)}}.\] [i]Owen Goff.[/i]

Right isosceles triangle $T$ is placed in the first quadrant of the coordinate plane. Suppose that the projection of $T$ onto the $x$-axis has length $6$, while the projection of $T$ onto the $y$-axis has length $8$. What is the sum of all possible areas of the triangle $T$? [asy] import olympiad; size(120); defaultpen(linewidth(0.8)); pair A = (0.9,0.6), B = (1.7, 0.8), C = rotate(270, B)*A; pair PAx = (A.x,0), PBx = (B.x,0), PAy = (0, A.y), PCy = (0, C.y); draw(PAx--A--PAy^^PCy--C^^PBx--B, linetype("4 4")); draw(rightanglemark(A,B,C,3)); draw(A--B--C--cycle); draw((0,2)--(0,0)--(2,0),Arrows(size=8)); label("$6$",(PAx+PBx)/2,S); label("$8$",(PAy+PCy)/2,W); [/asy]

For each positive integer $m$ and $n$ define function $f(m, n)$ by $f(1, 1) = 1$, $f(m+ 1, n) = f(m, n) +m$ and $f(m, n + 1) = f(m, n) - n$. Find the sum of all the values of $p$ such that $f(p, q) = 2004$ for some $q$.

Let $f(x)$ be a continuous function satisfying $f(x)=1+k\int_{-\frac{\pi}{2}}^{\frac{\pi}{2}} f(t)\sin (x-t)dt\ (k:constant\ number)$ Find the value of $k$ for which $\int_0^{\pi} f(x)dx$ is maximized.

Determine all positive integers $a,b,c,d$ such that$$\begin{cases} a<b \\ a^2c =b^2d \\ ab+cd =2^{99}+2^{101} \end{cases}$$

Let $ABCD$ be a parallelogram with center $O$ such that $\angle BAD <90^o$ and $\angle AOB> 90^o$. Consider points $A_1$ and $B_1$ on the rays $OA$ and $OB$ respectively, such that $A_1B_1$ is parallel to $AB$ and $\angle A_1B_1C = \frac12 \angle ABC$. Prove that $A_1D$ is perpendicular to $B_1C$.

In an international meeting of $n \geq 3$ participants, 14 languages are spoken. We know that: - Any 3 participants speak a common language. - No language is spoken more that by the half of the participants. What is the least value of $n$?

Let $\Gamma$ be a circle of radius $1$ centered at $O$. A circle $\Omega$ is said to be \emph{friendly} if there exist distinct circles $\omega_1$, $\omega_2$, $\ldots$, $\omega_{2020}$, such that for all $1\le i\le2020$, $\omega_i$ is tangent to $\Gamma$, $\Omega$, and $\omega_{i+1}$. (Here, $\omega_{2021} = \omega_1$.) For each point $P$ in the plane, let $f(P)$ denote the sum of the areas of all friendly circles centered at $P$. If $A$ and $B$ are points such that $OA=\frac12$ and $OB=\frac13$, determine $f(A)-f(B)$. [i]Proposed by Michael Ren.[/i]

Let $ABCD$ be a square of the plane $P$. Define the minimum and the maximum the value of the function $f: P \to R$ is given by $f (P) =\frac{PA + PB}{PC + PD}$

Let $n$ be the largest integer such that $5^n$ divides $12^{2015}+13^{2015}$. Compute the remainder when $\frac{12^{2015}+13^{2015}}{5^n}$ is divided by $1000$.

The number "3" is written on a board. Ana and Bernardo take turns, starting with Ana, to play the following game. If the number written on the board is $n$, the player in his/her turn must replace it by an integer $m$ coprime with $n$ and such that $n<m<n^2$. The first player that reaches a number greater or equal than 2016 loses. Determine which of the players has a winning strategy and describe it.

From a point $ M $ on the surface of a sphere, three mutually perpendicular chords $ MA $, $ MB $, $ MC $ are drawn. Prove that the segment joining the point $ M $ with the center of the sphere intersects the plane of the triangle $ ABC $ at the center of gravity of this triangle.

In fencing, you win a round if you are the first to reach $15$ points. Suppose that when $A$ plays against $B$, at any point during the round, $A$ scores the next point with probability $p$ and $B$ scores the next point with probability $q=1-p$. (However, they never can both score a point at the same time.) Suppose that in this round, $A$ already has $14-k$ points, and $B$ has $14-\ell$ (where $0\le k,\ell\le 14$). By how much will the probability that $A$ wins the round increase if $A$ scores the next point?

Let $n>1$ be a given integer. The Mint issues coins of $n$ different values $a_1, a_2, ..., a_n$, where each $a_i$ is a positive integer (the number of coins of each value is unlimited). A set of values $\{a_1, a_2,..., a_n\}$ is called [i]lucky[/i], if the sum $a_1+ a_2+...+ a_n$ can be collected in a unique way (namely, by taking one coin of each value). (a) Prove that there exists a lucky set of values $\{a_1, a_2, ..., a_n\}$ with $$a_1+ a_2+...+ a_n < n \cdot 2^n.$$ (b) Prove that every lucky set of values $\{a_1, a_2,..., a_n\}$ satisfies $$a_1+ a_2+...+ a_n >n \cdot 2^{n-1}.$$ Proposed by Ilya Bogdanov

Suppose $f_1(x), f_2(x), \dots, f_n(x)$ are functions of $n$ real variables $x = (x_1, \dots, x_n)$ with continuous second-order partial derivatives everywhere on $\mathbb{R}^n$. Suppose further that there are constants $c_{ij}$ such that \[ \frac{\partial f_i}{\partial x_j} - \frac{\partial f_j}{\partial x_i} = c_{ij} \] for all $i$ and $j$, $1\leq i \leq n$, $1 \leq j \leq n$. Prove that there is a function $g(x)$ on $\mathbb{R}^n$ such that $f_i + \partial g/\partial x_i$ is linear for all $i$, $1 \leq i \leq n$. (A linear function is one of the form \( a_0 + a_1 x_1 + a_2 x_2 + \cdots + a_n x_n.) \)

Two positive valued sequences $\{ a_{n}\}$ and $\{ b_{n}\}$ satisfy: (a): $a_{0}=1 \geq a_{1}$, $a_{n}(b_{n+1}+b_{n-1})=a_{n-1}b_{n-1}+a_{n+1}b_{n+1}$, $n \geq 1$. (b): $\sum_{i=1}^{n}b_{i}\leq n^{\frac{3}{2}}$, $n \geq 1$. Find the general term of $\{ a_{n}\}$.

Suppose $P(x)$ is a polynomial with real coefficients, satisfying the condition $P(\cos \theta+\sin \theta)=P(\cos \theta-\sin \theta)$, for every real $\theta$. Prove that $P(x)$ can be expressed in the form$$P(x)=a_0+a_1(1-x^2)^2+a_2(1-x^2)^4+\dots+a_n(1-x^2)^{2n}$$for some real numbers $a_0, a_1, \dots, a_n$ and non-negative integer $n$. [i]Proposed by C.R. Pranesacher[/i]

Suppose there are $n$ points on the plane, no three of which are collinear. Draw $n-1$ non-intersecting segments (except possibly at endpoints) between pairs of points, such that it is possible to travel between any two points by travelling along the segments. Such a configuration of points and segments is called a [i]network[/i]. Given a network, we may assign labels from $1$ to $n-1$ to each segment such that each segment gets a different label. Define a [i]spin[/i] as the following operation: $\bullet$ Choose a point $v$ and rotate the labels of its adjacent segments clockwise. Formally, let $e_1,e_2,\cdots,e_k$ be the segments which contain $v$ as an endpoint, sorted in clockwise order (it does not matter which segment we choose as $e_1$). Then, the label of $e_{i+1}$ is replaced with the label of $e_{i}$ simultaneously for all $1 \le i \le k$. (where $e_{k+1}=e_{1}$) A network is [i]nontrivial[/i] if there exists at least $2$ points with at least $2$ adjacent segments each. A network is [i]versatile[/i] if any labeling of its segments can be obtained from any initial labeling using a finite amount of spins. Find all integers $n \ge 5$ such that any nontrivial network with $n$ points is versatile. [i]Proposed by Yeoh Zi Song[/i]

Let $ABC$ be an isosceles triangle ($AB=AC$) with incenter $I$. Circle $\omega$ passes through $C$ and $I$ and is tangent to $AI$. $\omega$ intersects $AC$ and circumcircle of $ABC$ at $Q$ and $D$, respectively. Let $M$ be the midpoint of $AB$ and $N$ be the midpoint of $CQ$. Prove that $AD$, $MN$ and $BC$ are concurrent. [i]Proposed by Alireza Dadgarnia[/i]

For a positive integer $n$ we denote by $s(n)$ the sum of the digits of $n$. Let $P(x)=x^n+a_{n-1}x^{n-1}+\cdots+a_1x+a_0$ be a polynomial, where $n \geqslant 2$ and $a_i$ is a positive integer for all $0 \leqslant i \leqslant n-1$. Could it be the case that, for all positive integers $k$, $s(k)$ and $s(P(k))$ have the same parity?

Prove that $ \exists X,Y,Z\in \mathcal{M}_n(\mathbb{C})$ such that a)$ X^2\plus{}Y^2\equal{}A$ b) $ X^3\plus{}Y^3\plus{}Z^3\equal{}A$ , where $ A\in \mathcal{M}_n(\mathbb{C})$

$n$ points are marked on the board points that are vertices of the regular $n$ -gon. One of the points is a chip. Two players take turns moving it to the other marked point and at the same time draw a segment that connects them. If two points already connected by a segment, such a move is prohibited. A player who can't make a move, lose. Which of the players can guarantee victory?

Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.

Prove: (a) There are infinitely many triples of positive integers $m, n, p$ such that $4mn - m- n = p^2 - 1.$ (b) There are no positive integers $m, n, p$ such that $4mn - m- n = p^2.$