Let $ABC$ be an acute triangle with circumcenter $O$. Points $E$ and $F$ are chosen on segments $OB$ and $OC$ such that $BE = OF$. If $M$ is the midpoint of the arc $EOA$ and $N$ is the midpoint of the arc $AOF$, prove that $\sphericalangle ENO + \sphericalangle OMF = 2 \sphericalangle BAC$.

Find all functions $f: Z \to Z$ that satisfy $$f(-f (x) - f (y))= 1 -x - y$$ for all $x, y \in Z$

Let $ABC$ be a triangle. Suppose that $D$, $E$, and $F$ are points on segments $\overline{BC}$, $\overline{CA}$, and $\overline{AB}$ respectively such that triangles $AEF$, $BFD$, and $CDE$ have equal inradii. Prove that the sum of the inradii of $\triangle AEF$ and $\triangle DEF$ is equal to the inradius of $\triangle ABC$. [i]Aprameya Tripathy[/i]

Let \(ABCDE\) be a regular pentagon. Let \(P\) be a variable point on the interior of segment \(AB\) such that \(PA\ne PB\). The circumcircles of \(\triangle PAE\) and \(\triangle PBC\) meet again at \(Q\). Let \(R\) be the circumcenter of \(\triangle DPQ\). Show that as \(P\) varies, \(R\) lies on a fixed line. [i]Proposed by Karthik Vedula[/i]

Ana's monthly salary was $ \$2000$ in May. In June she received a $20 \%$ raise. In July she received a $20 \%$ pay cut. After the two changes in June and July, Ana's monthly salary was $\text{(A)}\ 1920\text{ dollars} \qquad \text{(B)}\ 1980\text{ dollars} \qquad \text{(C)}\ 2000\text{ dollars} \qquad \text{(D)}\ 2020\text{ dollars} \qquad \text{(E)}\ 2040\text{ dollars}$

If $x$ is a real number such that $(x - 3)(x - 1)(x + 1)(x + 3) + 16 = 116^2$, what is the largest possible value of $x$?

Eight consecutive positive integers are divided into 2 sets, such that the sum of the squares of the elements in the first set is equal to the sum of the squares of the elements in the second set. Prove that the sum of the lements in the first set is equal to the sum of the elements in the second one.

Find all non negative integers $a{}$ and $b{}$ satisfying $5^a+6=31^b$ [i]Proposed by Erik Füredi, Budapest[/i]

[b]p1.[/b] Let $A(S)$ denote the average value of a set $S$. Let $T$ be the set of all subsets of the set $\{1, 2, 3, 4, ... , 2012\}$, and let $R$ be $\{A(K)|K \in T \}$. Compute $A(R)$. [b]p2.[/b] Consider the minute and hour hands of the Campanile, our clock tower. During one single day ($12:00$ AM - $12:00$ AM), how many times will the minute and hour hands form a right-angle at the center of the clock face? [b]p3.[/b] In a regular deck of $52$ face-down cards, Billy flips $18$ face-up and shuffles them back into the deck. Before giving the deck to Penny, Billy tells her how many cards he has flipped over, and blindfolds her so she can’t see the deck and determine where the face-up cards are. Once Penny is given the deck, it is her job to split the deck into two piles so that both piles contain the same number of face-up cards. Assuming that she knows how to do this, how many cards should be in each pile when he is done? [b]p4.[/b] The roots of the equation $x^3 + ax^2 + bx + c = 0$ are three consecutive integers. Find the maximum value of $\frac{a^2}{b+1}$. [b]p5.[/b] Oski has a bag initially filled with one blue ball and one gold ball. He plays the following game: first, he removes a ball from the bag. If the ball is blue, he will put another blue ball in the bag with probability $\frac{1}{437}$ and a gold ball in the bag the rest of the time. If the ball is gold, he will put another gold ball in the bag with probability $\frac{1}{437}$ and a blue ball in the bag the rest of the time. In both cases, he will put the ball he drew back into the bag. Calculate the expected number of blue balls after $525600$ iterations of this game. [b]p6.[/b] Circles $A$ and $B$ intersect at points $C$ and $D$. Line $AC$ and circle $B$ meet at $E$, line $BD$ and circle $A$ meet at $F$, and lines $EF$ and $AB$ meet at $G$. If $AB = 10$, $EF = 4$, $FG = 8$, find $BG$. PS. You had better use hide for answers.

Let $a,b$ and $c$ be positive real numbers satisfying $\min(a+b,b+c,c+a) > \sqrt{2}$ and $a^2+b^2+c^2=3.$ Prove that \[\frac{a}{(b+c-a)^2} + \frac{b}{(c+a-b)^2} + \frac{c}{(a+b-c)^2} \geq \frac{3}{(abc)^2}.\] [i]Proposed by Titu Andreescu, Saudi Arabia[/i]

Let $\mathbb Z_{\ge 0}$ be the set of non-negative integers, and let $f:\mathbb Z_{\ge 0}\times \mathbb Z_{\ge 0} \to \mathbb Z_{\ge 0}$ be a bijection such that whenever $f(x_1,y_1) > f(x_2, y_2)$, we have $f(x_1+1, y_1) > f(x_2 + 1, y_2)$ and $f(x_1, y_1+1) > f(x_2, y_2+1)$. Let $N$ be the number of pairs of integers $(x,y)$ with $0\le x,y<100$, such that $f(x,y)$ is odd. Find the smallest and largest possible values of $N$.

Let $P$ be the point in the interior of $\vartriangle ABC$. Let $D$ be the intersection of the lines $AP$ and $BC$ and let $A'$ be the point such that $\overrightarrow{AD} = \overrightarrow{DA'}$. The points $B'$ and $C'$ are defined in the similar way. Determine all points $P$ for which the triangles $A'BC, AB'C$, and $ABC'$ are congruent to $\vartriangle ABC$.

In a pond there are $n \geq 3$ stones arranged in a circle. A princess wants to label the stones with the numbers $1, 2, \dots, n$ in some order and then place some toads on the stones. Once all the toads are located, they start jumping clockwise, according to the following rule: when a toad reaches the stone labeled with the number $k$, it waits for $k$ minutes and then jumps to the adjacent stone. What is the greatest number of toads for which the princess can label the stones and place the toads in such a way that at no time are two toads occupying a stone at the same time? [b]Note:[/b] A stone is considered occupied by two toads at the same time only if there are two toads that are on the stone for at least one minute.

The six-pointed star in the figure is regular: all interior angles of the small triangles are equal. Each of the thirteen marked points is assigned a color, green or red. Prove that there are always three points of the same color, which are the vertices of an equilateral triangle.

$PS$ is a line segment of length $4$ and $O$ is the midpoint of $PS$. A semicircular arc is drawn with $PS$ as diameter. Let $X$ be the midpoint of this arc. $Q$ and $R$ are points on the arc $PXS$ such that $QR$ is parallel to $PS$ and the semicircular arc drawn with $QR$ as diameter is tangent to $PS$. What is the area of the region $QXROQ$ bounded by the two semicircular arcs?

Let $ n\ge12$ be an integer, and let $ P_1,P_2,...P_n, Q$ be distinct points in a plane. Prove that for some $ i$, at least $ \frac{n}{6}\minus{}1$ of the distances $ P_1P_i,P_2P_i,...P_{i\minus{}1}P_i,P_{i\plus{}1}P_i,...P_nP_i$ are less than $ P_iQ$.

Functions $f,g:\mathbb{Z}\to\mathbb{Z}$ satisfy $$f(g(x)+y)=g(f(y)+x)$$ for any integers $x,y$. If $f$ is bounded, prove that $g$ is periodic.

For a certain real number $x$, the differences between $x^{1919}$, $x^{1960}$ and $x^{2001}$ are all integers. Prove that $x$ is an integer.

Given points $P(-1,-2)$ and $Q(4,2)$ in the $xy$-plane; point $R(1,m)$ is taken so that $PR+RQ$ is a minimum. Then $m$ equals: $\textbf{(A) }-\tfrac35\qquad \textbf{(B) }-\tfrac25\qquad \textbf{(C) }-\tfrac15\qquad \textbf{(D) }\tfrac15\qquad \textbf{(E) }\text{either }-\tfrac15\text{ or }\tfrac15$

Find all the solutions of the equation \[\left(x+1\right)^y-x^z=1\] For $x,y,z$ integers greater than 1.

Let $\triangle ABC$ which $\angle ABC$ are right angle, Let $D$ be point on $AB$ ( $D \neq A , B$ ), Let $E$ be point on line $AB$ which $B$ is the midpoint of $DE$, Let $I$ be incenter of $\triangle ACE$ and $J$ be $A$-excenter of $\triangle ACD$. Prove that perpendicular bisector of $BC$ bisects $IJ$

Suppose that $ f$ is a real-valued function for which \[ f(xy)+f(y-x)\geq f(y+x)\] for all real numbers $ x$ and $ y$. a) Give a non-constant polynomial that satisfies the condition. b) Prove that $ f(x)\geq 0$ for all real $ x$.

In the blackboard there are drawn $25$ points as shown in the figure. Gastón must choose $4$ points that are vertices of a square. In how many different ways can he make this choice?$$\begin{matrix}\bullet & \bullet & \bullet & \bullet & \bullet \\\bullet & \bullet & \bullet & \bullet & \bullet \\\bullet & \bullet & \bullet & \bullet & \bullet \\\bullet & \bullet & \bullet & \bullet & \bullet \\\bullet & \bullet & \bullet & \bullet & \bullet \end{matrix}$$

Let a ,b and c be positive real numbers such that $a^2+b^2+c^2=3$. Prove that for whatever positive real numbers x y and z, the inequality below holds. $\frac{x}{a}+\frac{y}{b}+\frac{z}{c}\ge \sqrt{xy}+\sqrt{yz}+\sqrt{zx}$ At first I noticed $\sqrt{xy}+\sqrt{yz}+\sqrt{zx}\le \sqrt{x+y+z}\sqrt{x+y+z}=x+y+z$, so perhaps the next move is to prove $\frac{x}{a}+\frac{y}{b}+\frac{z}{c}\ge x+y+z$, but I don't see how to do that, the best thing that I can do with the LHS of this inequality is to prove it by AM-GM in the way that $\frac{x}{a}+\frac{y}{b}+\frac{z}{c}\ge 3\left(\frac{xyz}{abc}\right)^{\frac{1}{3}}\ge 3(xyz)^{\frac{1}{3}}$, but this isn't going to be helpful...

Maisy and Jeff are playing a game with a deck of cards with $4$ $0$’s, $4$ $1$’s, $4$ $2$’s, all the way up to $4$ $9$’s. You cannot tell apart cards of the same number. After shuffling the deck, Maisy and Jeff each take $4$ cards, make the largest $4$-digit integer they can, and then compare. The person with the larger $4$-digit integer wins. Jeff goes first and draws the cards $2,0,2,1$ from the deck. Find the number of hands Maisy can draw to beat that, if the order in which she draws the cards matters. [i]Proposed by Richard Chen[/i]