2008 persons take part in a programming contest. In one round, the 2008 programmers are divided into two groups. Find the minimum number of groups such that every two programmers ever be in the same group.

Find the value of real parameter $ a$ such that $ 2$ is the smallest integer solution of \[ \frac{x\plus{}\log_2 (2^x\minus{}3a)}{1\plus{}\log_2 a} >2.\]

Define $S_n=\sum_{j,k=1}^{n} \frac{1}{\sqrt{j^2+k^2}}$. Find a positive constant $C$ such that the inequality $n\le S_n \le Cn$ holds for all $n \ge 3$. (Note. The smaller $C$, the better the solution.)

For real numbers $ x_1, x_2, \dots, x_n $ and $ y_1, y_2, \dots, y_n $ , the inequalities hold $ x_1 \geq x_2 \geq \ldots \geq x_n> 0 $ and $$ y_1 \geq x_1, ~ y_1y_2 \geq x_1x_2, ~ \dots, ~ y_1y_2 \dots y_n \geq x_1x_2 \dots x_n. $$ Prove that $ ny_1 + (n-1) y_2 + \dots + y_n \geq x_1 + 2x_2 + \dots + nx_n $.

Consider an infinite sequence of positive integers in which each positive integer occurs exactly once. Let $\{a_n\}, n\ge 1$ be such a sequence. We call it [i]consistent [/i] if, for an arbitrary natural $k$ and every natural $n ,m$ such that $a_n <a_m$, the inequality $a_{kn} <a _{km}$ also holds. For example, the sequence $a_n = n$ is consistent . a) Prove that there are consistent sequences other than $a_n = n$. b) Are there consistent sequences for which $a_n \ne n, n\ge 2$ ? c) Are there consistent sequences for which $a n \ne n, n\ge 1$ ?

Let $P$ be the set of all $2012$ tuples $(x_1, x_2, \dots, x_{2012})$, where $x_i \in \{1,2,\dots 20\}$ for each $1\leq i \leq 2012$. The set $A \subset P$ is said to be decreasing if for each $(x_1,x_2,\dots ,x_{2012} ) \in A$ any $(y_1,y_2,\dots, y_{2012})$ satisfying $y_i \leq x_i (1\leq i \leq 2012)$ also belongs to $A$. The set $B \subset P$ is said to be increasing if for each $(x_1,x_2,\dots ,x_{2012} ) \in B$ any $(y_1,y_2,\dots, y_{2012})$ satisfying $y_i \geq x_i (1\leq i \leq 2012)$ also belongs to $B$. Find the maximum possible value of $f(A,B)= \dfrac {|A\cap B|}{|A|\cdot |B|}$, where $A$ and $B$ are nonempty decreasing and increasing sets ($\mid \cdot \mid$ denotes the number of elements of the set).

For a positive integer $n$, we define the function $f_n(x)=\sum_{k=1}^n |x-k|$ for all real numbers $x$. For any two-digit number $n$ (in decimal representation), determine the set of solutions $\mathbb{L}_n$ of the inequality $f_n(x)<41$. [i](41st Austrian Mathematical Olympiad, National Competition, part 1, Problem 2)[/i]

Let $a$ and $b$ be real numbers satisfying $2(\sin a + \cos a) \sin b = 3 - \cos b$. Find $3 \tan^2a+4\tan^2 b$.

Prove that there exists a constant $K$ such that the following inequality holds for any sequence of positive numbers $a_1 , a_2 , a_3 , \ldots:$ $$\sum_{n=1}^{\infty} \frac{n}{a_1 + a_2 +\ldots + a_n } \leq K \sum_{n=1}^{\infty} \frac{1}{a_{n}}.$$

[b]Q[/b] Let $p,q,r$ be non negative reals such that $pqr=1$. Find the maximum value for the expression $$\sum_{cyc} p[r^{4}+q^{4}-p^{4}-p]$$ [i]Proposed by Aritra12[/i]

Is it possible to partition $3$-dimensional Euclidean space into $1979$ mutually isometric subsets?

Let $a, b, c $ be the side lengths of a right angled triangle with c > a, b. Show that $$3<\frac{c^3-a^3-b^3}{c(c-a)(c-b)}\leq \sqrt{2}+2.$$

Let $a$, $b$, and $c$ be positive numbers satisfying $abc=1$. Show that \[\frac{a^3}{a^3+2}+\frac{b^3}{b^3+2}+\frac{c^3}{c^3+2}\ge1\text{ and }\frac1{a^3+2}+\frac1{b^3+2}+\frac1{c^3+2}\le1\]

Define a [i]beautiful number[/i] to be an integer of the form $a^n$, where $a\in\{3,4,5,6\}$ and $n$ is a positive integer. Prove that each integer greater than $2$ can be expressed as the sum of pairwise distinct beautiful numbers. [i]Proposed by Matthew Babbitt[/i]

Let $ 0 \leq x \leq 2\pi$. Prove the inequality $ \sqrt {\frac {\sin^{2}x}{1 + \cos^{2}x}} + \sqrt {\frac {\cos^{2}x}{1 + \sin^{2}x}}\geq 1 $

Which is greater $$\sqrt{n}^{\sqrt{n+1}} \;\; \; \text{or}\;\;\; \sqrt{n+1}^{\sqrt{n}}$$ where $n>8?$

Find all a positive integers $a$ and $b$, such that $$\frac{a^b+b^a}{a^a-b^b}$$ is an integer

Show that, if $a,b,...,n$ are distinct natural numbers, none divisible by any primes greater than $3$, then $$\frac{1}{a}+\frac{1}{b}+...+ \frac{1}{n}< 3$$

$a$, $b$, $c$ are real numbers. Show that $\min((a-b)^2,(b-c)^2,(c-a)^2)\leq \frac{a^2+b^2+c^2}{2}$

Let $x,y,z$ be real numbers such that $0<x,y,z<1$. Find the minimum value of: $$\frac {xyz(x+y+z)+(xy+yz+zx)(1-xyz)}{xyz\sqrt {1-xyz}}$$

$\Delta oa_1b_1$ is isosceles with $\angle a_1ob_1 = 36^\circ$. Construct $a_2,b_2,a_3,b_3,...$ as below, with $|oa_{i+1}| = |a_ib_i|$ and $\angle a_iob_i = 36^\circ$, Call the summed area of the first $k$ triangles $A_k$. Let $S$ be the area of the isocseles triangle, drawn in - - -, with top angle $108^\circ$ and $|oc|=|od|=|oa_1|$, going through the points $b_2$ and $a_2$ as shown on the picture. (yes, $cd$ is parallel to $a_1b_1$ there) Show $A_k < S$ for every positive integer $k$. [img]http://www.mathlinks.ro/Forum/album_pic.php?pic_id=284[/img]

Denote $T$ the Toricelli point of the triangle $ABC$. Prove that $$AB^2 \times BC^2 \times CA^2 \geq 3(TA^2\times TB + TB^2 \times TC + TC^2 \times TA)(TA\times TB^2 + TB \times TC^2 + TC \times TA^2)$$

Prove that if $a,b,c$ are positive numbers with $abc=1$, then \[\frac{a}{b} +\frac{b}{c} + \frac{c}{a} \ge a + b + c. \]

Show that if $t_1 , t_2, t_3, t_4, t_5$ are real numbers, then $$\sum_{j=1}^{5} (1-t_j )\exp \left( \sum_{k=1}^{j} t_k \right) \leq e^{e^{e^{e}}}.$$

Given $1991$ distinct positive real numbers, the product of any ten of these numbers is always greater than $1$. Prove that the product of all $1991$ numbers is also greater than $1$.