In a game of ping-pong, the score is $4-10$. Six points later, the score is $10-10$. You remark that it was impressive that I won the previous $6$ points in a row, but I remark back that you have won $n$ points in a row. What the largest value of $n$ such that this statement is true regardless of the order in which the points were distributed?

Let $ABCDEFGHI$ be a regular polygon of $9$ sides. The segments $AE$ and $DF$ intersect at $P$. Prove that $PG$ and $AF$ are perpendicular.

Let $A,B,C$ be points in that order along a line, such that $AB=20$ and $BC=18$. Let $\omega$ be a circle of nonzero radius centered at $B$, and let $\ell_1$ and $\ell_2$ be tangents to $\omega$ through $A$ and $C$, respectively. Let $K$ be the intersection of $\ell_1$ and $\ell_2$. Let $X$ lie on segment $\overline{KA}$ and $Y$ lie on segment $\overline{KC}$ such that $XY\|BC$ and $XY$ is tangent to $\omega$. What is the largest possible integer length for $XY$?

Let $ S$ be a finite set of points in the plane such that no three of them are on a line. For each convex polygon $ P$ whose vertices are in $ S$, let $ a(P)$ be the number of vertices of $ P$, and let $ b(P)$ be the number of points of $ S$ which are outside $ P$. A line segment, a point, and the empty set are considered as convex polygons of $ 2$, $ 1$, and $ 0$ vertices respectively. Prove that for every real number $ x$ \[\sum_{P}{x^{a(P)}(1 \minus{} x)^{b(P)}} \equal{} 1,\] where the sum is taken over all convex polygons with vertices in $ S$. [i]Alternative formulation[/i]: Let $ M$ be a finite point set in the plane and no three points are collinear. A subset $ A$ of $ M$ will be called round if its elements is the set of vertices of a convex $ A \minus{}$gon $ V(A).$ For each round subset let $ r(A)$ be the number of points from $ M$ which are exterior from the convex $ A \minus{}$gon $ V(A).$ Subsets with $ 0,1$ and 2 elements are always round, its corresponding polygons are the empty set, a point or a segment, respectively (for which all other points that are not vertices of the polygon are exterior). For each round subset $ A$ of $ M$ construct the polynomial \[ P_A(x) \equal{} x^{|A|}(1 \minus{} x)^{r(A)}. \] Show that the sum of polynomials for all round subsets is exactly the polynomial $ P(x) \equal{} 1.$ [i]Proposed by Federico Ardila, Colombia[/i]

Three people, John, Macky, and Rik, play a game of passing a basketball from one to another. Find the number of ways of passing the ball starting with Macky and reaching Macky again at the end of the seventh pass.

Consider the polynomial $p(x)=a_nx^n+\ldots+a_1x+a_0$ with real coefficients such that $0\le a_i\le a_0$ for each $i=1,2,\ldots,n$. If $a$ is the coefficient of $x^{n+1}$ in the polynomial $q(x)=p(x)^2$, prove that $2a\le p(1)^2$.

A billiard table. (see picture) A white ball is on $p_1$ and a red ball is on $p_2$. The white ball is shot towards the red ball as shown on the pic, hitting 3 sides first. Find the minimal distance the ball must travel. [img]http://www.mathlinks.ro/Forum/album_pic.php?pic_id=280[/img]

There are $b$ boys and $g$ girls, with $g \ge 2b-1$, at presence at a party. Each boy invites a girl for the first dance. Prove that this can be done in such a way that either a boy is dancing with a girl he knows or all the girls he knows are not dancing.

Let $\mathcal{F}$ be the set of functions $f: [0,1]\to\mathbb{R}$ that are differentiable, with continuous derivative, and $f(0)=0$, $f(1)=1$. Find the minimum of $\int_{0}^{1}\sqrt{1+x^{2}}\cdot \big(f'(x)\big)^{2}\ dx$ (where $f\in\mathcal{F}$) and find all functions $f\in\mathcal{F}$ for which this minimum is attained. [hide="Comment"] In the contest, this was the b) point of the problem. The a) point was simply ``Prove the Cauchy inequality in integral form''. [/hide]

Let $n\in\mathbb{N}^*$. $2n+3$ points on the plane are given so that no 3 lie on a line and no 4 lie on a circle. Is it possible to find 3 points so that the interior of the circle passing through them would contain exactly $n$ of the remaining points.

Compute \[ \displaystyle\prod_{n=0}^{\infty} \left( 1 - \left( \frac {1}{2} \right)^{3^n} + \left( \frac {1}{4} \right)^{3^n} \right). \]

Consider subsets of the set $1 , 2,..., N$. For each such subset we can compute the product of the reciprocals of each member. Find the sum of all such products.

Prove that for any positive even integer $n$ larger than $38$, $n$ can be written as $a\times b+c\times d$ where $a, b, c, d$ are odd integers larger than $1$.

From the first 64 positive integers are chosen two subsets with 16 numbers in each. The first subset contains only odd numbers while the second one contains only even numbers. Total sums of both subsets are the same. Prove that among all the chosen numbers there are two whose sum equals 65. [i](3 points)[/i]

For which $k$, there is no integer pair $(x,y)$ such that $x^2 - y^2 = k$? $ \textbf{(A)}\ 2005 \qquad\textbf{(B)}\ 2006 \qquad\textbf{(C)}\ 2007 \qquad\textbf{(D)}\ 2008 \qquad\textbf{(E)}\ 2009 $

An ATM password at Fred's Bank is composed of four digits from $0$ to $9$, with repeated digits allowable. If no password may begin with the sequence $9,1,1,$ then how many passwords are possible? $\textbf{(A)}\mbox{ }30\qquad\textbf{(B)}\mbox{ }7290\qquad\textbf{(C)}\mbox{ }9000\qquad\textbf{(D)}\mbox{ }9990\qquad\textbf{(E)}\mbox{ }9999$

Let $ABC$ be an acute triangle. Let $DAC,EAB$, and $FBC$ be isosceles triangles exterior to $ABC$, with $DA=DC, EA=EB$, and $FB=FC$, such that \[ \angle ADC = 2\angle BAC, \quad \angle BEA= 2 \angle ABC, \quad \angle CFB = 2 \angle ACB. \] Let $D'$ be the intersection of lines $DB$ and $EF$, let $E'$ be the intersection of $EC$ and $DF$, and let $F'$ be the intersection of $FA$ and $DE$. Find, with proof, the value of the sum \[ \frac{DB}{DD'}+\frac{EC}{EE'}+\frac{FA}{FF'}. \]

A positive integer is called [i]superprime[/i] if the difference between any two of its consecutive positive divisors is a prime number. Determine all superprime integers. [i]Authored by Nikola Velov[/i]

Let $(a_{n})_{n\geq 1}$ and $(b_{n})_{n\geq 1}$ be the sequence of positive integers defined by $a_{n+1}=na_{n}+1$ and $b_{n+1}=nb_{n}-1$ for $n\geq 1$. Show that the two sequence cannot have infinitely many common terms. [i]Laurentiu Panaitopol[/i]

The figure shows a triangle, a circle circumscribed around it and the center of its inscribed circle. Using only one ruler (one-sided, without divisions), construct the center of the circumscribed circle.

A polynomial $P(x)$ with integer coefficients takes odd values at $x = 0$ and $x = 1$. Prove that $P(x)$ has no integer roots.

The four vertices of a square are the centers of four circles such that the sum of theirs areas equals the square's area. Take an arbitrary point in the interior of each circle. Prove that the four arbitrary points are the vertices of a convex quadrilateral. [i]Laurentiu Panaitopol[/i]

Prove that for any integer $n \ge 2$, there exists a unique finite sequence $x_0, x_1,..., x_n$ of real numbers which satisfies $x_0 = x_n = 0$ and $x_{i+1} - 8x_i^3 -4x_i + 3x_{i-1} + 1 = 0$ for all $i = 1,2,...,n - 1$. Prove moreover that $ |x_i| \le \frac12$ for all $i = 1,2,...,n - 1$. Nguyễn Duy Thái Sơn

A bottle contains $5$ gallons of a $10\%$ solution of oil. How many gallons of pure oil must be added to make a $30\%$ oil solution? (round to the nearest hundredth)

Let $P$ be a cubic polynomial given by $P(x)=ax^3+bx^2+cx+d$, where $a,b,c,d$ are integers and $a\ne0$. Suppose that $xP(x)=yP(y)$ for infinitely many pairs $x,y$ of integers with $x\ne y$. Prove that the equation $P(x)=0$ has an integer root.