For a positive integer n, let $w(n)$ denote the number of distinct prime divisors of n. Determine the least positive integer k such that $2^{w(n)} \leq k \sqrt[4]{n}$ for all positive integers n.

Fifteen pairwise coprime positive integers chosen so that each of them less than 2010. Show that at least one of them is prime.

Let $A$ be a finite set of points in the coordinate plane. Suppose that $A$ has $n\geq3$ points. Given any $a$ in $A$, the horizontal and vertical lines through $a$ define four [i]closed[/i] quadrants centered at $a$. For any real number $\alpha$, call a point $a$ in $A$ $\alpha$-good if there are two diagonally opposite closed quadrants centered at $a$ that each contain at least $\alpha n$ points from $A$. Show that there is some $a$ in $A$ that is $\frac{1}{8}$-good.

A $\emph{luns}$ with vertices $X$ and $Y$ is a region bounded by two circular arcs meeting at the endpoints $X$ and $Y$. Let $A$, $B$, and $V$ be points such that $\angle AVB=75^\circ$, $AV=\sqrt{2}$ and $BV=\sqrt{3}$. Let $\mathcal{L}$ be the largest area luns with vertices $A$ and $B$ that does not intersect the lines $VA$ or $VB$ in any points other than $A$ and $B$. Define $k$ as the area of $\mathcal{L}$. Find the value \[ \dfrac {k}{(1+\sqrt{3})^2}. \]

$2000$ lines are set on the plane. Prove that among them there are two such that have the same number of different intersection points with the rest of the lines.

Points $A$ and $B$ are 10 units apart. Points $B$ and $C$ are 4 units apart. Points $C$ and $D$ are 3 units apart. If $A$ and $D$ are as close as possible, then the number of units between them is $\text{(A)}\ 0 \qquad \text{(B)}\ 3 \qquad \text{(C)}\ 9 \qquad \text{(D)}\ 11 \qquad \text{(E)}\ 17$

Consider a chess board, with the numbers $1$ through $64$ placed in the squares as in the diagram below. \[\begin{tabular}{| c | c | c | c | c | c | c | c |} \hline 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 \\ \hline 9 & 10 & 11 & 12 & 13 & 14 & 15 & 16 \\ \hline 17 & 18 & 19 & 20 & 21 & 22 & 23 & 24 \\ \hline 25 & 26 & 27 & 28 & 29 & 30 & 31 & 32 \\ \hline 33 & 34 & 35 & 36 & 37 & 38 & 39 & 40 \\ \hline 41 & 42 & 43 & 44 & 45 & 46 & 47 & 48 \\ \hline 49 & 50 & 51 & 52 & 53 & 54 & 55 & 56 \\ \hline 57 & 58 & 59 & 60 & 61 & 62 & 63 & 64 \\ \hline \end{tabular}\] Assume we have an infinite supply of knights. We place knights in the chess board squares such that no two knights attack one another and compute the sum of the numbers of the cells on which the knights are placed. What is the maximum sum that we can attain? Note. For any $2\times3$ or $3\times2$ rectangle that has the knight in its corner square, the knight can attack the square in the opposite corner.

Find minimum of $x+y+z$ where $x$, $y$ and $z$ are real numbers such that $x \geq 4$, $y \geq 5$, $z \geq 6$ and $x^2+y^2+z^2 \geq 90$

Find all functions $f(x)$ defined in the range $\left(-\frac\pi2,\frac\pi2\right)$ that are differentiable at $0$ and satisfy $$f(x)=\frac12\left(1+\frac1{\cos x}\right)f\left(\frac x2\right)$$ for every $x$ in the range $\left(-\frac\pi2,\frac\pi2\right)$. [i]L. Davidov[/i]

Let $f : \mathbb N \to \mathbb N$ be an injective function such that there exists a positive integer $k$ for which $f(n) \leq n^k$. Prove that there exist infinitely many primes $q$ such that the equation $f(x) \equiv 0 \pmod q$ has a solution in prime numbers.

Suppose $x$ is in the interval $[0,\pi/2]$ and $\log_{24\sin{x}}(24\cos{x})=\frac{3}{2}$. Find $24\cot^2{x}$.

On the parliament of Sikinia, for any two deputies, there is third deputy, which knows exactly one of the two. Every deputy belongs to one of the two ruling parties. Every day, he president tells a certain group of deputies to change the party that they belong, and all the deputies which which know at least one of the deputies of the group has to change their party too. Prove that, the president can reach any configuration of deputies between two parties.(The president himself isn't a member of the parliament of Sikinia). [I]Proposed by S. Berlov[/i]

Determine the least positive integer $n$ with the following property – for every 3-coloring of numbers $1,2,\ldots,n$ there are two (different) numbers $a,b$ of the same color such that $|a-b|$ is a perfect square.

Marisa has two identical cubical dice labeled with the numbers $\{1, 2, 3, 4, 5, 6\}$. However, the two dice are not fair, meaning that they can land on each face with different probability. Marisa rolls the two dice and calculates their sum. Given that the sum is $2$ with probability $0.04$, and $12$ with probability $0.01$, the maximum possible probability of the sum being $7$ is $p$. Compute $\lfloor 100p \rfloor$.

Find the greatest possible real value of $S$ and smallest possible value of $T$ such that for every triangle with sides $a,b,c$ $(a\le b\le c)$ to be true the inequalities: $$S\le\frac{(a+b+c)^2}{bc}\le T.$$

Mykhailo chose three distinct positive real numbers \( a, b, c \) and wrote the following numbers on the board: \[ a + b, \quad b + c, \quad c + a, \quad ab, \quad bc, \quad ca. \] What is the minimum possible number of distinct numbers that can be written on the board? [i]Proposed by Anton Trygub[/i]

Let positive integers $K$ and $d$ be given. Prove that there exists a positive integer $n$ and a sequence of $K$ positive integers $b_1,b_2,..., b_K$ such that the number $n$ is a $d$-digit palindrome in all number bases $b_1,b_2,..., b_K$.

Find all real solutions to $ x^3 \minus{} 3x^2 \minus{} 8x \plus{} 40 \minus{} 8\sqrt[4]{4x \plus{} 4} \equal{} 0$

Let $\dbinom{n}{k}$ denote the binomial coefficient $\frac{n!}{k!(n-k)!}$ , and $F_m$ be the $m^{th}$ Fibonacci number given by $F_1=F_2=1$ and $F_{m+2}=F_m+F_{m+1}$ for all $m\geq 1$. Show that $\sum \dbinom{n}{k}=F_{m+1}$ for all $m\geq 1$ . Here the above sum is over all pairs of integers $n\geq k\geq 0$ with $n+k=m$ .

The plane is divided into convex heptagons with diameters less than 1. Prove that an arbitrary disc with radius 200 intersects most than a billion of them.

Let $ABCD$ be a trapezoid with parallel sides $AB, CD$. $M,N$ lie on lines $AD, BC$ respectively such that $MN || AB$. Prove that $DC \cdot MA + AB \cdot MD = MN \cdot AD$.

Let $n \geq 2$ be an integer. Find the smallest positive integer $m$ for which the following holds: given $n$ points in the plane, no three on a line, there are $m$ lines such that no line passes through any of the given points, and for all points $X \neq Y$ there is a line with respect to which $X$ and $Y$ lie on opposite sides

If we write the sequence $\text{AAABABBB}$ along the perimeter of a circle, then every word of the length $3$ consisting of letters $A$ and $B$ (i.e. $\text{AAA}$, $\text{AAB}$, $\text{ABA}$, $\text{BAB}$, $\text{ABB}$, $\text{BBB}$, $\text{BBA}$, $\text{BAA}$) occurs exactly once on the perimeter. Decide whether it is possible to write a sequence of letters from a $k$-element alphabet along the perimeter of a circle in such a way that every word of the length $l$ (i.e. an ordered $l$-tuple of letters) occurs exactly once on the perimeter.

Let $x, y, z$ be real numbers satisfying $x+y+z=0$ and $x^2+y^2+z^2=6$. Find the maximum value of \[ |(x-y)(y-z)(z-x) | \]

Find the largest value that the expression can take $a^3b + b^3a$ where $a, b$ are non-negative real numbers, with $a + b = 3$.