Given $a+b+c=5$ and $ 1 \le a, b, c \le 2 $, what is the minimum possible value of $\frac{1}{a+b}+\frac{1}{b+c}$?

In acute triangle $ABC$, $D\in BC,E\in CA,F\in AB$. Prove that the necessary and sufficient condition of $AD,BE,CF$ are heights of $\triangle ABC$ is that $S=\frac{R}{2}(EF+FD+DE)$. Note: $S$ is the area of $\triangle ABC$, $R$ is the circumradius of $\triangle ABC$.

Let $p \geq 5$ be a prime number. Prove that there exist at least 2 distinct primes $q_1, q_2$ satisfying $1 < q_i < p - 1$ and $q_i^{p-1} \not\equiv 1 \mbox{ (mod }p^2)$, for $i = 1, 2$.

Let be a real number $ r $ and two functions $ f:[r,\infty )\longrightarrow\mathbb{R} , F_1:(r,\infty )\longrightarrow\mathbb{R} $ satisfying the following two properties. $ \text{(i)} f $ has Darboux's intermediate value property. $ \text{(ii)} F_1$ is differentiable and $ F'_1=f\bigg|_{(r,\infty )} $ [b]1)[/b] Provide an example of what $ f,F_1 $ could be if $ f $ hasn't a lateral limit at $ r, $ and $ F_1 $ has lateral limit at $ r. $ Moreover, if $ f $ has lateral limit at $ r, $ show that [b]2)[/b] $ F_1 $ has a finite lateral limit at $ r. $ [b]3)[/b] the function $ F:[r,\infty )\longrightarrow\mathbb{R} $ defined as $$ F(x)=\left\{ \begin{matrix} F_1(x) ,& \quad x\in (r,\infty ) \\ \lim_{\stackrel{x\to r}{x>r}} F_1(x), & \quad x=r \end{matrix} \right. $$ is a primitive of $ f. $

For a rectangle $R$ with integral side lengths, denote by $D(a, b)$ the number of ways of covering $R$ by congruent rectangles with integral side lengths formed by a family of cuts parallel to one side of $R$. Determine the perimeter $P$ of the rectangle $R$ for which $\frac{D(a,b)}{a+b}$ is maximal.

Given a positive real $t$, a set $S$ of nonnegative reals is called $t$-good if for any two distinct elements $a,b$ in $S$, $\frac{a+b}2\ge\sqrt{ab}+t$. For all positive reals $N$, find the maximum number of elements a $t$-good set can have, if all elements are at most $N$. [i](Proposed by Ho Janson)[/i]

You and five friends need to raise $ \$1500$ in donations for a charity, dividing the fundraising equally. How many dollars will each of you need to raise? $ \textbf{(A)}\ 250\qquad \textbf{(B)}\ 300\qquad \textbf{(C)}\ 1500\qquad \textbf{(D)}\ 7500\qquad \textbf{(E)}\ 9000$

Arne and Bertil play a game on an $11 \times 11$ grid. Arne starts. He has a game piece that is placed on the center od the grid at the beginning of the game. At each move he moves the piece one step horizontally or vertically. Bertil places a wall along each move any of an optional four squares. Arne is not allowed to move his piece through a wall. Arne wins if he manages to move the pice out of the board, while Bertil wins if he manages to prevent Arne from doing that. Who wins if from the beginning there are no walls on the game board and both players play optimally?

Calculate \[\int\cdots\int \exp\left(-\sum_{1\le i\le j\le n}x_ix_j\right)dx_1\cdots dx_n\]

Bob and Cob are playing a game on an infinite grid of hexagons. On Bob's turn, he chooses one hexagon that has not yet been chosen, and draws a segment from the center of the hexagon to the midpoints of three of its sides. On Cob's turn, he erases one of Bob's edges made on the previous turn. Bob wins if his edges form a closed loop. Can Bob guarantee to win in a finite amount of time? (Note that Bob may win before Cob can play his next turn.) Proposed by [i]Jonathan He[/i]

$\cot 10 + \tan 5 =$ $\textbf{(A)}\ \csc 5 \qquad \textbf{(B)}\ \csc 10 \qquad \textbf{(C)}\ \sec 5 \qquad \textbf{(D)}\ \sec 10 \qquad \textbf{(E)}\ \sin 15$

A positive integer \( r \) is given, find the largest real number \( C \) such that there exists a geometric sequence $\{ a_n \}_{n\ge 1}$ with common ratio \( r \) satisfying $$ \| a_n \| \ge C $$ for all positive integers \( n \). Here, $\| x \|$ denotes the distance from the real number \( x \) to the nearest integer.

For how many (not necessarily positive) integer values of $n$ is the value of $4000\cdot \left(\tfrac{2}{5}\right)^n$ an integer? $ \textbf{(A) }3 \qquad \textbf{(B) }4 \qquad \textbf{(C) }6 \qquad \textbf{(D) }8 \qquad \textbf{(E) }9 \qquad $

Let $ABC$ be an isosceles triangle with $AB=AC$. Consider a variable point $P$ on the extension of the segment $BC$ beyound $B$ (in other words, $P$ lies on the line $BC$ such that the point $B$ lies inside the segment $PC$). Let $r_{1}$ be the radius of the incircle of the triangle $APB$, and let $r_{2}$ be the radius of the $P$-excircle of the triangle $APC$. Prove that the sum $r_{1}+r_{2}$ of these two radii remains constant when the point $P$ varies. [i]Remark.[/i] The $P$-excircle of the triangle $APC$ is defined as the circle which touches the side $AC$ and the [i]extensions[/i] of the sides $AP$ and $CP$.

Let $BE$ and $CF$ be the medians of an acute triangle $ABC.$ On the line $BC,$ points $K \ne B$ and $L \ne C$ are chosen such that $BE = EK$ and $CF = FL.$ Prove that $AK = AL.$ [i]Proposed by Heorhii Zhilinskyi[/i]

Given that $ 2^{2004}$ is a $ 604$-digit number whose first digit is $ 1$, how many elements of the set $ S \equal{} \{2^0,2^1,2^2, \ldots,2^{2003}\}$ have a first digit of $ 4$? $ \textbf{(A)}\ 194 \qquad \textbf{(B)}\ 195 \qquad \textbf{(C)}\ 196 \qquad \textbf{(D)}\ 197 \qquad \textbf{(E)}\ 198$

Find the greatest odd divisor of $160^3$.

Given is a triangle $ABC$, the inscribed circle $G$ of which has radius $r$. Let $r_a$ be the radius of the circle touching $AB$, $AC$ and $G$. [This circle lies inside triangle $ABC$.] Define $r_b$ and $r_c$ similarly. Prove that $r_a + r_b + r_c \geq r$ and find all cases in which equality occurs. [i]Bosnia - Herzegovina Mathematical Olympiad 2002[/i]

Let $m,n\in \mathbb{Z}_{\ge 1}$ and a rectangular board $m\times n$ sliced by parallel lines to the rectangle's sides into $mn$ unit squares. At moment $t=0$, there is an ant inside every square, positioned exactly in its centre, such that it is oriented towards one of the rectangle's sides. Every second, all the ants move exactly a unit following their current orientation; however, if two ants meet at the centre of a unit square, both of them turn $180^o$ around (the turn happens instantly, without any loss of time) and the next second they continue their motion following their new orientation. If two ants meet at the midpoint of a side of a unit square, they just continue moving, without changing their orientation.\\ \\ Prove that, after finitely many seconds, some ant must fall off the table.\\ \\ [i](Oliver Hayman)[/i]

a) Replace each letter in the following sum by a digit from $0$ to $9$, in such a way that the sum is correct. $\tab$ $\tab$ $ABC$ $\tab$ $\tab$ $DEF$ [u]$+GHI$[/u] $\tab$ $\tab$ $\tab$ $J J J$ Different letters must be replaced by different digits, and equal letters must be replaced by equal digits. Numbers $ABC$, $DEF$, $GHI$ and $JJJ$ cannot begin by $0$. b) Determine how many triples of numbers $(ABC,DEF,GHI)$ can be formed under the conditions given in a).

Find all pairs of positive integers $(x,y)$ such that $2^x + 3^y$ is a perfect square.

A finite graph $G(V,E)$ on $n$ points is drawn in the plane. For an edge $e$ of the graph, let $\chi(e)$ denote the number of edges that cross over edge $e$. Prove that \[\sum_{e\in E}\frac{1}{\chi(e)+1}\leq 3n-6.\][i]Proposed by Dömötör Pálvölgyi, Budapest[/i]

The cities of countries $A$ and $B$ are marked on the map, which has the form of a square with vertices at points $(0, 0)$ , $ (0, 1)$ , $(1, 1)$ , $(1, 0)$ of the plane. According to the trade agreement, country $A$ must ensure the delivery of $n$ kg of wheat to $n$ cities of country $B$, located at the points of the square with coordinates $y_1,..., y_n$, $1$ kg each city. Currently, $n$ kg of wheat are distributed among $n$ cities of country $A$, located at the points of the square with coordinates $x_1,... , x_n$, $1$ kg in each city. From each city of country $A$ to each city of the country $A$ any amount of wheat can be transported (of course, not more than $1$ kg). Transportation cost is for $t$ kg of wheat from a city with coordinates $x_i$ to a city with coordinates $y_j$ is equal to $tl_{ij}$, where $l_{ij }$is the length of the segment connecting the points $x_i$ and $y_j$. The government of country A is going to implement the optimal one (i,e. the cheapest) transportation plan. (a) Is it possible to implement the optimal transportation plan so that from each city of country $A$ to transport wheat only to one city of country $B$? (b) Will the response change if country $A$ is to deliver $n+1$ kg of wheat, in city $x_1$ is $2$ kg of wheat, and $2$ kg should be delivered to city $y_1$ (when for other cities the conditions remain the same)? [hide=original wording] Мiста країн A та B позначенi на мапi, що має вигляд квадрату з вершинами в точках (0, 0), (0, 1), (1, 1), (1, 0) площини. Згiдно торгової угоди, країна A має забез- печити доставку n кг пшеницi в n мiст країни B, що розташованi в точках квадрату з координатами y1, . . . , yn, по 1 кг в кожне мiсто. Наразi n кг пшеницi розподiленi серед n мiст країни A, що розташованi в точках квадрату з координатами x1, . . . , xn, по 1 кг в кожному мiстi. З кожного мiста країни A в кожне мiсто країни B можна перевезти довiльну кiлькiсть пшеницi (звичайно, не бiльше 1 кг). Вартiсть переве- зення t кг пшеницi з мiста з координатами xi в мiсто з координатами yj дорiвнює tlij , де lij – довжина вiдрiзку, що сполучає точки xi та yj . Уряд країни A збирається реалiзувати оптимальний (тобто найдешевший) план перевезення. 1. Чи можна реалiзувати оптимальний план перевезення таким чином, щоби з кожного мiста країни A перевозити пшеницю тiльке в одне мiсто країни B? 2. Чи змiниться вiдповiдь, якщо країна A має забезпечити доставку n + 1 кг пше- ницi, в мiстi x1 знаходиться 2 кг пшеницi, i в мiсто y1 має бути доставлено 2 кг пшеницi (щодо iнших мiст умови лишаються такими ж)?[/hide]

Let $a,b,c{}$ be positive real numbers. Prove that \[108\cdot(ab+bc+ca)\leqslant(\sqrt{a+b}+\sqrt{b+c}+\sqrt{c+a})^4.\]

An $n$-stick is a connected figure consisting of $n$ matches of length $1$ which are placed horizontally or vertically and no two touch each other at points other than their ends. Two shapes that can be transformed into each other by moving, rotating or flipping are considered the same. An $n$-mino is a shape which is built by connecting $n$ squares of side length 1 on their sides such that there's a path on the squares between each two squares of the $n$-mino. Let $S_n$ be the number of $n$-sticks and $M_n$ the number of $n$-minos, e.g. $S_3=5$ And $M_3=2$. (a) Prove that for any natural $n$, $S_n \geq M_{n+1}$. (b) Prove that for large enough $n$ we have $(2.4)^n \leq S_n \leq (16)^n$. A [b]grid segment[/b] is a segment on the plane of length 1 which it's both ends are integer points. A polystick is called [b]wise[/b] if using it and it's rotations or flips we can cover all grid segments without overlapping, otherwise it's called [b]unwise[/b]. (c) Prove that there are at least $2^{n-6}$ different unwise $n$-sticks. (d) Prove that any polystick which is in form of a path only going up and right is wise. (e) Extra points: Prove that for large enough $n$ we have $3^n \leq S_n \leq 12^n$ Time allowed for this exam was 2 hours.