Determine the radius of the largest circle which can lie on the ellipsoid $$\frac{x^2 }{a^2 } +\frac{ y^2 }{b^2 } +\frac{z^2 }{c^2 }=1 \;\;\;\; (a>b>c).$$

Let $n \ge 2$ be an integer, and let $A_n$ be the set \[A_n = \{2^n - 2^k\mid k \in \mathbb{Z},\, 0 \le k < n\}.\] Determine the largest positive integer that cannot be written as the sum of one or more (not necessarily distinct) elements of $A_n$ . [i]Proposed by Serbia[/i]

An integer point of the usual Euclidean $3$-dimensional space is a point whose three coordinates are all integers. A set $S$ of integer points is called a [i]covered [/i] set if for all points $A, B$ in $S$ each integer point in the segment $[AB]$ is also in $S$. Determine the maximum number of elements that a covered set can have if it does not contain $2004$ collinear points.

Let the point $ B $ lie on the circle $ S_1 $ and let the point $ A $, other than the point $ B $, lie on the tangent to the circle $ S_1 $ passing through the point $ B $. Let a point $ C $ be chosen outside the circle $ S_1 $, so that the segment $ AC $ intersects $ S_1 $ at two different points. Let the circle $ S_2 $ touch the line $ AC $ at the point $ C $ and the circle $ S_1 $ at the point $ D $, on the opposite side from the point $ B $ with respect to the line $ AC $. Prove that the center of the circumcircle of triangle $ BCD $ lies on the circumcircle of triangle $ ABC $.

Two parallel chords $AB$ and $CD$ are drawn in a circle with center $O$. Circles with diameters $AB$ and $CD$ intersect at point $P$. Prove that the midpoint of the segment $OP$ is equidistant from lines $AB$ and $CD$.

An arbitrary triangle $ABC$ is given. Construct a line that divides it into two polygons, which have equal radii of the circumscribed circles. (L. Blinkov)

Triangle $ABC$ is such that $AB < AC$. The perpendicular bisector of side $BC$ intersects lines $AB$ and $AC$ at points $P$ and $Q$, respectively. Let $H$ be the orthocentre of triangle $ABC$, and let $M$ and $N$ be the midpoints of segments $BC$ and $PQ$, respectively. Prove that lines $HM$ and $AN$ meet on the circumcircle of $ABC$.

Let $n$ be a positive integer. For each of the numbers $1, 2,.., n$ we compute the difference between the number of its odd positive divisors and its even positive divisors. Prove that the sum of these differences is at least $0$ and at most $n$.

Let $\triangle ABC$ have $AB=3$, $AC=5$, and $\angle A=90^\circ$. Point $D$ is the foot of the altitude from $A$ to $\overline{BC}$, and $X$ and $Y$ are the feet of the altitudes from $D$ to $\overline{AB}$ and $\overline{AC}$ respectively. If $XY^2$ can be written in the form $\tfrac mn$ where $m$ and $n$ are positive relatively prime integers, what is $100m+n$? [i] Proposed by David Altizio [/i]

Tej writes $2, 3, ..., 101$ on a chalkboard. Every minute he erases two numbers from the board, $x$ and $y$, and writes $xy/(x+y-1)$. If Tej does this for $99$ minutes until only one number remains, what is its maximum possible value?

Several pairs of positive integers $(m ,n )$ satisfy the condition $19m + 90 + 8n = 1998$. Of these, $(100, 1 )$ is the pair with the smallest value for $n$. Find the pair with the smallest value for $m$.

Let $n\geq 3$ be an integer. We say that a vertex $A_i (1\leq i\leq n)$ of a convex polygon $A_1A_2 \dots A_n$ is [i]Bohemian[/i] if its reflection with respect to the midpoint of $A_{i-1}A_{i+1}$ (with $A_0=A_n$ and $A_1=A_{n+1}$) lies inside or on the boundary of the polygon $A_1A_2\dots A_n$. Determine the smallest possible number of Bohemian vertices a convex $n$-gon can have (depending on $n$). [i]Proposed by Dominik Burek, Poland [/i]

Let $A$ be a subset of $\{2,3, \ldots, 28 \}$ such that if $a \in A$, then the residue obtained when we divide $a^2$ by $29$ also belongs to $A$. Find the minimum possible value of $|A|$.

Let $n$ be a positive integer. Prove that $x^n -\frac{1}{x^{n}}$ is expressible as a polynomial in $x-\frac{1}{x}$ with real coefficients if and only if $n$ is odd.

Determine all positive integers$ n$ that can be written as the product of two consecutive integers and as well as the product of four consecutive integers numbers. In the formula: $n = a (a + 1) = b (b + 1) (b + 2) (b + 3)$.

Let $ABCD$ be a fixed square and $K$ a variable point on segment $AD$. The square $KLMN$ is constructed such that $B$ is on segment $LM$ and $C$ is on segment $MN$. Let $T$ be the intersection point of lines $LA$ and $ND$. Find the locus of $T$ as $K$ varies along segment $AD$.

Let $<a_n>$ be a sequence of non-negative real numbers such that $a_{m+n} \le a_m +a_n$ for all $m,n \in \mathbb{N}$. Prove that \[\sum_{k=1}^{N} \frac{a_k}{k^2}\ge \frac{a_N}{4N}\ln N\] for any $N \in \mathbb{N}$, where $\ln$ denotes the natural logarithm.

For each positive integer $n$, let \[a_n = \frac {(n + 9)!}{(n - 1)!}.\] Let $k$ denote the smallest positive integer for which the rightmost nonzero digit of $a_k$ is odd. The rightmost nonzero digit of $a_k$ is $ \textbf{(A)}\ 1\qquad \textbf{(B)}\ 3\qquad \textbf{(C)}\ 5\qquad \textbf{(D)}\ 7\qquad \textbf{(E)}\ 9$

Let $ABCD$ be a parallelogram that is not rhombus. We draw the symmetrical half-line of $(DC$ with respect to line $BD$. Similarly we draw the symmetrical half- line of $(AB$ with respect to $AC$. These half- lines intersect each other in $P$. If $\frac{AP}{DP}= q$ find the value of $\frac{AC}{BD}$ in function of $q$.

95 numbers $a_1,a_2,\cdots,a_{95}$ are either $1$ or $-1$. Then the minumum positive value of $\sum_{1\leq i<j\leq95}a_i a_j$ is________.

During the van ride from the Grand Canyon to the beach, Michael asks his dad about the costs of renewable energy resources. "How much more does it really cost for a family like ours to switch entirely to renewable energy?" Jerry explains, "Part of that depends on where the family lives. In the Western states, solar energy pays off more than it does where we live in the Southeast. But as technology gets better, costs of producing more photovoltaic power go down, so in just a few years more people will have reasonably inexpensive options for switching to clearner power sources. Even now most families could switch to biomass for between $\$200$ and $\$1000$ per year. The energy comes from sawdust, switchgrass, and even landfill gas. We pay that premium ourselves, but some families operate on a tighter budget, or don't understand the alternatives yet." "Ew, landfill gas!" Alexis complains mockingly. Wanting to save her own energy, Alexis decides to take a nap. She falls asleep and dreams of walking around a $2-\text{D}$ coordinate grid, looking for a wormhole that she believes will transport her to the beach (bypassing the time spent in the family van). In her dream, Alexis finds herself holding a device that she recognizes as a $\textit{tricorder}$ from one of the old $\textit{Star Trek}$ t.v. series. The tricorder has a button labeled "wormhole" and when Alexis presses the button, a computerized voice from the tricorder announces, "You are at the origin. Distance to the wormhole is $2400$ units. Your wormhole distance allotment is $\textit{two}$."' Unsure as to how to reach, Alexis begins walking forward. As she walks, the tricorder displays at all times her distance from her starting point at the origin. When Alexis is $2400$ units from the origin, she again presses the "wormhole" buttom. The same computerized voice as before begins, "Distance to the origin is $2400$ units. Distance to the wormhole is $3840$ units. Your wormhole distance allotment is $\textit{two}$." Alexis begins to feel disoriented. She wonders what is means that her $\textit{wormhole distance allotment is two}$, and why that number didn't change as she pushed the button. She puts her hat down to mark her position, then wanders aroud a bit. The tricorder shows her two readings as she walks. The first she recognizes as her distance to the origin. The second reading clearly indicates her distance from the point where her hat lies - where she last pressed the button that gave her distance to the wormhole. Alexis picks up her hat and begins walking around. Eventually Alexis finds herself at a spot $2400$ units from the origin and $3840$ units from where she last pressed the button. Feeling hopeful, Alexis presses the tricorder's wormhole button again. Nothing happens. She presses it again, and again nothing happens. "Oh," she thinks, "my wormhole allotment was $\textit{two}$, and I used it up already!" Despair fills poor Alexis who isn't sure what a wormhole looks like or how she's supposed to find it. Then she takes matters into her own hands. Alexis sits down and scribbles some notes and realizes where the wormhole must be. Alexis gets up and runs straight from her "third position" to the wormhole. As she gets closer, she sees the wormhole, which looks oddly like a huge scoop of icecream. Alexis runs into the wormhole, then wakes up. How many units did Alexis run from her third position to the wormhole?

Find the biggest $ n < 2007 $ such that there exists a partition of the integers from $1$ to $n$ into two sets the sums of the squares of whose elements are equal.

Let $ABC$ be a triangle with $\angle{C} = 90^{\circ}$, and let $H$ be the foot of the altitude from $C$. A point $D$ is chosen inside the triangle $CBH$ so that $CH$ bisects $AD$. Let $P$ be the intersection point of the lines $BD$ and $CH$. Let $\omega$ be the semicircle with diameter $BD$ that meets the segment $CB$ at an interior point. A line through $P$ is tangent to $\omega$ at $Q$. Prove that the lines $CQ$ and $AD$ meet on $\omega$.

Let non-integer real numbers $a, b,c,d$ are given, such that the sum of each $3$ of them is integer. May it happen that $ab + cd$ is an integer.

For a positive constant number $ t$, let denote $ D$ the region surrounded by the curve $ y \equal{} e^{x}$, the line $ x \equal{} t$, the $ x$ axis and the $ y$ axis. Let $ V_x,\ V_y$ be the volumes of the solid obtained by rotating $ D$ about the $ x$ axis and the $ y$ axis respectively. Compare the size of $ V_x,\ V_y.$