The European zoos with at least two types of species are separated in two groups $\hat{A}$ and $\hat{B}$ in such a way that every pair of zoos $(A,B)$ $(A\in\hat{A}, B\in\hat{B})$ have some animal in common. What is the least $k$ for which we can color the cages in the zoos (each cage only has all animals of one species) such that no zoo has cages of only one color (with every animal across all zoos having to be colored in the same color)? For the maximal value of $k$, find all possibilities (zoos and species), for which this maximum is achieved.

Larry can swim from Harvard to MIT (with the current of the Charles River) in $40$ minutes, or back (against the current) in $45$ minutes. How long does it take him to row from Harvard to MIT, if he rows the return trip in $15$ minutes? (Assume that the speed of the current and Larry’s swimming and rowing speeds relative to the current are all constant.) Express your answer in the format mm:ss.

Find all functions $ f: \mathbb{R}^{+} \to \mathbb{R}^{+}$ such that $f(x+yf(x)) = xf(1+y)$ for all x, y positive reals.

Let $D$ be an interior point of triangle $ABC$. Lines $BD$ and $CD$ intersect sides $AC$ and $AB$ at points $E$ and $F$, respectively. Points $X$ and $Y$ are on the plane such that $BFEX$ and $CEFY$ are parallelograms. Suppose lines $EY$ and $FX$ intersect at a point $T$ inside triangle $ABC$. Prove that points $B$, $C$, $E$, and $F$ are concyclic if and only if $\angle BAD = \angle CAT$.

Given a non negative real $a$ and a sequence $(u_n)$ defined by \[ \begin{cases} u_1=3\\ u_{n+1}=\frac{u_n}{2}+\frac{n^2}{4n^2+a}\sqrt{u_n^2+3} \end{cases} \] a) Prove that for $a=0$, the sequence is convergent and find its limit. b) For $a\in [0,1]$, prove that the sequence if convergent.

Let $AD$ and $BE$ be the altitudes of acute triangle $ABC.$ The circles with diameters $AD$ and $BE$ intersect at points $S$ and $T$. Prove that $\angle ACS=\angle BCT.$

Given that $ a_1\equal{}1$, $ a_2\equal{}5$, $ \displaystyle a_{n\plus{}1} \equal{} \frac{a_n \cdot a_{n\minus{}1}}{\sqrt{a_n^2 \plus{} a_{n\minus{}1}^2 \plus{} 1}}$. Find a expression of the general term of $ \{ a_n \}$.

Find all pairs $(m, n)$ of positive integers satsifying $m^6+5n^2=m+n^3$.

Let $\phi$ be the Euler totient function. Let $\phi^k (n) = (\underbrace{\phi \circ ... \circ \phi}_{k})(n)$ be $\phi$ composed with itself $k$ times. Define $\theta (n) = min \{k \in N | \phi^k (n)=1 \}$ . For example, $\phi^1 (13) = \phi(13) = 12$ $\phi^2 (13) = \phi (\phi (13)) = 4$ $\phi^3 (13) = \phi(\phi(\phi(13))) = 2$ $\phi^4 (13) = \phi(\phi(\phi(\phi(13)))) = 1$ so $\theta (13) = 4$. Let $f(r) = \theta (13^r)$. Determine $f(2012)$.

Each time a bar of soap is used, its volume decreases by $10\%$. What is the minimum number of times a new bar would have to be used so that less than one-half its volume remains? $\textbf{(A)}\ 5 \qquad \textbf{(B)}\ 6 \qquad \textbf{(C)}\ 7 \qquad \textbf{(D)}\ 8 \qquad \textbf{(E)}\ 9$

Find all sets $A$ and $B$ that satisfy the following conditions: a) $A \cup B= \mathbb{Z}$; b) if $x \in A$ then $x-1 \in B$; c) if $x,y \in B$ then $x+y \in A$. [i]Laurentiu Panaitopol[/i]

For any positive integer $n$, let $\tau (n)$ denote the number of its positive divisors (including 1 and itself). Determine all positive integers $m$ for which there exists a positive integer $n$ such that $\frac{\tau (n^{2})}{\tau (n)}=m$.

Given are two concentric circles $\Omega$ and $\omega$. Each of the circles $b_1$ and $b_2$ is externally tangent to $\omega$ and internally tangent to $\Omega$, and $\omega$ each of the circles $c_1$ and $c_2$ is internally tangent to both $\Omega$ and $\omega$. Mark each point where one of the circles $b_1, b_2$ intersects one of the circles $c_1$ and $c_2$. Prove that there exist two circles distinct from $b_1, b_2, c_1, c_2$ which contain all $8$ marked points. (Some of these new circles may appear to be lines.)

For every $ n\in\mathbb{N}$ let $ d(n)$ denote the number of (positive) divisors of $ n$. Find all functions $ f: \mathbb{N}\to\mathbb{N}$ with the following properties: [list][*] $ d\left(f(x)\right) \equal{} x$ for all $ x\in\mathbb{N}$. [*] $ f(xy)$ divides $ (x \minus{} 1)y^{xy \minus{} 1}f(x)$ for all $ x$, $ y\in\mathbb{N}$.[/list] [i]Proposed by Bruno Le Floch, France[/i]

Let $\alpha \geq 1$ be a real number. Hephaestus and Poseidon play a turn-based game on an infinite grid of unit squares. Before the game starts, Poseidon chooses a finite number of cells to be [i]flooded[/i]. Hephaestus is building a [i]levee[/i], which is a subset of unit edges of the grid (called [i]walls[/i]) forming a connected, non-self-intersecting path or loop*. The game then begins with Hephaestus moving first. On each of Hephaestus’s turns, he adds one or more walls to the levee, as long as the total length of the levee is at most $\alpha n$ after his $n$th turn. On each of Poseidon’s turns, every cell which is adjacent to an already flooded cell and with no wall between them becomes flooded as well. Hephaestus wins if the levee forms a closed loop such that all flooded cells are contained in the interior of the loop — hence stopping the flood and saving the world. For which $\alpha$ can Hephaestus guarantee victory in a finite number of turns no matter how Poseidon chooses the initial cells to flood? ----- [size=75]*More formally, there must exist lattice points $\mbox{\footnotesize \(A_0, A_1, \dotsc, A_k\)}$, pairwise distinct except possibly $\mbox{\footnotesize \(A_0 = A_k\)}$, such that the set of walls is exactly $\mbox{\footnotesize \(\{A_0A_1, A_1A_2, \dotsc , A_{k-1}A_k\}\)}$. Once a wall is built it cannot be destroyed; in particular, if the levee is a closed loop (i.e. $\mbox{\footnotesize \(A_0 = A_k\)}$) then Hephaestus cannot add more walls. Since each wall has length $\mbox{\footnotesize \(1\)}$, the length of the levee is $\mbox{\footnotesize \(k\)}$.[/size] [i]Nikolai Beluhov[/i]

The eight points $A, B,. . ., G$ and $H$ lie on five circles as shown. Each of these letters are represented by one of the eight numbers $1, 2,. . ., 7$ and $ 8$ replaced so that the following conditions are met: (i) Each of the eight numbers is used exactly once. (ii) The sum of the numbers on each of the five circles is the same. How many ways are there to get the letters substituted through the numbers in this way? (Walther Janous) [img]https://cdn.artofproblemsolving.com/attachments/5/e/511cdd2fc31e8067f400369c4fe9cf964ef54c.png[/img]

Let $ABCD$ be a convex and cyclic quadrilateral. Let $AD\cap BC=\{E\}$, and let $M,N$ be points on $AD,BC$ such that $AM:MD=BN:NC$. Circle around $\triangle EMN$ intersects circle around $ABCD$ at $X,Y$ prove that $AB,CD$ and $XY$ are either parallel or concurrent.

Let $\delta_0=\triangle A_0B_0C_0$ be a triangle. On each of the sides $B_0C_0$, $C_0A_0$, $A_0B_0$, there are constructed squares in the halfplane, not containing the respective vertex $A_0,B_0,C_0$ and $A_1,B_1,C_1$ are the centers of the constructed squares. If we use the triangle $\delta_1=\triangle A_1B_1C_1$ in the same way we may construct the triangle $\delta_2=\triangle A_2B_2C_2$; from $\delta_2=\triangle A_2B_2C_2$ we may construct $\delta_3=\triangle A_3B_3C_3$ and etc. Prove that: (a) segments $A_0A_1,B_0B_1,C_0C_1$ are respectively equal and perpendicular to $B_1C_1,C_1A_1,A_1B_1$; (b) vertices $A_1,B_1,C_1$ of the triangle $\delta_1$ lies respectively over the segments $A_0A_3,B_0B_3,C_0C_3$ (defined by the vertices of $\delta_0$ and $\delta_1$) and divide them in ratio $2:1$. [i]K. Dochev[/i]

Find all positive integers $d$ that can be written in the form $$ d = \gcd(|x^2 - y| , |y^2 - z| , |z^2 - x|), $$ where $x, y, z$ are pairwise coprime positive integers such that $x^2 \neq y$, $y^2 \neq z$, and $z^2 \neq x$.

Find all the real numbers $x$ that verify the equation: $$x-3\{x\}-\{3\{x\}\}=0$$ $\{a\}$ represents the fractional part of $a$

The unit cells of a 5 x 5 board are painted with 5 colors in a way that every cell is painted by exactly one color and each color is used in 5 cells. Show that exists at least one line or one column of the board in which at least 3 colors were used.

The population of Nosuch Junction at one time was a perfect square. Later, with an increase of 100, the population was one more than a perfect square. Now, with an additional increase of 100, the population is again a perfect square. The original population is a multiple of: $ \textbf{(A)}\ 3 \qquad \textbf{(B)}\ 7 \qquad \textbf{(C)}\ 9 \qquad \textbf{(D)}\ 11 \qquad \textbf{(E)}\ 17$

Two circles $k_1,k_2$ touch each other at $P$, and touch a line $\ell$ at $A$ and $B$ respectively. Line $AP$ meets $k_2$ at $C$. Prove that $BC$ is perpendicular to $\ell$.

Evaluate $ \int_0^2 \frac{1}{\sqrt {1 \plus{} x^3}}\ dx$.

For a natural number $N$, consider all distinct perfect squares that can be obtained from $N$ by deleting one digit from its decimal representation. Prove that the number of such squares is bounded by some value that doesn't depend on $N$.