Let $a, b, c$ be positive reals, and let $\sqrt[2013]{\frac{3}{a^{2013}+b^{2013}+c^{2013}}}=P$. Prove that \[\prod_{\text{cyc}}\left(\frac{(2P+\frac{1}{2a+b})(2P+\frac{1}{a+2b})}{(2P+\frac{1}{a+b+c})^2}\right)\ge \prod_{\text{cyc}}\left(\frac{(P+\frac{1}{4a+b+c})(P+\frac{1}{3b+3c})}{(P+\frac{1}{3a+2b+c})(P+\frac{1}{3a+b+2c})}\right).\][i]Proposed by David Stoner[/i]

Given an acute triangle $ABC$. Points $B'$ and $C'$ are symmetrical, respectively, to vertices $B$ and $ C$ wrt straight lines $AC$ and $AB$. Let $P$ be the intersection point of the circumcircles of triangles $ABB'$ and $ACC'$, different from $A$. Prove that the center of the circumcircle of triangle $ABC$ lies on line $PA$.

Let $p,q$ be prime numbers such that $n^{3pq}-n$ is a multiple of $3pq$ for [b]all[/b] positive integers $n$. Find the least possible value of $p+q$.

Prove that there are infinitely many positive integers $m$ for which there exists consecutive odd positive integers $p_m<q_m$ such that $p_m^2+p_mq_m+q_m^2$ and $p_m^2+m\cdot p_mq_m+q_m^2$ are both perfect squares. If $m_1, m_2$ are two positive integers satisfying this condition, then we have $p_{m_1}\neq p_{m_2}$

Let $N>1$ be an integer. We are adding all remainders when we divide $N$ by all positive integers less than $N$. If this sum is less than $N$, find all possible values of $N$.

Initially, the number $1$ is written on the blackboard. At each step, the number on the blackboard is erased and another is written, which is obtained by applying any of the following operations: Operation A: Multiply the number on the board with $\frac12$. Operation B: Subtract the number on the board from $1$. For example, if the number $\frac38$ is on the board, it can be replaced by $\frac12 \frac38=\frac{3}{16}$ or by $1-\frac38=\frac58$ . Give a sequence of steps after which the number on the board is $\frac{2009}{2^{20009}}$ .

Determine the smallest positive integer $ n$ such that there exists positive integers $ a_1,a_2,\cdots,a_n$, that smaller than or equal to $ 15$ and are not necessarily distinct, such that the last four digits of the sum, \[ a_1!\plus{}a_2!\plus{}\cdots\plus{}a_n!\] Is $ 2001$.

Let $p$ be a prime number of the form $9k + 1$. Show that there exists an integer n such that $p | n^3 - 3n + 1$.

In a triangle $ABC$ with $AC\ne BC$, $M$ is the midpoint of $AB$ and $\angle A=\alpha$, $\angle B=\beta$, $\angle ACM=\varphi$ and $\angle BSM=\Psi$. Prove that $$\frac{\sin\alpha\sin\beta}{\sin(\alpha-\beta)}=\frac{\sin\varphi\sin\Psi}{\sin(\varphi-\Psi)}.$$

Prove that for all n=3,4,5.... there excist odd x,y such $2^n=x^2 + 7y^2$ .

A convex quadrilateral is inscribed in a circle of radius $1$. Prove that the difference between its perimeter and the sum of the lengths of its diagonals is greater than zero and less than $2.$

Which of the following integers cannot be written as the sum of four consecutive odd integers? $\textbf{(A)}\text{ 16}\qquad\textbf{(B)}\text{ 40}\qquad\textbf{(C)}\text{ 72}\qquad\textbf{(D)}\text{ 100}\qquad\textbf{(E)}\text{ 200}$

Find the minimum value of \[\frac{x^3+1}{(y-1)(z+1)}+\frac{y^3+1}{(z-1)(x+1)}+\frac{z^3+1}{(x-1)(y+1)}\] where $x,y,z>1$ are reals.

Determine all functions $f : N_0 \to R$ satisfying $f (x+y)+ f (x-y)= f (3x)$ for all $x,y$.

Let $ABC$ be a triangle with $BC=7,AB=5$, and $AC=8$. Let $M,N$ be the midpoints of sides $AC,AB$ respectively, and let $O$ be the circumcenter of $ABC$. Let $BO, CO$ meet $AC, AB$ at $P$ and $Q$, respectively. If $MN$ meets $PQ$ at $R$ and $OR$ meets $BC$ at $S$, then the value of $OS^2$ can be written in the form $\frac{m}{n}$ where $m,n$ are relatively prime positive integers. Find $100m+n$. [i]Proposed by Vincent Huang[/i]

In the fourth annual Swirled Series, the Oakland Alphas are playing the San Francisco Gammas. The first game is played in San Francisco and succeeding games alternate in location. San Francisco has a $50\%$ chance of winning their home games, while Oakland has a probability of $60\%$ of winning at home. Normally, the series will stretch on forever until one team gets a three game lead, in which case they are declared the winners. However, after each game in San Francisco there is a $50\%$ chance of an earthquake, which will cause the series to end with the team that has won more games declared the winner. What is the probability that the Gammas will win?

A coast artillery gun can fire at every angle of elevation between $0^{\circ}$ and $90^{\circ}$ in a fixed vertical plane. If air resistance is neglected and the muzzle velocity is constant ($=v_0 $), determine the set $H$ of points in the plane and above the horizontal which can be hit.

On a circle, Alina draws $2019$ chords, the endpoints of which are all different. A point is considered [i]marked[/i] if it is either $\text{(i)}$ one of the $4038$ endpoints of a chord; or $\text{(ii)}$ an intersection point of at least two chords. Alina labels each marked point. Of the $4038$ points meeting criterion $\text{(i)}$, Alina labels $2019$ points with a $0$ and the other $2019$ points with a $1$. She labels each point meeting criterion $\text{(ii)}$ with an arbitrary integer (not necessarily positive). Along each chord, Alina considers the segments connecting two consecutive marked points. (A chord with $k$ marked points has $k-1$ such segments.) She labels each such segment in yellow with the sum of the labels of its two endpoints and in blue with the absolute value of their difference. Alina finds that the $N + 1$ yellow labels take each value $0, 1, . . . , N$ exactly once. Show that at least one blue label is a multiple of $3$. (A chord is a line segment joining two different points on a circle.)

Three prime numbers $p,q,r$ and a positive integer $n$ are given such that the numbers \[ \frac{p+n}{qr}, \frac{q+n}{rp}, \frac{r+n}{pq} \] are integers. Prove that $p=q=r $. [i]Nazar Agakhanov[/i]

$5$ monkeys, $5$ snakes, and $5$ tigers are standing in line at the local grocery store, with animals of the same species being indistinguishable. A monkey stands at the front of the line and a tiger stands at the end of the line. Unfortunately, monkeys and tigers are sworn enemies, so monkeys and tigers cannot stand in adjacent places in line. Compute the number of possible arrangements of the line.

A tortoise walks $60$ meters per hour and a lizard walks at $240$ meters per hour. There is a rectangle $ABCD$ where $AB =60$ and $AD =120$. Both start from the vertex $A$ and in the same direction ($A \to B \to D \to A$), crossing the edge of the rectangle. The lizard has the habit of advancing two consecutive sides of the rectangle, turning to go back one, turning to go forward two, turning to go back one and so on. How many times and in what places do the tortoise and the lizard meet when the tortoise completes its third turn?

Given a function $f(x)=a\sin x-\frac{1}{2}\cos 2x+a-\frac{3}{a}+\frac{1}{2}$, where $a\in\mathbb{R}, a\ne 0$. [b](1)[/b] If for any $x\in\mathbb{R}$, inequality $f(x)\le 0$ holds, find all possible value of $a$. [b](2)[/b] If $a\ge 2$, and there exists $x\in\mathbb{R}$, such that $f(x)\le 0$. Find all possible value of $a$.

Let $ S_i$ be the set of all integers $ n$ such that $ 100i\leq n < 100(i \plus{} 1)$. For example, $ S_4$ is the set $ {400,401,402,\ldots,499}$. How many of the sets $ S_0, S_1, S_2, \ldots, S_{999}$ do not contain a perfect square?

Let $n$ be a positive integer. There is a collection of cards that meets the following properties: $\bullet$Each card has a number written in the form $m!$, where $m$ is a positive integer. $\bullet$For every positive integer $t\le n!$, it is possible to choose one or more cards from the collection in such a way $\text{ }$that the sum of the numbers of those cards is $t$. Determine, based on $n$, the smallest number of cards that this collection can have.

In triangle $ABC$, let the circumcenter, incenter, and orthocenter be $O$, $I$, and $H$ respectively. Segments $AO$, $AI$, and $AH$ intersect the circumcircle of triangle $ABC$ at $D$, $E$, and $F$. $CD$ intersects $AE$ at $M$ and $CE$ intersects $AF$ at $N$. Prove that $MN$ is parallel to $BC$.