On the lines $AB$ are located $2009$ different points that do not belong to the segment $[AB]$. Prove that the sum of the distances from point $A$ to these points is not equal to the sum of the distances from point $B$ to these points.

Circle $\omega$ is tangent to sides $AB, AC$ of triangle $ABC$. A circle $\Omega$ touches the side $AC$ and line $AB$ (produced beyond $B$), and touches $\omega$ at a point $L$ on side $BC$. Line $AL$ meets $\omega, \Omega$ again at $K, M$. It turned out that $KB \parallel CM$. Prove that $\triangle LCM$ is isosceles.

What is the arithmetic mean of all values of the expression $ | a_1-a_2 | + | a_3-a_4 | $ Where $ a_1, a_2, a_3, a_4 $ is a permutation of the elements of the set {$ 1,2,3,4 $}?

Given is a triangle $ABC$ and let $AA_1$, $BB_1$ be angle bisectors. It turned out that $\angle AA_1B=24^{\circ}$ and $\angle BB_1A=18^{\circ}$. Find the ratio $\angle BAC:\angle ACB:\angle ABC$.

Square $A$ is adjacent to square $B$ which is adjacent to square $C$. The three squares all have their bottom sides along a common horizontal line. The upper left vertices of the three squares are collinear. If square $A$ has area $24$, and square $B$ has area $36$, find the area of square $C$. [asy] import graph; size(8cm); real labelscalefactor = 0.5; pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); real xmin = -4.89, xmax = 13.61, ymin = -1.39, ymax = 9; draw((0,0)--(2,0)--(2,2)--(0,2)--cycle, linewidth(1.2)); draw((2,0)--(5,0)--(5,3)--(2,3)--cycle, linewidth(1.2)); draw((5,4.5)--(5,0)--(9.5,0)--(9.5,4.5)--cycle, linewidth(1.2)); draw((2,0)--(2,2), linewidth(1.2)); draw((2,2)--(0,2), linewidth(1.2)); draw((0,2)--(0,0), linewidth(1.2)); draw((2,0)--(5,0), linewidth(1.2)); draw((5,0)--(5,3), linewidth(1.2)); draw((5,3)--(2,3), linewidth(1.2)); draw((2,3)--(2,0), linewidth(1.2)); draw((5,4.5)--(5,0), linewidth(1.2)); draw((5,0)--(9.5,0), linewidth(1.2)); draw((9.5,0)--(9.5,4.5), linewidth(1.2)); draw((9.5,4.5)--(5,4.5), linewidth(1.2)); label("A",(0.6,1.4),SE*labelscalefactor); label("B",(3.1,1.76),SE*labelscalefactor); label("C",(6.9,2.5),SE*labelscalefactor); draw((13.13,8.56)--(-3.98,0), linewidth(1.2)); draw((-3.98,0)--(15.97,0), linewidth(1.2));[/asy]

Let $k\geq 2$ be an integer. We want to determine the weight of $n$ balls. One try consists of choosing two balls, and we are given the sum of the weights of the two chosen balls. We know that at most $k$ of the answers can be wrong. Let $f_k(n)$ denote the smallest number for which it is true that we can always find the weights of the balls with $f_k(n)$ tries (the tries don't have to be decided in advance). Prove that there exist numbers $a_k$ and $b_k$ for which $|f_k(n)-a_kn|\leq b_k$ holds. [i]Proposed by Surányi László, Budapest and Bálint Virág, Toronto[/i]

Compute the number of ordered pairs of non-negative integers $(x, y)$ which satisfy $x^2 + y^2 = 32045.$

Construct triangle $ABC$, given the altitude and the angle bisector both from $A$, if it is known for the sides of the triangle $ABC$ that $2BC = AB + AC$. (Alexey Karlyuchenko)

$n$ positive numbers are given. Is it always possible to find a convex polygon with $n+3$ edges and a triangulation of it so that the length of the diameters used in the triangulation are the given $n$ numbers? [i]Proposed by Morteza Saghafian[/i]

The numbers $1, 3, 7$ and $9$ occur in the decimal representation of an integer. Show that permuting the order of digits one can obtain an integer divisible by $7.$

Define a sequence $<x_n>$ of real numbers by specifying an initial $x_0$ and by the recurrence $x_{n+1}=\frac{1+x_n}{1-x_n}$. Find $x_n$ as a function of $x_0$ and $n$, in closed form. There may be multiple cases.

Each $1 \times 1$ square of an $n \times n$ table contains a different number. The smallest number in each row is marked, and these marked numbers are in different columns. Then the smallest number in each column is marked, and these marked numbers are in different rows. Prove that the two sets of marked numbers are identical. (V Klepcyn)

How many positive integers $n<10^6$ are there such that $n$ is equal to twice of square of an integer and is equal to three times of cube of an integer? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ \text{None of the above} $

Does there exist an integer containing only digits $2$ and $0$ which is a $k$-th power of a positive integer ($k \ge2$)?

If $x$ is a positive rational number show that $x$ can be uniquely expressed in the form $x = \sum^n_{k=1} \frac{a_k}{k!}$ where $a_1, a_2, \ldots$ are integers, $0 \leq a_n \leq n - 1$, for $n > 1,$ and the series terminates. Show that $x$ can be expressed as the sum of reciprocals of different integers, each of which is greater than $10^6.$

William is biking from his home to his school and back, using the same route. When he travels to school, there is an initial $20^\circ$ incline for $0.5$ kilometers, a flat area for $2$ kilometers, and a $20^\circ$ decline for $1$ kilometer. If William travels at $8$ kilometers per hour during uphill $20^\circ$ sections, $16$ kilometers per hours during flat sections, and $20$ kilometers per hour during downhill $20^\circ$ sections, find the closest integer to the number of minutes it take William to get to school and back. [i]Proposed by William Yue[/i]

Octagon $ABCDEFGH$ is equiangular. Given that $AB=1$, $BC=2$, $CD=3$, $DE=4$, and $EF=FG=2$, compute the perimeter of the octagon.

Isabella has a bag with $20$ blue diamonds and $25$ purple diamonds. She repeats the following process $44$ times: she removes a diamond from the bag uniformly at random, then puts one blue diamond and one purple diamond into the bag. Compute the expected number of blue diamonds in the bag after all $44$ repetitions.

A lucky number is a number whose digits are only $4$ or $7.$ What is the $17$th smallest lucky number? [i]Author: Ray Li[/i] [hide="Clarifications"] [list=1][*]Lucky numbers are positive. [*]"only 4 or 7" includes combinations of 4 and 7, as well as only 4 and only 7. That is, 4 and 47 are both lucky numbers.[/list][/hide]

Problems 7, 8 and 9 are about these kites. [asy] for (int a = 0; a < 7; ++a) { for (int b = 0; b < 8; ++b) { dot((a,b)); } } draw((3,0)--(0,5)--(3,7)--(6,5)--cycle);[/asy] Genevieve puts bracing on her large kite in the form of a cross connecting opposite corners of the kite. How many inches of bracing material does she need? $ \text{(A)}\ 30\qquad\text{(B)}\ 32\qquad\text{(C)}\ 35\qquad\text{(D)}\ 38\qquad\text{(E)}\ 39 $

Let $A$ and $B$ be two points on the circle with diameter $[CD]$ and on the different sides of the line $CD.$ A circle $\Gamma$ passing through $C$ and $D$ intersects $[AC]$ different from the endpoints at $E$ and intersects $BC$ at $F.$ The line tangent to $\Gamma$ at $E$ intersects $BC$ at $P$ and $Q$ is a point on the circumcircle of the triangle $CEP$ different from $E$ and satisfying $|QP|=|EP|. \: AB \cap EF =\{R\}$ and $S$ is the midpoint of $[EQ].$ Prove that $DR$ is parallel to $PS.$

Let $a_n$ and $b_n$ to be two sequences defined as below: $i)$ $a_1 = 1$ $ii)$ $a_n + b_n = 6n - 1$ $iii)$ $a_{n+1}$ is the least positive integer different of $a_1, a_2, \ldots, a_n, b_1, b_2, \ldots, b_n$. Determine $a_{2009}$.

A paper square with sidelength $2$ is given. From this square, can we cut out a $12$-gon having all sidelengths equal to $1$ and all angles divisible by $45^\circ$?

Let $N$ be the number of ordered 5-tuples $(a_{1}, a_{2}, a_{3}, a_{4}, a_{5})$ of positive integers satisfying $\frac{1}{a_{1}}+\frac{1}{a_{2}}+\frac{1}{a_{3}}+\frac{1}{a_{4}}+\frac{1}{a_{5}}=1$ Is $N$ even or odd? Oh and [b]HINTS ONLY[/b], please do not give full solutions. Thanks.

Let $$a_n = \frac{1\cdot3\cdot5\cdot\cdots\cdot(2n-1)}{2\cdot4\cdot6\cdot\cdots\cdot2n}.$$ (a) Prove that $\lim_{n\to \infty}a_n$ exists. (b) Show that $$a_n = \frac{\left(1-\frac1{2^2}\right)\left(1-\frac1{4^2}\right)\left(1-\frac1{6^2}\right)\cdots\left(1-\frac{1}{(2n)^2}\right)}{(2n+1)a_n}.$$ (c) Find $\lim_{n\to\infty}a_n$ and justify your answer