Prove that for every natural number $ n \geq 2 $ the inequality holds $$ \log_n 2 \cdot \log_n 4 \cdot \log_n 6 \ldots \log_n (2n - 2) \leq 1.$$

Let $ d$ be the sum of the lengths of all the diagonals of a plane convex polygon with $ n$ vertices (where $ n>3$). Let $ p$ be its perimeter. Prove that: \[ n\minus{}3<{2d\over p}<\Bigl[{n\over2}\Bigr]\cdot\Bigl[{n\plus{}1\over 2}\Bigr]\minus{}2,\] where $ [x]$ denotes the greatest integer not exceeding $ x$.

Let $ p$ and $ q$ be two consecutive terms of the sequence of odd primes. The number of positive divisor of $ p \plus{} q$, at least $\textbf{(A)}\ 2 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 4 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ 6$

Let $ ABCD $ be an inscriptible quadrilateral and $ M $ be a point on its circumcircle, distinct from its vertices. Let $ H_1,H_2,H_3,H_4 $ be the orthocenters of $ MAB,MBC, MCD, $ respectively, $ MDA, $ and $ E,F, $ the midpoints of the segments $ AB, $ respectivley, $ CD. $ Prove that: [b]a)[/b] $ H_1H_2H_3H_4 $ is a parallelogram. [b]b)[/b] $ H_1H_3=2\cdot EF. $

An acute-angle non-isosceles triangle $ ABC $ is given. The point $ H $ is its orthocenter, the points $ O $ and $ I $ are the centers of its circumscribed and inscribed circles, respectively. The circumcircle of the triangle $ OIH $ passes through the vertex $ A $. Prove that one of the angles of the triangle is $ 60^\circ $.

Let $x, y$, and $z$ be three not necessarily real numbers that satisfy the following system of equations: $x^3 -4 = (2y +1)^2$ $y^3 -4 = (2z +1)^2$ $z^3 -4 = (2x +1)^2$. Find the greatest possible real value of $(x -1)(y -1)(z -1)$.

Let $ABC$ be an acute-angled triangle whose inscribed circle touches $AB$ and $AC$ at $D$ and $E$ respectively. Let $X$ and $Y$ be the points of intersection of the bisectors of the angles $\angle ACB$ and $\angle ABC$ with the line $DE$ and let $Z$ be the midpoint of $BC$. Prove that the triangle $XYZ$ is equilateral if and only if $\angle A = 60^\circ$.

What is the smallest possible natural number $n$ for which the equation $x^2 -nx + 2014 = 0$ has integer roots?

Three diagonals of a regular $n$-gon prism intersect at an interior point $O$. Show that $O$ is the center of the prism. (The diagonal of the prism is a segment joining two vertices not lying on the same face of the prism.)

Alexis imagines a $2008\times 2008$ grid of integers arranged sequentially in the following way: \[\begin{array}{r@{\hspace{20pt}}r@{\hspace{20pt}}r@{\hspace{20pt}}r@{\hspace{20pt}}r}1,&2,&3,&\ldots,&2008\\2009,&2010,&2011,&\ldots,&4026\\4017,&4018,&4019,&\ldots,&6024\\\vdots&&&&\vdots\\2008^2-2008+1,&2008^2-2008+2,&2008^2-2008+3,&\ldots,&2008^2\end{array}\] She picks one number from each row so that no two numbers she picks are in the same column. She them proceeds to add them together and finds that $S$ is the sum. Next, she picks $2008$ of the numbers that are distinct from the $2008$ she picked the first time. Again she picks exactly one number from each row and column, and again the sum of all $2008$ numbers is $S$. Find the remainder when $S$ is divided by $2008$.

At a football tournament, each team plays with each of the remaining teams, winning three points for the win, one point for the draw score and zero points for the defeat. At the end of the tournament it turned out that the sum of the winning points of all teams was $50$. (a) How many teams participated in this tournament? (b) How big is the difference between the team with the highest number and the number of points won?

Let $ABCD$ be a convex quadrilateral whose diagonals $AC$ and $BD$ intersect in a point $P$. Prove that \[\frac{AP}{PC}=\frac{\cot \angle BAC + \cot \angle DAC}{\cot \angle BCA + \cot \angle DCA}\]

Find all functions $f : \Bbb{Q}_{>0}\to \Bbb{Z}_{>0}$ such that $$f(xy)\cdot \gcd\left( f(x)f(y), f(\frac{1}{x})f(\frac{1}{y})\right) = xyf(\frac{1}{x})f(\frac{1}{y}),$$ for all $x, y \in \Bbb{Q}_{>0,}$ where $\gcd(a, b)$ denotes the greatest common divisor of $a$ and $b.$

Suppose that $20^{21} = 2^a5^b = 4^c5^d = 8^e5^f$ for positive integers $a,b,c,d,e,$ and $f$. Find $\frac{100bdf}{ace}$. [i]Proposed by Andrew Wu[/i]

Let $ n\geq 3 $ be an integer and let $ \mathcal{S} \subset \{1,2,\ldots, n^3\} $ be a set with $ 3n^2 $ elements. Prove that there exist nine distinct numbers $ a_1,a_2,\ldots,a_9 \in \mathcal{S} $ such that the following system has a solution in nonzero integers: \begin{eqnarray*} a_1x + a_2y +a_3 z &=& 0 \\ a_4x + a_5 y + a_6 z &=& 0 \\ a_7x + a_8y + a_9z &=& 0. \end{eqnarray*} [i]Marius Cavachi[/i]

Basketball star Shanille O'Keal's team statistician keeps track of the number, $S(N),$ of successful free throws she has made in her first $N$ attempts of the season. Early in the season, $S(N)$ was less than 80% of $N,$ but by the end of the season, $S(N)$ was more than 80% of $N.$ Was there necessarily a moment in between when $S(N)$ was exactly 80% of $N$?

Let $C_{1}$ and $C_{2}$ be concentric circles, with $C_{2}$ in the interior of $C_{1}$. From a point $A$ on $C_{1}$, draw the tangent $AB$ to $C_{2}$ $(B \in C_{2})$. Let $C$ be the second point of intersection of $AB$ and $C_{1}$,and let $D$ be the midpoint of $AB$. A line passing through $A$ intersects $C_{2}$ at $E$ and $F$ in such a way that the perpendicular bisectors of $DE$ and $CF$ intersect at a point $M$ on $AB$. Find, with proof, the ratio $AM/MC$. This question is taken from Mathematical Olympiad Challenges , the 9-th exercise in 1.3 Power of a Point.

There exist $4$ positive integers $a,b,c,d$ such that $abcd \neq 1$ and each pair of them have a GCD of $1$. Two functions $f,g : \mathbb{N} \rightarrow \{0,1\}$ are multiplicative functions such that for each positive integer $n$ we have : $$f(an+b)=g(cn+d)$$ Prove that at least one of the followings hold. $i)$ for each positive integer $n$ we have $f(an+b)=g(cn+d)=0$ $ii)$ There exists a positive integer $k$ such that for all $n$ where $(n,k)=1$ we have $g(n)=f(n)=1$ (Function $f$ is multiplicative if for any natural numbers $a,b$ we have $f(ab)=f(a)f(b)$) Proposed by [i]Navid Safaii[/i]

A polygon in the plane (with no self-intersections) is called $\emph{equitable}$ if every line passing through the origin divides the polygon into two (possibly disconnected) regions of equal area. Does there exist an equitable polygon which is not centrally symmetric about the origin? (A polygon is centrally symmetric about the origin if a $180$-degree rotation about the origin sends the polygon to itself.)

The numbers 1, 2, 3, 4, 5 are to be arranged in a circle. An arrangement is [i]bad[/i] if it is not true that for every $n$ from $1$ to $15$ one can find a subset of the numbers that appear consecutively on the circle that sum to $n$. Arrangements that differ only by a rotation or a reflection are considered the same. How many different bad arrangements are there? $ \textbf {(A) } 1 \qquad \textbf {(B) } 2 \qquad \textbf {(C) } 3 \qquad \textbf {(D) } 4 \qquad \textbf {(E) } 5 $

I'll post some nice combinatorics problems here, taken from the wonderful training book "Les olympiades de mathmatiques" (in French) written by Tarik Belhaj Soulami. Here goes the first one: Let $\mathbb{I}$ be a non-empty subset of $\mathbb{Z}$ and let $f$ and $g$ be two functions defined on $\mathbb{I}$. Let $m$ be the number of pairs $(x,\;y)$ for which $f(x) = g(y)$, let $n$ be the number of pairs $(x,\;y)$ for which $f(x) = f(y)$ and let $k$ be the number of pairs $(x,\;y)$ for which $g(x) = g(y)$. Show that \[2m \leq n + k.\]

Find all pairs $(a,b)$ of integers satisfying: there exists an integer $d \ge 2$ such that $a^n + b^n +1$ is divisible by $d$ for all positive integers $n$.

One rainy afternoon you write the number $1$ once, the number $2$ twice, the number $3$ three times, and so forth until you have written the number $99$ ninety-nine times. What is the $2005$ th digit that you write?

Let $A=\{1,2,3,\ldots,40\}$. Find the least positive integer $k$ for which it is possible to partition $A$ into $k$ disjoint subsets with the property that if $a,b,c$ (not necessarily distinct) are in the same subset, then $a\ne b+c$.

All squares of a $ 20\times 20$ table are empty. Misha* and Sasha** in turn put chips in free squares (Misha* begins). The player after whose move there are four chips on the intersection of two rows and two columns wins. Which of the players has a winning strategy? [i]Proposed by A. Golovanov[/i] [b]US Name Conversions: [/b] [i]Misha*: Naoki Sasha**: Richard[/i]