There exists one pair of positive integers $ a, b $ such that $ 100 > a > b > 0 $ and $ \dfrac{1}{a} + \dfrac{1}{b} = \dfrac{2}{35} $. Find $ a + b $.

Let $ABCD$ be a cyclic quadrilateral. Let $X$ be the foot of the perpendicular from the point $A$ to the line $BC$, let $Y$ be the foot of the perpendicular from the point $B$ to the line $AC$, let $Z$ be the foot of the perpendicular from the point $A$ to the line $CD$, let $W$ be the foot of the perpendicular from the point $D$ to the line $AC$. Prove that $XY\parallel ZW$. Darij

A circle with area $\tfrac{36}{\pi}$ has the same perimeter as a square with what side length? $\textbf{(A) }\frac{9}{\pi}\qquad\textbf{(B) }3\qquad\textbf{(C) }\pi\qquad\textbf{(D) }6\qquad\textbf{(E) }\pi^2$

Let $f$ be a function defined for the non-negative integers, such that: a) $f(n)=0$ if $n=2^{j}-1$ for some $j \geq 0$. b) $f(n+1)=f(n)-1$ otherwise. i) Show that for every $n \geq 0$ there exists $k \geq 0$ such that $f(n)+n=2^{k}-1$. ii) Find $f(2^{1990})$.

How many multiples of $2005$ are factors of $(2005)^2$?

Answer the following questions. (1) For $x\geq 0$, show that $x-\frac{x^3}{6}\leq \sin x\leq x.$ (2) For $x\geq 0$, show that $\frac{x^3}{3}-\frac{x^5}{30}\leq \int_0^x t\sin t\ dt\leq \frac{x^3}{3}.$ (3) Find the limit \[\lim_{x\rightarrow 0} \frac{\sin x-x\cos x}{x^3}.\]

Prove that $n^2 + 8n + 15$ is not divisible by $n + 4$ for any positive integer $n$.

Régis, Ed and Rafael are at the IMO. They are going to play a game in Bath, and there are $2^n$ houses in the city. Régis and Ed will team up against Rafael. The game operates as follows: First, Régis and Ed think on a strategy and then let Rafael know it. After this, Régis and Ed no longer communicate, and the game begins. Rafael decides on an order to visit the houses and then starts taking Régis to them in that order. At each house, except for the last one, Régis choose a number between $1$ and $n$ and places it in the house. In the last house, Rafael chooses a number from $1$ to $n$ and places it there. Afterwards, Ed sees all the houses and the numbers in them, and he must guess in which house Rafael placed the number. Ed is allowed $k$ guesses. What is the smallest $k$ for which there exists a strategy for Ed and Régis to ensure that Ed correctly guess the house where Rafael placed the number?

$s,t\in\mathbb{R}$, then the minumum value of $(s+5-3|\cos t|)^2+(s-2|\sin t|)^2$ is________.

Let $\Gamma$ be a circle and let $d$ be a line such that $\Gamma$ and $d$ have no common points. Further, let $AB$ be a diameter of the circle $\Gamma$; assume that this diameter $AB$ is perpendicular to the line $d$, and the point $B$ is nearer to the line $d$ than the point $A$. Let $C$ be an arbitrary point on the circle $\Gamma$, different from the points $A$ and $B$. Let $D$ be the point of intersection of the lines $AC$ and $d$. One of the two tangents from the point $D$ to the circle $\Gamma$ touches this circle $\Gamma$ at a point $E$; hereby, we assume that the points $B$ and $E$ lie in the same halfplane with respect to the line $AC$. Denote by $F$ the point of intersection of the lines $BE$ and $d$. Let the line $AF$ intersect the circle $\Gamma$ at a point $G$, different from $A$. Prove that the reflection of the point $G$ in the line $AB$ lies on the line $CF$.

Let $ABC$ be a triangle with circumcircle $\Gamma$ and incenter $I$ and let $M$ be the midpoint of $\overline{BC}$. The points $D$, $E$, $F$ are selected on sides $\overline{BC}$, $\overline{CA}$, $\overline{AB}$ such that $\overline{ID} \perp \overline{BC}$, $\overline{IE}\perp \overline{AI}$, and $\overline{IF}\perp \overline{AI}$. Suppose that the circumcircle of $\triangle AEF$ intersects $\Gamma$ at a point $X$ other than $A$. Prove that lines $XD$ and $AM$ meet on $\Gamma$. [i]Proposed by Evan Chen, Taiwan[/i]

Let $ ABCD$ be a cyclic quadrilateral and $ r$ and $ s$ the lines obtained reflecting $ AB$ with respect to the internal bisectors of $ \angle CAD$ and $ \angle CBD$, respectively. If $ P$ is the intersection of $ r$ and $ s$ and $ O$ is the center of the circumscribed circle of $ ABCD$, prove that $ OP$ is perpendicular to $ CD$.

Let $O $, $O_1$, $O_2 $, $O_3$, $O_4$ be points such that $O_1$, $O$, $O_3$ and $O_2$, $O$, $O_4$ are collinear in that order, $OO_1 =1$, $OO_2 = 2$, $OO_3 =\sqrt2$, $OO_4 = 2$, and $\angle O_1OO_2 = 45^o$. Let $\omega_1$, $\omega_2$, $\omega_3$, $\omega_4$ be the circles with respective centers $O_1$, $O_2$ , $O_3$, $O_4$ that go through $O$. Let $A$ be the intersection of $\omega_1$ and $\omega_2$, $B$ be the intersection of $\omega_2$ and $\omega_3$, $C$ be the intersection of $\omega_3$ and $\omega_4$, and $D$ be the intersection of $\omega_4$ and $\omega_1$ with $A$, $B$, $C$, $D$ all distinct from $O$. What is the largest possible area of a convex quadrilateral $P_1P_2P_3P_4$ such that $P_i$ lies on $O_i$ and that $A$, $B$, $C$, $D$ all lie on its perimeter?

I plotted the graphs $y=(x-0)^2, y=(x-5)^2, \ldots, y=(x-45)^2.$ I also draw a line $y=k,$ and notice that it intersects the parabolas at exactly $19$ distinct points. What is $k$?

Consider a complex number whose affix in the complex plane is situated on the first quadrant of the unit circle centered at origin. Then, the following inequality holds. $$ \sqrt{2} +\sqrt{2+\sqrt{2}} \le |1+z|+|1+z^2|+|1+z^4|\le 6 $$ [i]Costică Ambrinoc[/i]

The main building of ETH Zurich is a rectangle divided into unit squares. Every side of a square is a wall, with certain walls having doors. The outer wall of the main building has no doors. A number of participants of the SMO have gathered in the main building lost. You can only move from one square to another through doors. We have indicates that there is a walkable path between every two squares of the main building. Cyril wants the participants to find each other again by having everyone on the same square leads. To do this, he can give them the following instructions via walkie-talkie: North, East, South or West. After each instruction, each participant simultaneously attempts a square in that direction to go. If there is no door in the corresponding wall, he remains standing. Show that Cyril can reach his goal after a finite number of directions, no matter which one square the participants at the beginning. [hide=original wording]Das Hauptgebäude der ETH Zürich ist ein in Einheitsquadrate unterteiltes Rechteck. Jede Seite eines Quadrates ist eine Wand, wobei gewisse Wände Türen haben. Die Aussenwand des Hauptgebäudes hat keine Türen. Eine Anzahl von Teilnehmern der SMO hat sich im Hauptgebäude verirrt. Sie können sich nur durch Türen von einem Quadrat zum anderen bewegen. Wir nehmen an, dass zwischen je zwei Quadraten des Hauptgebäudes ein begehbarer Weg existiert. Cyril möchte erreichen, dass sich die Teilnehmer wieder nden, indem er alle auf dasselbe Quadrat führt. Dazu kann er ihnen per Walkie-Talkie folgende Anweisungen geben: Nord, Ost, Süd oder West. Nach jeder Anweisung versucht jeder Teilnehmer gleichzeitig, ein Quadrat in diese Richtung zu gehen. Falls in der entsprechenden Wand keine Türe ist, bleibt er stehen. Zeige, dass Cyril sein Ziel nach endlich vielen Anweisungen erreichen kann, egal auf welchen Quadraten sich die Teilnehmer am Anfang benden. [/hide]

For a positive integer $n$, let $\mathcal{D}(n)$ be the value obtained by, starting from the left, alternating between adding and subtracting the digits of $n$. For example, $\mathcal{D}(321)=3-2+1=2$, while $\mathcal{D}(40)=4-0=4$. Compute the value of the sum \[\sum_{n=1}^{100}\mathcal{D}(n)=\mathcal{D}(1)+\mathcal{D}(2)+\dots+\mathcal{D}(100).\]

A unit square is removed from the corner of an $n \times n$ grid, where $n \geq 2$. Prove that the remainder can be covered by copies of the figures of $3$ or $5$ unit squares depicted in the drawing below. [asy] import geometry; draw((-1.5,0)--(-3.5,0)--(-3.5,2)--(-2.5,2)--(-2.5,1)--(-1.5,1)--cycle); draw((-3.5,1)--(-2.5,1)--(-2.5,0)); draw((0.5,0)--(0.5,3)--(1.5,3)--(1.5,1)--(3.5,1)--(3.5,0)--cycle); draw((1.5,0)--(1.5,1)); draw((2.5,0)--(2.5,1)); draw((0.5,1)--(1.5,1)); draw((0.5,2)--(1.5,2)); [/asy] [b]Note:[/b] Every square must be covered once and figures must not go over the bounds of the grid.

In the obtuse triangle $ABC$, $AM = MB, MD \perp BC, EC \perp BC$. If the area of $\triangle ABC$ is 24, then the area of $\triangle BED$ is [asy] size(200); defaultpen(linewidth(0.8)+fontsize(11pt)); pair A = (6.5,3.2), B = origin, C = (5.0), D = (3.3,0); pair Xc = (C.x,4), Xd = (D.x,4), E = intersectionpoint(A--B,C--Xc), M = intersectionpoint(D--Xd, A--B); draw(C--A--B--C--E--D--M); label("$A$",A,NE); label("$B$",B,W); label("$C$",C,SE); label("$D$",D,S); label("$E$",E,N); label("$M$",M,N); draw(rightanglemark(D,C,E,7)^^rightanglemark(B,D,M,7)); [/asy] $\textbf{(A) }9\qquad \textbf{(B) }12\qquad \textbf{(C) }15\qquad \textbf{(D) }18\qquad \textbf{(E) }\text{not uniquely determined}$

Find all triples $(x,y,z)$ of real numbers satisfying the system of equations $\left\{\begin{matrix} 3(x+\frac{1}{x})=4(y+\frac{1}{y})=5(z+\frac{1}{z}),\\ xy+yz+zx=1.\end{matrix}\right.$

Find the sum of all positive integers $k$ such that the sum of $k$ consecutive integers, starting from $20$, is a triangular number. \\(A triangular number is of the form $1+2+\dots+j$ for some integer $j$.) [i]Team #5[/i]

Find all natural numbers $n$ such that the equation $x^2 + y^2 + z^2 = nxyz$ has solutions in positive integers

The plane is covered with network of regular congruent disjoint hexagons. Prove that there cannot exist a square which has its four vertices in the vertices of the hexagons. [i]Gabriel Nagy[/i]

If $n \in N$ and $0 < x <\frac{\pi}{2n}$, prove the inequality $\frac{\sin 2x}{\sin x}+\frac{\sin 3x}{\sin 2x} +...+\frac{\sin (n+1)x}{\sin nx} < 2\frac{\cos x}{\sin^2 x}$. .

In a school there are totally $n > 2$ classes and not all of them have the same numbers of students. It is given that each class has one head student. The students in each class wear hats of the same color and different classes have different hat colors. One day all the students of the school stand in a circle facing toward the center, in an arbitrary order, to play a game. Every minute, each student put his hat on the person standing next to him on the right. Show that at some moment, there are $2$ head students wearing hats of the same color.