Let $K$ be a point in the interior of an acute triangle $ABC$ and $ARBPCQ$ be a convex hexagon whose vertices lie on the circumcircle $\Gamma$ of the triangle $ABC.$ Let $A_1$ be the second point where the circle passing through $K$ and tangent to $\Gamma$ at $A$ intersects the line $AP.$ The points $B_1$ and $C_1$ are defined similarly. Prove that \[ \min\left\{\frac{PA_1}{AA_1}, \: \frac{QB_1}{BB_1}, \: \frac{RC_1}{CC_1}\right\} \leq 1.\]

Consider $v,w$ two distinct non-zero complex numbers. Prove that \[|zw+\bar{w}|\le |zv+\bar{v}|,\] for any $z\in\mathbb{C},|z|=1$, if and only if there exists $k\in [-1,1]$ such that $w=kv$. [i]Dan Marinescu[/i]

Rachel writes down a simple inequality: one $2$-digit number is greater than another. Matt is sitting across from Rachel and peeking at her paper. If Matt, reading upside down, sees a valid inequality between two $2$-digit numbers, compute the number of different inequalities that Rachel could have written. Assume that each digit is either a $1, 6, 8$, or $9$.

Let $g(k)$ be the number of partitions of a $k$-element set $M$, i.e., the number of families $\{ A_1,A_2,\ldots ,A_s\}$ of nonempty subsets of $M$ such that $A_i\cap A_j=\emptyset$ for $i\not= j$ and $\bigcup_{i=1}^n A_i=M$. Prove that, for every $n$, \[n^n\le g(2n)\le (2n)^{2n}\]

Find all integers $n$, $n \ge 1$, such that $n \cdot 2^{n+1}+1$ is a perfect square.

Suppose there are $4n$ line segments of unit length inside a circle of radius $n$. Furthermore, a straight line $L$ is given. Prove that there exists a straight line $L'$ that is either parallel or perpendicular to $L$ and that $L'$ cuts at least two of the given line segments.

Let $ n$ be the number of integer values of $ x$ such that $ P \equal{} x^4 \plus{} 6x^3 \plus{} 11x^2 \plus{} 3x \plus{} 31$ is the square of an integer. Then $ n$ is: $ \textbf{(A)}\ 4 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 1 \qquad \textbf{(E)}\ 0$

A [i]triangulation[/i] $ \mathcal{T}$ of a polygon $ P$ is a finite collection of triangles whose union is $ P,$ and such that the intersection of any two triangles is either empty, or a shared vertex, or a shared side. Moreover, each side of $ P$ is a side of exactly one triangle in $ \mathcal{T}.$ Say that $ \mathcal{T}$ is [i]admissible[/i] if every internal vertex is shared by $ 6$ or more triangles. For example [asy] size(100); dot(dir(-100)^^dir(230)^^dir(160)^^dir(100)^^dir(50)^^dir(5)^^dir(-55)); draw(dir(-100)--dir(230)--dir(160)--dir(100)--dir(50)--dir(5)--dir(-55)--cycle); pair A = (0,-0.25); dot(A); draw(A--dir(-100)^^A--dir(230)^^A--dir(160)^^A--dir(100)^^A--dir(5)^^A--dir(-55)^^dir(5)--dir(100)); [/asy] Prove that there is an integer $ M_n,$ depending only on $ n,$ such that any admissible triangulation of a polygon $ P$ with $ n$ sides has at most $ M_n$ triangles.

Let $a,b,c$ positive reals such that $a+b+c=3$. Show that following expression's minimum value is $2$. $$\frac{\sqrt a +\sqrt b +\sqrt c}{ab+bc+ca} + \frac{1}{1+2\sqrt {ab}} + \frac {1}{1+ 2\sqrt {bc}} + \frac{1}{1+ 2\sqrt {ca}}$$

Let's consider the inequality $ a^3\plus{}b^3\plus{}c^3<k(a\plus{}b\plus{}c)(ab\plus{}bc\plus{}ca)$ where $ a,b,c$ are the sides of a triangle and $ k$ a real number. [b]a)[/b] Prove the inequality for $ k\equal{}1$. [b]b) [/b]Find the smallest value of $ k$ such that the inequality holds for all triangles.

Find the number of all integer-sided [i]isosceles obtuse-angled[/i] triangles with perimeter $ 2008$. [16 points out of 100 for the 6 problems]

Let $\mathcal{T}$ be the set of ordered triples $(x,y,z)$ of nonnegative real numbers that lie in the plane $x+y+z=1.$ Let us say that $(x,y,z)$ supports $(a,b,c)$ when exactly two of the following are true: $x\ge a, y\ge b, z\ge c.$ Let $\mathcal{S}$ consist of those triples in $\mathcal{T}$ that support $\left(\frac 12,\frac 13,\frac 16\right).$ The area of $\mathcal{S}$ divided by the area of $\mathcal{T}$ is $m/n,$ where $m$ and $n$ are relatively prime positive integers, find $m+n.$

Let $x,y,z$ be positive real numbers with $x+y+z \ge 3$. Prove that $\frac{1}{x+y+z^2} + \frac{1}{y+z+x^2} + \frac{1}{z+x+y^2} \le 1$ When does equality hold? (Karl Czakler)

Prove that for any four real numbers $a$, $b$, $c$, $d$, the inequality \[ \left(a-b\right)\left(b-c\right)\left(c-d\right)\left(d-a\right)+\left(a-c\right)^2\left(b-d\right)^2\geq 0 \] holds. [hide="comment"]This is inequality (350) in: Mihai Onucu Drimbe, [i]Inegalitati, idei si metode[/i], Zalau: Gil, 2003. Posted here only for the sake of completeness; in fact, it is more or less the same as http://www.mathlinks.ro/Forum/viewtopic.php?t=3152 .[/hide] Darij

Let $ABCD$ be a quadrilateral inscribed in a circle. Suppose $AB=\sqrt{2+\sqrt{2}}$ and $AB$ subtends $135$ degrees at center of circle . Find the maximum possible area of $ABCD$.

Let $n \in N$ such that $1 + 2 + ... + n$ is divisible by $3$. Integers $a_1\ge a_2\ge a_3\ge 2$ have sum $n$ and they satisfy $1 + 2 + ... + a_1\le \frac{1}{3}( 1 + 2 + ... + n ) $ and $1 + 2 + ... + (a_1+ a_2) \le \frac{2}{3}( 1 + 2 + ... + n )$. Prove that there is a partition of $\{ 1 , 2 , ... , n\}$ in three subsets $A_1, A_2, A_3$ with cardinals $| A_i| = a_i, i = 1 , 2 , 3$, and with equal sums of their elements .

Let $ x_1,...,x_n$ be positive real numbers. Prove that: $ \displaystyle\sum_{k\equal{}1}^{n}x_k\plus{}\sqrt{\displaystyle\sum_{k\equal{}1}^{n}x_k^2} \le \frac{n\plus{}\sqrt{n}}{n^2} \left( \displaystyle\sum_{k\equal{}1}^{n} \frac{1}{x_k} \right) \left( \displaystyle\sum_{k\equal{}1}^{n} x_k^2 \right).$

Let $a$, $b$, $c$, $d$ be real numbers such that $b-d \ge 5$ and all zeros $x_1, x_2, x_3,$ and $x_4$ of the polynomial $P(x)=x^4+ax^3+bx^2+cx+d$ are real. Find the smallest value the product $(x_1^2+1)(x_2^2+1)(x_3^2+1)(x_4^2+1)$ can take.

Find all real $ a$, such that there exist a function $ f: \mathbb{R}\rightarrow\mathbb{R}$ satisfying the following inequality: \[ x\plus{}af(y)\leq y\plus{}f(f(x)) \] for all $ x,y\in\mathbb{R}$

Let $a$ and $b$ be nonnegative real numbers. Prove that \[\sqrt{2}\left(\sqrt{a(a+b)^3}+b\sqrt{a^2+b^2}\right) \le 3(a^2+b^2).\]

Let $a,b,c,d$ be four non-negative numbers satisfying \[ a+b+c+d=1. \] Prove the inequality \[ a \cdot b \cdot c + b \cdot c \cdot d + c \cdot d \cdot a + d \cdot a \cdot b \leq \frac{1}{27} + \frac{176}{27} \cdot a \cdot b \cdot c \cdot d. \]

Let $a,b$ and $c$ be positive real numbers satisfying $abc=1$. Prove that \[\dfrac{1}{a^3+2b^2+2b+4}+\dfrac{1}{b^3+2c^2+2c+4}+\dfrac{1}{c^3+2a^2+2a+4}\leq \dfrac13.\]

Show that if $a \ge b \ge c \ge 0$ then $$a^2b(a - b) + b^2c(b - c) + c^2a(c - a) \ge 0.$$

Let $n \geq 2$ be a positive integer. Show that there are exactly $2^{n-3}n(n-1)$ $n$-tuples of integers $(a_1,a_2,\dots,a_n)$, which satisfy the conditions: (i) $a_1=0$; (ii) for each $m$, $2 \leq m \leq n$, there is an index in $m$, $1 \leq i_m <m$, such that $\left|a_{i_m}-a_m\right|\leq 1$; (iii) the $n$-tuple $(a_1,a_2,\dots,a_n)$ contains exactly $n-1$ different numbers.

Find the smallest and largest values of the expression $$\frac{ \left| ...\left| |x-1|-1\right| ... -1\right| +1}{\left| |x-2|-1 \right|+1}$$ (The number of units in the numerator of a fraction, including the last one, is eleven, of which ten are under the absolute value sign.)