Show that among any seven coplanar unit vectors there are at least two of them such that the magnitude of their sum is greater than $ \sqrt 3. $ [i]Ion Tecu[/i] and [i]Teodor Radu[/i]

Given real numbers $x_1,x_2,y_1,y_2,z_1,z_2$ satisfying $x_1>0,x_2>0,x_1y_1>z_1^2$, and $x_2y_2>z_2^2$, prove that: \[ {8\over(x_1+x_2)(y_1+y_2)-(z_1+z_2)^2}\le{1\over x_1y_1-z_1^2}+{1\over x_2y_2-z_2^2}. \] Give necessary and sufficient conditions for equality.

A triangle has sides with lengths $a,b,c$ such that \[ a^2 + b^2 = 5c^2 \] Prove that medians to the sides of lengths $a$ and $b$ are perpendicular.

Which of the following sets could NOT be the lengths of the external diagonals of a right rectangular prism [a "box"]? (An [i]external diagonal[/i] is a diagonal of one of the rectangular faces of the box.) $ \textbf{(A)}\ \{4, 5, 6\} \qquad\textbf{(B)}\ \{4, 5, 7\} \qquad\textbf{(C)}\ \{4, 6, 7\} \qquad\textbf{(D)}\ \{5, 6, 7\} \qquad\textbf{(E)}\ \{5, 7, 8\} $

Let $n$ be a positive integer. A regular hexagon with side length $n$ is divided into equilateral triangles with side length $1$ by lines parallel to its sides. Find the number of regular hexagons all of whose vertices are among the vertices of those equilateral triangles. [i]UK - Sahl Khan[/i]

Arrange the following four numbers from smallest to largest $ a \equal{} (10^{100})^{10}$, $ b \equal{} 10^{(10^{10})}$, $ c \equal{} 1000000!$, $ d \equal{} (100!)^{10}$

Given is a convex quadrilateral $ ABCD$ with $ \angle ADC\equal{}\angle BCD>90^{\circ}$. Let $ E$ be the point of intersection of the line $ AC$ with the parallel line to $ AD$ through $ B$ and $ F$ be the point of intersection of the line $ BD$ with the parallel line to $ BC$ through $ A$. Show that $ EF$ is parallel to $ CD$

A pile of $n$ pebbles is placed in a vertical column. This configuration is modified according to the following rules. A pebble can be moved if it is at the top of a column which contains at least two more pebbles than the column immediately to its right. (If there are no pebbles to the right, think of this as a column with 0 pebbles.) At each stage, choose a pebble from among those that can be moved (if there are any) and place it at the top of the column to its right. If no pebbles can be moved, the configuration is called a [i]final configuration[/i]. For each $n$, show that, no matter what choices are made at each stage, the final configuration obtained is unique. Describe that configuration in terms of $n$. [url=http://www.mathlinks.ro/Forum/viewtopic.php?p=119189]IMO ShortList 2001, combinatorics problem 7, alternative[/url]

Let $p$ be a prime number. Find all positive integers $a,b,c\ge 1$ such that: \[a^p+b^p=p^c.\]

Prove that the number $2^9 +2^{99}$ is divisible by $100$.

1.Let $ x \equal{} \alpha ,\ \beta \ (\alpha < \beta )$ are $ x$ coordinates of the intersection points of a parabola $ y \equal{} ax^2 \plus{} bx \plus{} c\ (a\neq 0)$ and the line $ y \equal{} ux \plus{} v$. Prove that the area of the region bounded by these graphs is $ \boxed{\frac {|a|}{6}(\beta \minus{} \alpha )^3}$. 2. Let $ x \equal{} \alpha ,\ \beta \ (\alpha < \beta )$ are $ x$ coordinates of the intersection points of parabolas $ y \equal{} ax^2 \plus{} bx \plus{} c$ and $ y \equal{} px^2 \plus{} qx \plus{} r\ (ap\neq 0)$. Prove that the area of the region bounded by these graphs is $ \boxed{\frac {|a \minus{} p|}{6}(\beta \minus{} \alpha )^3}$.

There is a safe that can be opened by entering a secret code consisting of $n$ digits, each of them is $0$ or $1$. Initially, $n$ zeros were entered, and the safe is closed (so, all zeros is not the secret code). In one attempt, you can enter an arbitrary sequence of $n$ digits, each of them is $0$ or $1$. If the entered sequence matches the secret code, the safe will open. If the entered sequence matches the secret code in more positions than the previously entered sequence, you will hear a click. In any other cases the safe will remain locked and there will be no click. Find the smallest number of attempts that is sufficient to open the safe in all cases.

(F.Nilov, A.Zaslavsky) Let $ CC_0$ be a median of triangle $ ABC$; the perpendicular bisectors to $ AC$ and $ BC$ intersect $ CC_0$ in points $ A'$, $ B'$; $ C_1$ is the meet of lines $ AA'$ and $ BB'$. Prove that $ \angle C_1CA \equal{} \angle C_0CB$.

A circle is circumscribed around an isosceles triangle whose two base angles are equal to $x^{\circ}$. Two points are chosen independently and randomly on the circle, and a chord is drawn between them. The probability that the chord intersects the triangle is $\frac{14}{25}.$ Find the sum of the largest and smallest possible value of $x$.

How many ten digit positive integers with distinct digits are multiples of $11111$? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1264 \qquad\textbf{(C)}\ 2842 \qquad\textbf{(D)}\ 3456 \qquad\textbf{(E)}\ 11111 $

The summation $\sum_{k=1}^{360} \frac{1}{k \sqrt{k+1} + (k+1)\sqrt{k}}$ is the ratio of two relatively prime positive integers $m$ and $n$. Find $m + n$.

Consider the triangle $ABC$ with $\angle A= 90^{\circ}$ and $\angle B \not= \angle C$. A circle $\mathcal{C}(O,R)$ passes through $B$ and $C$ and intersects the sides $AB$ and $AC$ at $D$ and $E$, respectively. Let $S$ be the foot of the perpendicular from $A$ to $BC$ and let $K$ be the intersection point of $AS$ with the segment $DE$. If $M$ is the midpoint of $BC$, prove that $AKOM$ is a parallelogram.

Let $n$ be a natural number. A tiling of a $2n \times 2n$ board is a placing of $2n^2$ dominos (of size $2 \times 1$ or $1 \times 2$) such that each of them covers exactly two squares of the board and they cover all the board.Consider now two [i]sepearate tilings[/i] of a $2n \times 2n$ board: one with red dominos and the other with blue dominos. We say two squares are red neighbours if they are covered by the same red domino in the red tiling; similarly define blue neighbours. Suppose we can assign a non-zero integer to each of the squares such that the number on any square equals the difference between the numbers on it's red and blue neighbours i.e the number on it's red neigbhbour minus the number on its blue neighbour. Show that $n$ is divisible by $3$ [i] Proposed by Tejaswi Navilarekallu [/i]

In a country there are $n>100$ cities and initially no roads. The government randomly determined the cost of building a two-way road between any two cities, using all amounts from $1$ to $\frac{n(n-1)}{2}$ thalers once (all options are equally likely). The mayor of each city chooses the cheapest of the $n-1$ roads emanating from that city and it is built (this may be the mutual desired of the mayors of both cities being connected, or only one of the two). After the construction of these roads, the cities are divided into $M$ connected components (between cities of the same connected component, you can get along the constructed roads, possibly via other cities, but this is not possible for cities of different components). Find the expected value of the random variable $M$. [i]Proposed by F. Petrov[/i]

Let $ABC$ be a triangle with $AB < AC$ and let $D{}$ be the other intersection point of the angle bisector of $\angle A$ with the circumcircle of the triangle $ABC$. Let $E{}$ and $F{}$ be points on the sides $AB$ and $AC$ respectively, such that $AE = AF$ and let $P{}$ be the point of intersection of $AD$ and $EF$. Let $M{}$ be the midpoint of $BC{}$. Prove that $AM$ and the circumcircles of the triangles $AEF$ and $PMD$ pass through a common point.

[asy] draw((0,0)--(0,1)--(2,1)--(2,0)--cycle^^(.5,1)--(.5,2)--(1.5,2)--(1.5,1)--(.5,2)^^(.5,1)--(1.5,2)^^(1,2)--(1,0)); //Credit to Zimbalono for the diagram[/asy] The radius of the smallest circle containing the symmetric figure composed of the $3$ unit squares shown above is $\textbf{(A) }\sqrt{2}\qquad\textbf{(B) }\sqrt{1.25}\qquad\textbf{(C) }1.25\qquad\textbf{(D) }\frac{5\sqrt{17}}{16}\qquad \textbf{(E) }\text{None of these}$

Suppose $p,q,r$ are three distinct primes such that $rp^3+p^2+p=2rq^2+q^2+q$. Find all possible values of $pqr$.

There is a rectangular plot of size $1 \times n$. This has to be covered by three types of tiles - red, blue and black. The red tiles are of size $1 \times 1$, the blue tiles are of size $1 \times 1$ and the black tiles are of size $1 \times 2$. Let $t_n$ denote the number of ways this can be done. For example, clearly $t_1 = 2$ because we can have either a red or a blue tile. Also $t_2 = 5$ since we could have tiled the plot as: two red tiles, two blue tiles, a red tile on the left and a blue tile on the right, a blue tile on the left and a red tile on the right, or a single black tile. [list=a] [*]Prove that $t_{2n+1} = t_n(t_{n-1} + t_{n+1})$ for all $n > 1$. [*]Prove that $t_n = \sum_{d \ge 0} \binom{n-d}{d}2^{n-2d}$ for all $n >0$. [/list] Here, \[ \binom{m}{r} = \begin{cases} \dfrac{m!}{r!(m-r)!}, &\text{ if $0 \le r \le m$,} \\ 0, &\text{ otherwise} \end{cases}\] for integers $m,r$.

If $(1+x+x^2)^{1000}=a_0+a_1x+a_2x^2+\cdots+a_{2000}x^{2000}$ ($a_0,a_1,\cdots,a_{2000}$ are coefficients), then the value of $a_0+a_3+a_6+\cdots+a_{1998}$ is $\text{(A)}3^{333}\qquad\text{(B)}3^{666}\qquad\text{(C)}3^{999}\qquad\text{(D)}3^{2001}$

Let $k \geq 1$ and $N>1$ be two integers. On a circle are placed $2N+1$ coins all showing heads. Calvin and Hobbes play the following game. Calvin starts and on his move can turn any coin from heads to tails. Hobbes on his move can turn at most one coin that is next to the coin that Calvin turned just now from tails to heads. Calvin wins if at any moment there are $k$ coins showing tails after Hobbes has made his move. Determine all values of $k$ for which Calvin wins the game. [i]Proposed by Tejaswi Navilarekallu[/i]