Fix $n$. Given $n$ points on Cartesian plane such that no pair of points forms a segment that is parallel to either axes, a pair of points is said to be good if their segment gradient is positive. For which $k$ can there exist a set of $n$ points with exactly $k$ good pairs? [i](Proposed by Ivan Chan Kai Chin)[/i]

Find all composite numbers $n$ having the property that each proper divisor $d$ of $n$ has $n-20 \le d \le n-12$.

Find all prime number $p$, such that there exist an infinite number of positive integer $n$ satisfying the following condition: $p|n^{ n+1}+(n+1)^n.$ (September 29, 2012, Hohhot)

Find all functions $ f: \mathbb{R}\longrightarrow \mathbb{R}$ such that \[f(x\plus{}y)\plus{}f(y\plus{}z)\plus{}f(z\plus{}x)\ge 3f(x\plus{}2y\plus{}3z)\] for all $x, y, z \in \mathbb R$.

Find at least one polynomial $P(x)$ of degree 2001 such that $P(x)+P(1- x)=1$ holds for all real numbers $x$.

Let $ x_1, x_2,\ldots , x_n$ be positive real numbers such that $ x_1x_2\cdots x_n \equal{} 1$. Prove that \[\sum_{i \equal{} 1}^n \frac {1}{n \minus{} 1 \plus{} x_i}\le 1.\]

Point $D$ on the side $BC$ of the acute triangle $ABC$ is chosen so that $AD = AC$. Let $P$ and $Q$ be the feet of the perpendiculars from $C$ and $D$ on the side $AB$, respectively. Suppose that $AP^2 + 3BP^2 = AQ^2 + 3BQ^2$. Determine the measure of angle $\angle ABC$.

Let $\mathbb{Z}_{\ge 0}$ be the set of all nonnegative integers. Find all the functions $f: \mathbb{Z}_{\ge 0} \rightarrow \mathbb{Z}_{\ge 0} $ satisfying the relation \[ f(f(f(n))) = f(n+1 ) +1 \] for all $ n\in \mathbb{Z}_{\ge 0}$.

There is a central train station in point $O$, which is connected to other train stations $A_1, A_2, \ldots, A_8$ with tracks. There is also a track between stations $A_i$ and $A_{i+1}$ for each $i$ from $1$ to $8$ (here $A_9 = A_1$). The length of each track $A_iA_{i+1}$ is equal to $1$, and the length of each track $OA_i$ is equal to $2$, for each $i$ from $1$ to $8$. There are also $8$ trains $B_1, B_2, \ldots, B_8$, with speeds $1, 2, \ldots, 8$ correspondently. Trains can move only by the tracks above, in both directions. No time is wasted on changing directions. If two or more trains meet at some point, they will move together from now on, with the speed equal to that of the fastest of them. Is it possible to arrange trains into stations $A_1, A_2, \ldots, A_8$ (each station has to contain one train initially), and to organize their movement in such a way, that all trains arrive at $O$ in time $t < \frac{1}{2}$? [i](Proposed by Bogdan Rublov)[/i]

Find the largest possible real number $C$ such that for all pairs $(x, y)$ of real numbers with $x \ne y$ and $xy = 2$, $$\frac{((x + y)^2- 6))(x-y)^2 + 8))}{(x-y)^2} \ge C.$$ Also determine for which pairs $(x, y)$ equality holds.

Let $ ABC$ be a triangle, line $ l$ cuts its sides $ BC,CA,AB$ at $ D,E,F$, respectively. Denote by $ O_{1},O_{2},O_{3}$ the circumcenters of triangle $ AEF,BFD,CDE$, respectively. Prove that the orthocenter of triangle $ O_{1}O_{2}O_{3}$ lies on line $ l$.

Find the smallest positive integer $N$ of two or more digits that has the following property: If we insert any non-null digit $d$ between any two adjacent digits of $N$ we obtain a number that is a multiple of $d$.

Find all functions $f : \mathbb{R} \rightarrow \mathbb{R}$ such that \[f(x+y) + f(x)f(y) = f(xy) + (y+1)f(x) + (x+1)f(y)\] for all $x,y \in \mathbb{R}$.

Let $P$ be a set of $7$ different prime numbers and $C$ a set of $28$ different composite numbers each of which is a product of two (not necessarily different) numbers from $P$. The set $C$ is divided into $7$ disjoint four-element subsets such that each of the numbers in one set has a common prime divisor with at least two other numbers in that set. How many such partitions of $C$ are there ?

Determine whether does exists a triangle with area $2004$ with his sides positive integers.

Let $A=\{1,2,3,4\}$, and $f$ and $g$ be randomly chosen (not necessarily distinct) functions from $A$ to $A$. The probability that the range of $f$ and the range of $g$ are disjoint is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m$.

$ 1990-1980+1970-1960+\cdots-20+10 = $ $ \text{(A)}\ -990\qquad\text{(B)}\ -10\qquad\text{(C)}\ 990\qquad\text{(D)}\ 1000\qquad\text{(E)}\ 1990 $

Consider $\vartriangle ABC$ and a point $M$ inside it. We move $M$ parallel to $BC$ until $M$ meets $CA$, then parallel to $AB$ until it meets $BC$, then parallel to $CA$, and so on. Prove that $M$ traverses a self-intersecting closed broken line and find the number of its straight segments.

Suppose $p$ is a prime number and $x, y, z$ are integers satisfying $0 < x < y < z <p$. If $x^3, y^3, z^3$ have equal remainders when divided by $p$, prove that $x ^ 2 + y ^ 2 + z ^ 2$ is divisible by $x + y + z$.

Let $a,b,c > 0$ be real numbers with the sum equal to $3$. Show that: $$\frac{a+3}{3a+bc}+\frac{b+3}{3b+ca}+\frac{c+3}{3c+ab} \ge 3$$

Consider a sequence of positive integers $a_1,a_2,a_3,...$ such that $a_1>1$ and $$a_{n+1}=\frac{a_n}{p}+p,$$ where $p$ is the greatest prime factor of $a_n$. Prove that for any choice of $a_1$, the sequence $a_1,a_2,a_3,...$ has an infinite terms that are equal between them.

The [i]tower function of twos[/i] is defined recursively as follows: $ T(1) \equal{} 2$ and $ T(n \plus{} 1) \equal{} 2^{T(n)}$ for $ n\ge1$. Let $ A \equal{} (T(2009))^{T(2009)}$ and $ B \equal{} (T(2009))^A$. What is the largest integer $ k$ such that \[ \underbrace{\log_2\log_2\log_2\ldots\log_2B}_{k\text{ times}} \]is defined? $ \textbf{(A)}\ 2009\qquad \textbf{(B)}\ 2010\qquad \textbf{(C)}\ 2011\qquad \textbf{(D)}\ 2012\qquad \textbf{(E)}\ 2013$

Let $G$ is a graph and $x$ is a vertex of $G$. Define the transformation $\varphi_{x}$ over $G$ as deleting all incident edges with respect of $x$ and drawing the edges $xy$ such that $y\in G$ and $y$ is not connected with $x$ with edge in the beginning of the transformation. A graph $H$ is called $G-$[i]attainable[/i] if there exists a sequece of such transformations which transforms $G$ in $H.$ Let $n\in\mathbb{N}$ and $4|n.$ Prove that for each graph $G$ with $4n$ vertices and $n$ edges there exists $G-$[i]attainable[/i] graph with at least $9n^{2}/4$ triangles.

Solve \[ \left\{ \begin{array}{l} \log_2 x\plus{}\log_4 y\plus{}\log_4 z\equal{}2 \\ \log_3 y\plus{}\log_9 z\plus{}\log_9 x\equal{}2 \\ \log_4 z\plus{}\log_{16} x\plus{}\log_{16} y\equal{}2 \\ \end{array} \right.\]

Let $(x+1)^p(x-3)^q=x^n+a_1x^{n-1}+\ldots+a_{n-1}x+a_n$, where $p,q$ are positive integers. (a) Prove that if $a_1=a_2$, then $3n$ is a perfect square. (b) Prove that there exists infinitely many pairs $(p,q)$ for which $a_1=a_2$.