There are $80$ peoples, one of them is murderer, and other one is witness of crime. Every day detective interrogates some peoples from this group. Witness will says about crime only if murderer will not be in interrogatory with him. It is enough $12$ days to find murderer ?

Let $a,b,c$ be positive real numbers. Prove that \[\left((3a^2+1)^2+2\left(1+\frac{3}{b}\right)^2\right)\left((3b^2+1)^2+2\left(1+\frac{3}{c}\right)^2\right)\left((3c^2+1)^2+2\left(1+\frac{3}{a}\right)^2\right)\geq 48^3\]

In a triangle $ABC$, $AD$ is the altitude from $A$, and $H$ is the orthocentre. Let $K$ be the centre of the circle passing through $D$ and tangent to $BH$ at $H$. Prove that the line $DK$ bisects $AC$.

$ C$ and $ D$ are points on a semicircle. The tangent at $ C$ meets the extended diameter of the semicircle at $ B$, and the tangent at $ D$ meets it at $ A$, so that $ A$ and $ B$ are on opposite sides of the center. The lines $ AC$ and $ BD$ meet at $ E$. $ F$ is the foot of the perpendicular from $ E$ to $ AB$. Show that $ EF$ bisects angle $ CFD$

Let be eight real numbers $ 1\le a_1< a_2< a_3< a_4,x_1<x_2<x_3<x_4. $ Prove that $$ \begin{vmatrix}a_1^{x_1} & a_1^{x_2} & a_1^{x_3} & a_1^{x_4} \\ a_2^{x_1} & a_2^{x_2} & a_2^{x_3} & a_2^{x_4} \\ a_3^{x_1} & a_3^{x_2} & a_3^{x_3} & a_3^{x_4} \\ a_4^{x_1} & a_4^{x_2} & a_4^{x_3} & a_4^{x_4} \\ \end{vmatrix} >0. $$ [i]Marian Andronache, Ion Savu[/i]

Suppose $a$ and $b$ be positive integers not exceeding $100$ such that $$ab=\left(\frac{\text{lcm}(a,b)}{\gcd(a,b)}\right)^2.$$ Compute the largest possible value of $a+b.$

Let $X{}$ be a set of integers which can be partitioned into $N{}$ disjoint increasing arithmetic progressions (infinite in both directions), and cannot be partitioned into a smaller number of such progressions. Is such partition into $N{}$ progressions unique for every such $X{}$ if a) $N = 2{}$ and b) $N = 3$? [i]Viktor Kleptsyn[/i]

The great Zagier and his assistant performed a magic trick, which was a natural one number $n$ involved. To do this, Zagier distributes $n$ identical coins (with heads and tails on the sides) and then leave the hall. The audience now arranges the coins in a row, you can choose the top side of each coin as you like, and then tell the assistant one natural number $k$ from $1$ to $n$. This then turns over exactly one coin, whereupon Zagier is brought in and placed in front of said coins. To the surprise of the non-mathematical, he can name the number $k$ to the public. For which natural numbers $n$ can this trick be carried out, if the two are allowed to coordinate only before the show, but during the show they do not use any magic tricks?

Consider the set of natural numbers $ U = \{1,2,3, ..., 6024 \} $ Prove that for any partition of the $ U $ in three subsets with $ 2008 $ elements each, we can choose a number in each subset so that one of the numbers is the sum of the other two numbers.

Let $n$ be a positive integer. Suppose that $A$ and $B$ are invertible $n \times n$ matrices with complex entries such that $A+B=I$ (where $I$ is the identity matrix) and \[(A^2+B^2)(A^4+B^4)=A^5+B^5.\] Find all possible values of $\det(AB)$ for the given $n$.

Suppose $l(M, XYZ)$ is a Simson line of the triangle $XYZ$ that passes through $M$. Suppose $ABCDEF$ is a cyclic hexagon such that $l(A, BDF), l(B, ACE), l(D, ABF), l(E, ABC)$ intersect at a single point. Prove that $CDEF$ is a rectangle. [color=blue]Should the first sentence read: Suppose $l(M, XYZ)$ is a Simson line of the triangle $XYZ$ [u]with respect to[/u] $M$. ? Since it appears weird that a Simson line that passes a point is to be constructed. However, this is Unsolved after all, so I'm not sure.[/color]

8) A train, originally of mass $M$, is traveling on a frictionless straight horizontal track with constant speed $v$. Snow starts to fall vertically and sticks to the train at a rate of $\rho$, where $\rho$ has units of kilograms per second. The train's engine keeps the train moving at constant speed $v$ as snow accumulates on the train. What is the minimum power required from the engine to keep the train traveling at a constant speed v? A) $0$ B) $Mgv$ C) $\frac{1}{2}Mv^2$ D) $\frac{1}{2}pv^2$ E) $\rho v^2$

Twelve $1$'s and ten $-1$'s are written on a chalkboard. You select 10 of the numbers and compute their product, then add up these products for every way of choosing 10 numbers from the 22 that are written on the chalkboard. What sum do you get?

Find all natural numbers $n$ for which the following $5$ conditions hold: $(1)$ $n$ is not divisible by any perfect square bigger than $1$. $(2)$ $n$ has exactly one prime divisor of the form $4k+3$, $k\in \mathbb{N}_0$. $(3)$ Denote by $S(n)$ the sum of digits of $n$ and $d(n)$ as the number of positive divisors of $n$. Then we have that $S(n)+2=d(n)$. $(4)$ $n+3$ is a perfect square. $(5)$ $n$ does not have a prime divisor which has $4$ or more digits.

There are two circles with centers $O_1,O_2$ lie inside of circle $\omega$ and are tangent to it. Chord $AB$ of $\omega$ is tangent to these two circles such that they lie on opposite sides of this chord. Prove that $\angle O_1AO_2 + \angle O_1BO_2 > 90^\circ$. [i]Proposed by Iman Maghsoudi[/i]

Let $ABC$ be a right-angled triangle with $BC=AC=1$. Let $P$ be any point on $AB$. Draw perpendiculars $PQ$ and $PR$ on $AC$ and $BC$ respectively from $P$. Define $M$ to be the maximum of the areas of $BPR, APQ$ and $PQCR$. Find the minimum possible value of $M$.

3. Plane is divided with horizontal and vertical lines into unit squares. Into each square we write a positive integer so that each positive integer appears exactly once. Determine whether it is possible to write numbers in such a way, that each written number is a divisor of a sum of its four neighbours.

All the $5$-digit numbers from $11111$ to $99999$ are written on the cards. Those cards lies in a line in an arbitrary order. Prove that the resulting $444445$-digit number is not a power of two.

From a point $P$, two tangent lines are drawn to a circle $\Gamma$, which touch it at points $A$ and $B$. A circle $\Phi$ is drawn with center at $P$ and passes through $A$ and $B$ and is taken a point $R$ that is on the circumference $\Phi$ and in the interior of $\Gamma$. The straight line $PR$ intersects $\Gamma$ at the points $S$ and $Q$. The straight lines $AR$ and $BR$ meet $\Gamma$ again at points $C$ and $D$, respectively. Prove that $CD$ passes through the midpoint of $SQ$.

Show that there are infinitely many odd composite numbers in the sequence $1^1, 1^1 + 2^2, 1^1 + 2^2 + 3^3, 1^1 + 2^2 + 3^3 + 4^4, ...$ .

Let $ABC$ be a triangle. Prove that \[\frac{a^2}{bc}+\frac{b^2}{ca}+\frac{c^2}{ab} \ge 4\left(\sin^2\frac{A}{2}+\sin^2\frac{B}{2}+\sin^2\frac{C}{2}\right).\]

Triangle $ABC$ has circumcenter $O$ and incenter $I$. The incircle is tangent to $AC, AB$ at $E, F$, respectively. $H$ is the orthocenter of $\triangle BIC$. $\odot(AEF)$ and $\odot(ABC)$ intersects again at $S$. $BC, AH$ intersects $OI$ again at $J, K$, respectively. Prove that $H, K, J, S$ are concyclic. [i]Proposed by chengbilly[/i]

Given is a convex polygon $ P$ with $ n$ vertices. Triangle whose vertices lie on vertices of $ P$ is called [i]good [/i] if all its sides are unit length. Prove that there are at most $ \frac {2n}{3}$ [i]good[/i] triangles. [i]Author: Vyacheslav Yasinskiy, Ukraine[/i]

Find the smallest possible value of $x + y$ where $x, y \ge 1$ and $x$ and $y$ are integers that satisfy $x^2 - 29y^2 = 1$.

Triangle $ABC$ is inscribed in a circle with center $O$. Let $D$ and $E$ be points on the respective sides $AB$ and $AC$ so that $DE$ is perpendicular to $AO$. Show that the four points $B,D,E$ and $C$ lie on a circle.