Determine all triples $\left( x,y,z\right)$ of positive integers for which the number \[ \sqrt{\frac{2005}{x+y}}+\sqrt{\frac{2005}{y+z}}+\sqrt{\frac{2005}{z+x}} \] is an integer .

Jean writes five tests and achieves the marks shown on the graph. What is her average mark on these five tests? [asy] draw(origin -- (0, 10.1)); for(int i = 0; i < 11; ++i) { draw((0, i) -- (10.5, i)); label(string(10*i), (0, i), W); } filldraw((1, 0) -- (1, 8) -- (2, 8) -- (2, 0) -- cycle, black); filldraw((3, 0) -- (3, 7) -- (4, 7) -- (4, 0) -- cycle, black); filldraw((5, 0) -- (5, 6) -- (6, 6) -- (6, 0) -- cycle, black); filldraw((7, 0) -- (7, 9) -- (8, 9) -- (8, 0) -- cycle, black); filldraw((9, 0) -- (9, 8) -- (10, 8) -- (10, 0) -- cycle, black); label("Test Marks", (5, 0), S); label(rotate(90)*"Marks out of 100", (-2, 5), W); [/asy] $\textbf{(A)}\ 74 \qquad \textbf{(B)}\ 76 \qquad \textbf{(C)}\ 70 \qquad \textbf{(D)}\ 64 \qquad \textbf{(E)}\ 79$

The geometric series $ a \plus{} ar \plus{} ar^{2} \plus{} ...$ has a sum of $ 7$, and the terms involving odd powers of $ r$ have a sum of $ 3$. What is $ a \plus{} r$? $ \textbf{(A)}\ \frac {4}{3}\qquad \textbf{(B)}\ \frac {12}{7}\qquad \textbf{(C)}\ \frac {3}{2}\qquad \textbf{(D)}\ \frac {7}{3}\qquad \textbf{(E)}\ \frac {5}{2}$

Let $\Gamma$ be a circle in the plane and $S$ be a point on $\Gamma$. Mario and Luigi drive around the circle $\Gamma$ with their go-karts. They both start at $S$ at the same time. They both drive for exactly $6$ minutes at constant speed counterclockwise around the circle. During these $6$ minutes, Luigi makes exactly one lap around $\Gamma$ while Mario, who is three times as fast, makes three laps. While Mario and Luigi drive their go-karts, Princess Daisy positions herself such that she is always exactly in the middle of the chord between them. When she reaches a point she has already visited, she marks it with a banana. How many points in the plane, apart from $S$, are marked with a banana by the end of the $6$ minutes.

If $x, y, z$ are positive real numbers such that $x + y + z = 9xyz.$ Prove that: $$\frac {x} {\sqrt {x^2+2yz+2}}+\frac {y} {\sqrt {y^2+2zx+2}}+\frac {z} {\sqrt {z^2+2xy+2}}\ge 1.$$ Consider when equality applies.

Suppose $S=\{1,2,3,...,2017\}$,for every subset $A$ of $S$,define a real number $f(A)\geq 0$ such that: $(1)$ For any $A,B\subset S$,$f(A\cup B)+f(A\cap B)\leq f(A)+f(B)$; $(2)$ For any $A\subset B\subset S$, $f(A)\leq f(B)$; $(3)$ For any $k,j\in S$,$$f(\{1,2,\ldots,k+1\})\geq f(\{1,2,\ldots,k\}\cup \{j\});$$ $(4)$ For the empty set $\varnothing$, $f(\varnothing)=0$. Confirm that for any three-element subset $T$ of $S$,the inequality $$f(T)\leq \frac{27}{19}f(\{1,2,3\})$$ holds.

A chord $CD$ of a circle with center $O$ is perpendicular to a diameter $AB$. A chord $AE$ bisects the radius $OC$. Show that the line $DE$ bisects the chord $BC$ [i]V. Gordon[/i]

Isosceles $\triangle{ABC}$ has interior point $O$ such that $AO = \sqrt{52}$, $BO = 3$, and $CO = 5$. Given that $\angle{ABC}=120^{\circ}$, find the length $AB$. [i]Proposed by Powell Zhang[/i]

Let $ABC$ be a triangle with $AB=AC$, and let $M$ be the midpoint of $BC$. Let $P$ be a point such that $PB<PC$ and $PA$ is parallel to $BC$. Let $X$ and $Y$ be points on the lines $PB$ and $PC$, respectively, so that $B$ lies on the segment $PX$, $C$ lies on the segment $PY$, and $\angle PXM=\angle PYM$. Prove that the quadrilateral $APXY$ is cyclic.

Given an integer $ k > 1.$ We call a $ k \minus{}$digits decimal integer $ a_{1}a_{2}\cdots a_{k}$ is $ p \minus{}$monotonic, if for each of integers $ i$ satisfying $ 1\le i\le k \minus{} 1,$ when $ a_{i}$ is an odd number, $ a_{i} > a_{i \plus{} 1};$ when $ a_{i}$ is an even number, $ a_{i}<a_{i \plus{} 1}.$ Find the number of $ p \minus{}$monotonic $ k \minus{}$digits integers.

Let $ABC$ and $DEF$ be two triangles, such that $AB=DE=20$, $BC=EF=13$, and $\angle A = \angle D$. If $AC-DF=10$, determine the area of $\triangle ABC$. [i]Proposed by Lewis Chen[/i]

In the tribe of Zimmer, being able to hike long distances and knowing the roads through the forest are both extremely important, so a boy who reaches the age of manhood is not designated as a man by the tribe until he completes an interesting rite of passage. The man must go on a sequence of hikes. The first hike is a $5$ kilometer hike down the main road. The second hike is a $5\frac{1}{4}$ kilometer hike down a secondary road. Each hike goes down a different road and is a quarter kilometer longer than the previous hike. The rite of passage is completed at the end of the hike where the cumulative distance walked by the man on all his hikes exceeds $1000$ kilometers. So in the tribe of Zimmer, how many roads must a man walk down, before you call him a man?

We say that a number is [i]angelic[/i] if it is greater than $10^{100}$ and all of its digits are elements of $\{1,3,5,7,8\}$. Suppose $P$ is a polynomial with nonnegative integer coefficients such that over all positive integers $n$, if $n$ is angelic, then the decimal representation of $P(s(n))$ contains the decimal representation of $s(P(n))$ as a contiguous substring, where $s(n)$ denotes the sum of digits of $n$. Prove that $P$ is linear and its leading coefficient is $1$ or a power of $10$. [i]Proposed by Grant Yu[/i]

In this question we re-define the operations addition and multiplication as follows: $a + b$ is defined as the minimum of $a$ and $b$, while $a * b$ is defined to be the sum of $a$ and $b$. For example, $3+4 = 3$, $3*4 = 7$, and $$3*4^2+5*4+7 = \min(\text{3 plus 4 plus 4}, \text{5 plus 4}, 7) = \min(11, 9, 7) = 7.$$ Let $a, b, c$ be real numbers. Characterize, in terms of $a, b, c$, what the graph of $y = ax^2+bx+c$ looks like.

It is said that a set of three different numbers is an [i]arithmetical set[/i] if one of the three numbers is the average of the other two. Consider the set $A_n = \{1, 2,..., n\}$, where $n $ is a positive integer, $n\ge 3$. a) How many [i]arithmetical sets[/i] are in $A_{10}$? b) Find the smallest $n$, such that the number of [i]arithmetical sets[/i] in $A_n$ is greater than $2004$.

In the unit circle shown in the figure, chords $PQ$ and $MN$ are parallel to the unit radius $OR$ of the circle with center at $O$. Chords $MP$, $PQ$, and $NR$ are each $s$ units long and chord $MN$ is $d$ units long. [asy] draw(Circle((0,0),10)); draw((0,0)--(10,0)--(8.5,5.3)--(-8.5,5.3)--(-3,9.5)--(3,9.5)); dot((0,0)); dot((10,0)); dot((8.5,5.3)); dot((-8.5,5.3)); dot((-3,9.5)); dot((3,9.5)); label("1", (5,0), S); label("s", (8,2.6)); label("d", (0,4)); label("s", (-5,7)); label("s", (0,8.5)); label("O", (0,0),W); label("R", (10,0), E); label("M", (-8.5,5.3), W); label("N", (8.5,5.3), E); label("P", (-3,9.5), NW); label("Q", (3,9.5), NE); [/asy] Of the three equations \[ \textbf{I.}\ d-s=1, \qquad \textbf{II.}\ ds=1, \qquad \textbf{III.}\ d^2-s^2=\sqrt{5} \]those which are necessarily true are $\textbf{(A)}\ \textbf{I}\ \text{only} \qquad\textbf{(B)}\ \textbf{II}\ \text{only} \qquad\textbf{(C)}\ \textbf{III}\ \text{only} \qquad\textbf{(D)}\ \textbf{I}\ \text{and}\ \textbf{II}\ \text{only} \qquad\textbf{(E)}\ \textbf{I, II}\ \text{and} \textbf{III}$

Christian Reiher and Reid Barton want to open a security box, they already managed to discover the algorithm to generate the key codes and they obtained the following information: $i)$ In the screen of the box will appear a sequence of $n+1$ numbers, $C_0 = (a_{0,1},a_{0,2},...,a_{0,n+1})$ $ii)$ If the code $K = (k_1,k_2,...,k_n)$ opens the security box then the following must happen: a) A sequence $C_i = (a_{i,1},a_{i,2},...,a_{i,n+1})$ will be asigned to each $k_i$ defined as follows: $a_{i,1} = 1$ and $a_{i,j} = a_{i-1,j}-k_ia_{i,j-1}$, for $i,j \ge 1$ b) The sequence $(C_n)$ asigned to $k_n$ satisfies that $S_n = \sum_{i=1}^{n+1}|a_i|$ has its least possible value, considering all possible sequences $K$. The sequence $C_0$ that appears in the screen is the following: $a_{0,1} = 1$ and $a_0,i$ is the sum of the products of the elements of each of the subsets with $i-1$ elements of the set $A =$ {$1,2,3,...,n$}, $i\ge 2$, such that $a_{0, n+1} = n!$ Find a sequence $K = (k_1,k_2,...,k_n)$ that satisfies the conditions of the problem and show that there exists at least $n!$ of them.

a) Prove that every function of the form $$f(x)=\frac{a_{0}}{2}+\cos(x)+\sum_{n=2}^{N}a_{n}\cos(nx)$$ with $|a_{0}|<1$ has positive as well as negative values in the period $[0,2\pi)$. b) Prove that the function $$F(x)=\sum_{n=1}^{100}\cos(n^{\frac{3}{2}}x)$$ has at least $40$ zeroes in the interval $(0,1000)$.

Konstantin has a pile of $100$ pebbles. In each move, he chooses a pile and splits it into two smaller ones until he gets $100 $ piles each with a single pebble. (a) Prove that at some point, there are $30$ piles containing a total of exactly $60$ pebbles. (b) Prove that at some point, there are $20$ piles containing a total of exactly $60$ pebbles. (c) Prove that Konstantin may proceed in such a way that at no point, there are $19$ piles containing a total of exactly $60$ pebbles.

a) A certain committee has gathered $40$ times. There were $10$ members on every meeting. Not a single couple has met on the meetings twice. Prove that there were no less then $60$ members in the committee. b) Prove that you can not construct more then $30$ subcommittees of $5$ members from the committee of $25$ members, with no couple of subcommittees having more than one common member.

Given four distinct parallel planes, prove that there exists a regular tetrahedron with a vertex on each plane.

Let $B = (-1, 0)$ and $C = (1, 0)$ be fixed points on the coordinate plane. A nonempty, bounded subset $S$ of the plane is said to be [i]nice[/i] if $\text{(i)}$ there is a point $T$ in $S$ such that for every point $Q$ in $S$, the segment $TQ$ lies entirely in $S$; and $\text{(ii)}$ for any triangle $P_1P_2P_3$, there exists a unique point $A$ in $S$ and a permutation $\sigma$ of the indices $\{1, 2, 3\}$ for which triangles $ABC$ and $P_{\sigma(1)}P_{\sigma(2)}P_{\sigma(3)}$ are similar. Prove that there exist two distinct nice subsets $S$ and $S'$ of the set $\{(x, y) : x \geq 0, y \geq 0\}$ such that if $A \in S$ and $A' \in S'$ are the unique choices of points in $\text{(ii)}$, then the product $BA \cdot BA'$ is a constant independent of the triangle $P_1P_2P_3$.

Show that for any positive integers $k$ and $1 \leq a \leq 9$, there exists $n$ such that satisfies the below statement. When $2^n=a_0+10a_1+10^2a_2+ \cdots +10^ia_i+ \cdots $ $(0 \leq a_i \leq 9$ and $a_i$ is integer), $a_k$ is equal to $a$.

A finite list of rational numbers is written on a blackboard. In an [i]operation[/i], we choose any two numbers $a$, $b$, erase them, and write down one of the numbers \[ a + b, \; a - b, \; b - a, \; a \times b, \; a/b \text{ (if $b \neq 0$)}, \; b/a \text{ (if $a \neq 0$)}. \] Prove that, for every integer $n > 100$, there are only finitely many integers $k \ge 0$, such that, starting from the list \[ k + 1, \; k + 2, \; \dots, \; k + n, \] it is possible to obtain, after $n - 1$ operations, the value $n!$.

Let $ 1<a_1<a_2< \ldots <a_n<x$ be positive integers such that $ \sum_{i\equal{}1}^n 1/a_i \leq 1$. Let $ y$ denote the number of positive integers smaller that $ x$ not divisible by any of the $ a_i$. Prove that \[ y > \frac{cx}{\log x}\] with a suitable positive constant $ c$ (independent of $ x$ and the numbers $ a_i$). [i]I. Z. Ruzsa[/i]