Let $AB$ be a segment of unit length and let $C, D$ be variable points of this segment. Find the maximum value of the product of the lengths of the six distinct segments with endpoints in the set $\{A,B,C,D\}.$

Let $r,R$ and $r_a$ be the radii of the incircle, circumcircle and A-excircle of the triangle $ABC$ with $AC>AB$, respectively. $I,O$ and $J_A$ are the centers of these circles, respectively. Let incircle touches the $BC$ at $D$, for a point $E \in (BD)$ the condition $A(IEJ_A)=2A(IEO)$ holds. Prove that \[ED=AC-AB \iff R=2r+r_a.\]

Let $ABC$ be a triangle, and let the tangent to the circumcircle of the triangle $ABC$ at $A$ meet the line $BC$ at $D$. The perpendicular to $BC$ at $B$ meets the perpendicular bisector of $AB$ at $E$. The perpendicular to $BC$ at $C$ meets the perpendicular bisector of $AC$ at $F$. Prove that the points $D$, $E$ and $F$ are collinear. [i]Valentin Vornicu[/i]

Duarte wants to draw a square whose side's length is $2009$ cm and which is divided in $2009\times2009$ squares whose side's length is $1$ cm and whose sides are parallel to the original square's one, without taking the pencil out of the paper. Starting on one of the vertex of the giant square, what is the length of the shortest line that allows him to make this drawing?

Find all pairs of nonnegative integers $(a, b)$ such that $a+2b-b^2=\sqrt{2a+a^2+|2a+1-2b|}$.

When the unit squares at the four corners are removed from a three by three squares, the resulting shape is called a cross. What is the maximum number of non-overlapping crosses placed within the boundary of a $ 10\times 11$ chessboard? (Each cross covers exactly five unit squares on the board.)

In a trapezoid, the length of one of the diagonals is equal to the sum of the lengths of the bases, and the angle between the diagonals is $60$ degrees. Prove that this trapezoid is isosceles.

Let $ABC$ be a triangle with side lengths $AB=6, BC=7, CA=8$ and circumcircle $\omega.$ Denote $M$ to be the midpoint of $BC.$ Let $P$ be the intersection of the tangent to $\omega$ at $A$ and $BC.$ The line parallel to $BC$ passing through $A$ intersects $\omega$ at another point $D.$ The tangent to $\omega$ passing through $P$ that is not $PA$ intersects $DM$ at a point $Q.$ Denote $J$ to be the intersection of $(BMQ)$ and $AQ.$ Extend $BJ$ to intersect $AC$ at $E.$ Compute $\tfrac{BJ}{JE}.$ [i]Lightning 4.4[/i]

Find all functions $f:\mathbb{R}\to\mathbb{R}$ which satisfy for all $x$: $(i)$ $f(x)=-f(-x);$ $(ii)$ $f(x+1)=f(x)+1;$ $(iii)$ $f\left( \frac{1}{x}\right)=\frac{1}{x^2}f(x)$ for $x\ne 0$

Let $x$ be a positive integer less than $200$, and let $y$ be obtained by writing the base 10 digits of $x$ in reverse order. Given that $x$ and $y$ satisfy $11x^2+363y=7xy+6571$, find $x$.

We are given an infinite deck of cards, each with a real number on it. For every real number $x$, there is exactly one card in the deck that has $x$ written on it. Now two players draw disjoint sets $A$ and $B$ of $100$ cards each from this deck. We would like to define a rule that declares one of them a winner. This rule should satisfy the following conditions: 1. The winner only depends on the relative order of the $200$ cards: if the cards are laid down in increasing order face down and we are told which card belongs to which player, but not what numbers are written on them, we can still decide the winner. 2. If we write the elements of both sets in increasing order as $A =\{ a_1 , a_2 , \ldots, a_{100} \}$ and $B= \{ b_1 , b_2 , \ldots , b_{100} \}$, and $a_i > b_i$ for all $i$, then $A$ beats $B$. 3. If three players draw three disjoint sets $A, B, C$ from the deck, $A$ beats $B$ and $B$ beats $C$ then $A$ also beats $C$. How many ways are there to define such a rule? Here, we consider two rules as different if there exist two sets $A$ and $B$ such that $A$ beats $B$ according to one rule, but $B$ beats $A$ according to the other. [i]Proposed by Ilya Bogdanov, Russia[/i]

A street on Stanford can be modeled by a number line. Four Stanford students, located at positions $1$, $9$, $25$ and $49$ along the line, want to take an UberXL to Berkeley, but are not sure where to meet the driver. Find the smallest possible total distance walked by the students to a single position on the street. (For example, if they were to meet at position $46$, then the total distance walked by the students would be $45 + 37 + 21 + 3 = 106$, where the distances walked by the students at positions $1$, $9$, $25$ and $49$ are summed in that order.)

A point $P$ moves along a circle $\Omega$. Let $A$ and $B$ be two fixed points of $\Omega$, and $C$ be an arbitrary point inside $\Omega$. The common external tangents to the circumcircles of triangles $APC$ and $BCP$ meet at point $Q$. Prove that all points $Q$ lie on two fixed lines.

Let $ A$ be a set of $ 2n$ points on the plane such that no three points are collinear. Prove that for any distinct two points $ a,b\in A$ there exists a line that partitions $ A$ into two subsets each containing $ n$ points and such that $ a,b$ lie on different sides of the line.

Let $M{}$ be the midpoint of the side $BC$ of the triangle $ABC$. The circle $\omega$ passes through $A{}$, touches the line $BC$ at $M{}$, intersects the side $AB$ at the point $D{}$ and the side $AC$ at the point $E{}$. Let $X{}$ and $Y{}$ be the midpoints of $BE$ and $CD$ respectively. Prove that the circumcircle of the triangle $MXY$ touches $\omega$. [i]Alexey Doledenok[/i]

In a circle of center $O$ and radius $r$, a triangle $ABC$ of orthocenter $H$ is inscribed. It is considered a triangle $A'B'C'$ whose sides have by length the measurements of the segments $AB, CH$ and $2r$. Determine the triangle $ABC$ so that the area of the triangle $A'B'C'$ is maximum.

Let $ a, b, c, d$ be positive integers such that $ ab \equal{} cd$ and $ a\plus{}b \equal{} c \minus{} d.$ Prove that there exists a right-angled triangle the measure of whose sides (in some unit) are integers and whose area measure is $ ab$ square units.

Find all integers \(a,b,c\) such that \(a^{2}=bc+4\) and \(b^{2}=ca+4\).

Once in a restaurant [b][i]Dr. Strange[/i][/b] found out that there were 12 types of food items from 1 to 12 on the menu. He decided to visit the restaurant 12 days in a row and try a different food everyday. 1st day, he tries one of the items from the first two. On the 2nd day, he eats either item 3 or the item he didn’t tried on the 1st day. Similarly, on the 3rd day, he eats either item 4 or the item he didn’t tried on the 2nd day. If someday he's not able to choose items that way, he eats the item that remained uneaten from the menu. In how many ways can he eat the items for 12 days?

At $n$ distinct points of a circular race course there are $n$ cars ready to start. Each car moves at a constant speed and covers the circle in an hour. On hearing the initial signal, each of them selects a direction and starts moving immediately. If two cars meet, both of them change directions and go on without loss of speed. Show that at a certain moment each car will be at its starting point.

$ABCDA_{1}B_{1}C_{1}D_{1}$ is a cube with side length $4a$. Points $E$ and $F$ are taken on $(AA_{1})$ and $(BB_{1})$ such that $AE=B_{1}F=a$. $G$ and $H$ are midpoints of $(A_{1}B_{1})$ and $(C_{1}D_{1})$, respectively. Find the minimum value of the $CP+PQ$, where $P\in[GH]$ and $Q\in[EF]$.

There are $2$ runners on the perimeter of a regular hexagon, initially located at adjacent vertices. Every second, each of the runners independently moves either one vertex to the left, with probability $\frac{1}{2}$, or one vertex to the right, also with probability $\frac{1}{2}$. Find the probability that after a $2013$ second run (in which runners switch vertices $2013$ times each), the runners end up at adjacent vertices once again.

In a parallelogram $ABCD$ , $BD$ is the largest diagonal. By matching $B$ with $D$ by a bend, a regular pentagon is formed. Calculate the measures of the angles formed by the diagonal $BD$ with each of the sides of the parallelogram.

Suppose $x, y, a$ are real numbers such that $x+y = x^3 +y^3 = x^5 +y^5 = a$. Find all possible values of $a.$

Let $ABCD$ be a quadrilateral inscribed in circle $\omega$. Define $E = AA \cap CD$, $F = AA \cap BC$, $G = BE \cap \omega$, $H = BE \cap AD$, $I = DF \cap \omega$, and $J = DF \cap AB$. Prove that $GI$, $HJ$, and the $B$-symmedian are concurrent. [i]Proposed by Robin Park[/i]