Let $P_0=(a_0,b_0),P_1=(a_1,b_1),P_2=(a_2,b_2)$ be points on the plane such that $P_0P_1P_2\Delta$ contains the origin $O$. Show that the areas of triangles $P_0OP_1,P_0OP_2,P_1OP_2$ form a geometric sequence in that order if and only if there exists a real number $x$, such that $$ a_0x^2+a_1x+a_2=b_0x^2+b_1x+b_2=0 $$

Let $n>1$ be an integer. Given a simple graph $G$ on $n$ vertices $v_1, v_2, \dots, v_n$ we let $k(G)$ be the minimal value of $k$ for which there exist $n$ $k$-dimensional rectangular boxes $R_1, R_2, \dots, R_n$ in a $k$-dimensional coordinate system with edges parallel to the axes, so that for each $1\leq i<j\leq n$, $R_i$ and $R_j$ intersect if and only if there is an edge between $v_i$ and $v_j$ in $G$. Define $M$ to be the maximal value of $k(G)$ over all graphs on $n$ vertices. Calculate $M$ as a function of $n$.

Fix positive integers $n$ and $k\ge 2$. A list of $n$ integers is written in a row on a blackboard. You can choose a contiguous block of integers, and I will either add $1$ to all of them or subtract $1$ from all of them. You can repeat this step as often as you like, possibly adapting your selections based on what I do. Prove that after a finite number of steps, you can reach a state where at least $n-k+2$ of the numbers on the blackboard are all simultaneously divisible by $k$.

Find $f_n(x)$ such that $f_1(x)=x,\ f_n(x)=\int_0^x tf_{n-1}(x-t)dt\ (n=2,\ 3,\ \cdots).$

A singles tournament had six players. Each player played every other player only once, with no ties. If Helen won 4 games, Ines won 3 games, Janet won 2 games, Kendra won 2 games and Lara won 2 games, how many games did Monica win? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 4$

The lateral surface of a cylinder of revolution is divided by $n-1$ planes parallel to the base and $m$ parallel generators into $mn$ cases $( n\ge 1,m\ge 3)$. Two cases will be called neighbouring cases if they have a common side. Prove that it is possible to write a real number in each case such that each number is equal to the sum of the numbers of the neighbouring cases and not all the numbers are zero if and only if there exist integers $k,l$ such that $n+1$ does not divide $k$ and \[ \cos \frac{2l\pi}{m}+\cos\frac{k\pi}{n+1}=\frac{1}{2}\] [i]Ciprian Manolescu[/i]

Let $\Gamma$ and $\Gamma'$ be two concentric circles. Let $ABC$ and $A'B'C'$ be any two equilateral triangles inscribed in $\Gamma$ and $\Gamma'$ respectively. If $P$ and $P'$ are any two points on $\Gamma$ and $\Gamma'$ respectively, show that \[ P'A^2 + P'B^2 + P'C^2 = A'P^2 + B'P^2 + C'P^2. \]

Let $f:[0,1] \to [0,1]$ a increasing continuous function, diferentiable in $(0,1)$ and with derivative smaller than 1 in every point. The sequence of sets $A_1,A_2,A_3,\dots$ is define as: $A_1 = f([0,1])$, and for $n \geq 2, A_n = f(A_{n-1}).$ Prove that $\displaystyle \lim_{n\to+\infty} d(A_n) = 0$, where $d(A)$ is the diameter of the set $A$. Note: The diameter of a set $X$ is define as $d(X) = \sup_{x,y\in X} |x-y|.$

Three circumferences are tangent to each other, as shown in the figure. The region of the outer circle that is not covered by the two inner circles has an area equal to $2 \pi$. Determine the length of the $PQ$ segment . [img]https://cdn.artofproblemsolving.com/attachments/a/e/65c08c47d4d20a05222a9b6cf65e84a25283b7.png[/img]

Asli will distribute $100$ candies among her brother and $18$ friends of him. Asli splits friends of her brother into several groups and distributes all the candies into these groups. In each group, the candies are shared in a fair way such that each child in a group takes same number of candies and this number is the largest possible. Then, Asli's brother takes the remaining candies of each group. At most how many candies can Asli's brother have? $ \textbf{(A)}\ 12 \qquad\textbf{(B)}\ 14 \qquad\textbf{(C)}\ 16 \qquad\textbf{(D)}\ 17 \qquad\textbf{(E)}\ 18 $

The distance from $A$ to $B$ is $d$ kilometres. A plane flying with the constant speed in the constant direction along and over the line $(AB)$ is being watched from those points. Observers have reported that the angle to the plane from the point $A$ has changed by $\alpha$ degrees and from $B$ --- by $\beta$ degrees within one second. What can be the minimal speed of the plane?

Given 365 cards, in which distinct numbers are written. We may ask for any three cards, the order of numbers written in them. Is it always possible to find out the order of all 365 cards by 2000 such questions?

The $n$ contestant of EGMO are named $C_1, C_2, \cdots C_n$. After the competition, they queue in front of the restaurant according to the following rules. [list] [*]The Jury chooses the initial order of the contestants in the queue. [*]Every minute, the Jury chooses an integer $i$ with $1 \leq i \leq n$. [list] [*]If contestant $C_i$ has at least $i$ other contestants in front of her, she pays one euro to the Jury and moves forward in the queue by exactly $i$ positions. [*]If contestant $C_i$ has fewer than $i$ other contestants in front of her, the restaurant opens and process ends. [/list] [/list] [list=a] [*]Prove that the process cannot continue indefinitely, regardless of the Jury’s choices. [*]Determine for every $n$ the maximum number of euros that the Jury can collect by cunningly choosing the initial order and the sequence of moves. [/list]

Let $ABC$ be an acute triangle with $AB<AC$, and let $D$ and $E$ be points on side $BC$ such that $BD=CE$ and $D$ lies between $B$ and $E$. Suppose there exists a point $P$ inside $ABC$ such that $PD\parallel AE$ and $\angle PAB=\angle EAC$. Prove that $\angle PBA=\angle PCA$. [i]Calvin Deng.[/i]

Suppose that $f:\mathbb{R} \rightarrow \mathbb{R}$ is continuous and $L=\int_{-\infty}^{\infty} f(x) dx$ exists. Show that $$\int_{-\infty}^{\infty}f\left(x-\frac{1}{x}\right)dx=L.$$

The 20 pupils in a class each send 10 cards to 10 (different) class members. [size=92][i][note: you cannot send a card to yourself.][/i][/size] (a) Show at least 2 pupils sent each other a card. (b) Now suppose we had $n$ pupils sending $m$ cards each. For which $(m,n)$ is the above true? (That is, find minimal $m(n)$ or maximal $n(m)$)

Let $ABCD$ be an inscribed quadrilateral in a circumference with center $O$ such that it lies inside $ABCD$ and $\angle{BAC} = \angle{ODA}$. Let $E$ be the intersection of $AC$ with $BD$. Lines $r$ and $s$ are drawn through $E$ such that $r$ is perpendicular to $BC$, and $s$ is perpendicular to $AD$. Let $P$ be the intersection of $r$ with $AD$, and $M$ the intersection of $s$ with $BC$. Let $N$ be the midpoint of $EO$. Prove that $M$, $N$, and $P$ lie on a line.

A conference is attended by $n (n\ge 3)$ scientists. Each scientist has some friends in this conference (friendship is mutual and no one is a friend of him/herself). Suppose that no matter how we partition the scientists into two nonempty groups, there always exist two scientists in the same group who are friends, and there always exist two scientists in different groups who are friends. A proposal is introduced on the first day of the conference. Each of the scientists' opinion on the proposal can be expressed as a non-negative integer. Everyday from the second day onwards, each scientists' opinion is changed to the integer part of the average of his/her friends' opinions from the previous day. Prove that after a period of time, all scientists have the same opinion on the proposal.

Find all functions $f: \mathbb{R}\to [0;+\infty)$ such that: \[f(x^2+y^2)=f(x^2-y^2)+f(2xy)\] for all real numbers $x$ and $y$. [i]Laurentiu Panaitopol[/i]

Elmo calls a monic polynomial with real coefficients [i]tasty[/i] if all of its coefficients are in the range $[-1,1]$. A monic polynomial $P$ with real coefficients and complex roots $\chi_1,\cdots,\chi_m$ (counted with multiplicity) is given to Elmo, and he discovers that there does not exist a monic polynomial $Q$ with real coefficients such that $PQ$ is tasty. Find all possible values of $\max\left(|\chi_1|,\cdots,|\chi_m|\right)$. [i]Proposed by Carl Schildkraut[/i]

Let the medians of the triangle $ABC$ intersect at point $M$. A line $t$ through $M$ intersects the circumcircle of $ABC$ at $X$ and $Y$ so that $A$ and $C$ lie on the same side of $t$. Prove that $BX\cdot BY=AX\cdot AY+CX\cdot CY$.

In the coordinate space, define a square $S$, defined by the inequality $|x|\leq 1,\ |y|\leq 1$ on the $xy$-plane, with four vertices $A(-1,\ 1,\ 0),\ B(1,\ 1,\ 0),\ C(1,-1,\ 0), D(-1,-1,\ 0)$. Let $V_1$ be the solid by a rotation of the square $S$ about the line $BD$ as the axis of rotation, and let $V_2$ be the solid by a rotation of the square $S$ about the line $AC$ as the axis of rotation. (1) For a real number $t$ such that $0\leq t<1$, find the area of cross section of $V_1$ cut by the plane $x=t$. (2) Find the volume of the common part of $V_1$ and $V_2$.

In isosceles trapezoid $ABCD$ ($AB \parallel CD$) points $E$ and $F$ lie on the segment $CD$ in such a way that $D, E, F$ and $C$ are in that order and $DE = CF$. Let $X$ and $Y$ be the reflection of $E$ and $C$ with respect to $AD$ and $AF$. Prove that circumcircles of triangles $ADF$ and $BXY$ are concentric. [i]Proposed by Iman Maghsoudi - Iran[/i]

Incircle $\omega$ of $ABC$ touch $AC$ at $B_1$. Point $E,F$ on the $\omega$ such that $\angle AEB_1=\angle B_1FC=90$. Tangents to $\omega$ at $E,F$ intersects in $D$, and $B$ and $D$ are on different sides for line $AC$. $M$- midpoint of $AC$. Prove, that $AE,CF,DM$ intersects at one point.

Given a circle $C$ and an exterior point $A$. For every point $P$ on the circle construct the square $APQR$ (in counterclock order). Determine the locus of the point $Q$ when $P$ moves on the circle $C$.