Find all positive integers $a, b, c$ such that $ab + 1$, $bc + 1$, and $ca + 1$ are all equal to factorials of some positive integers. Proposed by [i]Nikola Velov, Macedonia[/i]

Prove that there doesn't exist a function $f:\mathbb{N} \rightarrow \mathbb{N}$, such that $(m+f(n))^2 \geq 3f(m)^2+n^2$ for all $m, n \in \mathbb{N}$.

Let $n\in \Bbb{N}, n \geq 4.$ Determine all sets $ A = \{a_1, a_2, . . . , a_n\} \subset \Bbb{N}$ containing $2015$ and having the property that $ |a_i - a_j|$ is prime, for all distinct $i, j\in \{1, 2, . . . , n\}.$

Higher Secondary P2 Let $g$ be a function from the set of ordered pairs of real numbers to the same set such that $g(x, y)=-g(y, x)$ for all real numbers $x$ and $y$. Find a real number $r$ such that $g(x, x)=r$ for all real numbers $x$.

Prove that $\frac1{2002}<\frac12\cdot\frac34\cdot\frac56\cdots\frac{2001}{2002}<\frac1{44}$.

Let $\theta$ be a positive real number. Show that if $k\in \mathbb{N}$ and both $\cosh k \theta$ and $\cosh(k+1) \theta$ are rational, then so is $\cosh \theta$.

Compute the remainder when $\binom{205}{101}$ is divded by $101 \times 103$. [i]Proposed by Brandon Xu[/i]

Sa se determine functia $f: [0,\infty)\rightarrow\mathbb{R}$, astfel incat \[f(x)+\sqrt{f^{2}([x])+f^{2}(\{x\})}=x,\] oricare ar fi $x\in [0,\infty).$

Let $w$ be a circle and $AB$ a line not intersecting $w$. Given a point $P_{0}$ on $w$, define the sequence $P_{0},P_{1},\ldots $ as follows: $P_{n\plus{}1}$ is the second intersection with $w$ of the line passing through $B$ and the second intersection of the line $AP_{n}$ with $w$. Prove that for a positive integer $k$, if $P_{0}\equal{}P_{k}$ for some choice of $P_{0}$, then $P_{0}\equal{}P_{k}$ for any choice of $P_{0}$. [i]Gheorge Eckstein[/i]

If $a, b, c \ge 4$ are integers, not all equal, and $4abc = (a+3)(b+3)(c+3)$ then what is the value of $a+b+c$ ?

Can $29$ boys and $31$ girls be lined up holding hands so no one is holding hands with two girls?

In an infinite arithmetic progression of positive integers there are two integers with the same sum of digits. Will there necessarily be one more integer in the progression with the same sum of digits? [i]Proposed by A. Shapovalov[/i]

Given two non-constant polynomials $P(x),Q(x)$ with real coefficients. For a real number $a$, we define $$P_a= \{z \in C : P(z) = a\}, Q_a =\{z \in C : Q(z) = a\}$$ Denote by $K$ the set of real numbers $a$ such that $P_a = Q_a$. Suppose that the set $K$ contains at least two elements, prove that $P(x) = Q(x)$.

Let $S = \{1,2,3,4,5,6,7\}$. Compute the number of sets of subsets $T = \{A, B, C\}$ with $A, B, C \in S$ such that $A \cup B \cup C = S$, $(A \cap C) \cup (B \cap C) = \emptyset$, and no subset contains two consecutive integers.

Find all functions $f:\mathbb{R} \to \mathbb{R}$ such that $f(x)\geq 0\ \forall \ x\in \mathbb{R}$, $f'(x)$ exists $\forall \ x\in \mathbb{R}$ and $f'(x)\geq 0\ \forall \ x\in \mathbb{R}$ and $f(n)=0\ \forall \ n\in \mathbb{Z}$

What is the $22\text{nd}$ positive integer $n$ such that $22^n$ ends in a $2$? (when written in base $10$).

Danny likes seven-digit numbers with the following property: the 1's digit is divisible by the 10's digit, the 10's digit is divisible by the 100's digit, and so on. For example, Danny likes the number $1133366$ but doesn't like $9999993$. Is the amount of numbers Danny likes divisible by $7$?

Diagonals $AC,BD$ of cyclic quadrilateral $ABCD$ intersect at $P$.Point $Q$ is on$BC$ (between$B$ and $C$) such that $PQ \perp AC$.Prove that the line passes through the circumcenters of triangles $APD$ and $BQD$ is parallel to $AD$.(A.Kuznetsov)

Alfred and Bonnie play a game in which they take turns tossing a fair coin. The winner of a game is the first person to obtain a head. Alfred and Bonnie play this game several times with the stipulation that the loser of a game goes first in the next game. Suppose that Alfred goes first in the first game, and that the probability that he wins the sixth game is $m/n$, where $m$ and $n$ are relatively prime positive integers. What are the last three digits of $m + n$?

Let $\Gamma$ be a circle and let $d$ be a line such that $\Gamma$ and $d$ have no common points. Further, let $AB$ be a diameter of the circle $\Gamma$; assume that this diameter $AB$ is perpendicular to the line $d$, and the point $B$ is nearer to the line $d$ than the point $A$. Let $C$ be an arbitrary point on the circle $\Gamma$, different from the points $A$ and $B$. Let $D$ be the point of intersection of the lines $AC$ and $d$. One of the two tangents from the point $D$ to the circle $\Gamma$ touches this circle $\Gamma$ at a point $E$; hereby, we assume that the points $B$ and $E$ lie in the same halfplane with respect to the line $AC$. Denote by $F$ the point of intersection of the lines $BE$ and $d$. Let the line $AF$ intersect the circle $\Gamma$ at a point $G$, different from $A$. Prove that the reflection of the point $G$ in the line $AB$ lies on the line $CF$.

We have $2015$ prisinoers.The king gives everyone a hat coloured in one of $5$ colors.Everyone sees all hats expect his own.Now,the King orders them in a line(a prisioner can see all guys behind and in front of him).The king asks the prisinoers one by one does he know the color of his hat.If he answers [b]NO[/b],then he is killed.If he answers [b]YES[/b],then answers which color is his hat,if his answers is true,he goes to freedom,if not,he is killed.All the prisinors can hear did he answer [b]YES[/b] or [b]NO[/b],but if he answered [b]YES[/b],they don't know what did he answered(he is killed in public).They can think of a strategy before the King comes,but after that they can't comunicate.What is the largest number of prisinors we can guarentee that can survive?

The numbers $\frac 32$, $\frac 43$ and $\frac 65$ are intially written on the blackboard. A move consists of erasing one of the numbers from the blackboard, call it $a$, and replacing it with $bc-b-c+2$, where $b,c$ are the other two numbers currently written on the blackboard. Is it possible that $\frac{1000}{999}$ would eventually appear on the blackboard? What about $\frac{113}{108}$? [i] (Andrei Bâra)[/i]

There are $1000$ cities in the country of Euleria, and some pairs of cities are linked by dirt roads. It is possible to get from any city to any other city by traveling along these roads. Prove that the government of Euleria may pave some of the roads so that every city will have an odd number of paved roads leading out of it.

Let $w = \frac{\sqrt{3}+i}{2}$ and $z=\frac{-1+i\sqrt{3}}{2}$, where $i=\sqrt{-1}$. Find the number of ordered pairs $(r, s)$ of positive integers not exceeding $100$ that satisfy the equation $i\cdot w^r=z^s$.

Let $X$ and $Y$ be the following sums of arithmetic sequences: \begin{eqnarray*} X &=& 10 + 12 + 14 + \cdots + 100, \\ Y &=& 12 + 14 + 16 + \cdots + 102. \end{eqnarray*} What is the value of $Y - X$? $ \textbf{(A)}\ 92\qquad\textbf{(B)}\ 98\qquad\textbf{(C)}\ 100\qquad\textbf{(D)}\ 102\qquad\textbf{(E)}\ 112 $