Find all functions $f : Z \to Z$ satisfying $f(m + n) + f(mn -1) = f(m)f(n) + 2$ for all $m, n \in Z$.

There exists point $O$ inside a convex quadrilateral $ABCD$ satisfying $OA=OB$ and $OC=OD$, and $\angle AOB = \angle COD=90^{\circ}$. Consider two squares, (1)square having $AC$ as one side and located in the opposite side of $B$ and (2)square having $BD$ as one side and located in the opposite side of $E$. If the common part of these two squares is also a square, prove that $ABCD$ is an inscribed quadrilateral.

Find all $f : N \longmapsto N$ that there exist $k \in N$ and a prime $p$ that: $\forall n \geq k \ f(n+p)=f(n)$ and also if $m \mid n$ then $f(m+1) \mid f(n)+1$

Let's say that an ordered triple of positive integers $(a,b,c)$ is [i]$n$-powerful[/i] if $a\le b\le c,\gcd (a,b,c)=1$ and $a^n+b^n+c^n$ is divisible by $a+b+c$. For example, $(1,2,2)$ is $5$-powerful. $a)$ Determine all ordered triples (if any) which are $n$-powerful for all $n\ge 1$. $b)$ Determine all ordered triples (if any) which are $2004$-powerful and $2005$-powerful, but not $2007$-powerful.

Find all functions $f: N_0 \to N_0$, (where $N_0$ is the set of all non-negative integers) such that $f(f(n))=f(n)+1$ for all $n \in N_0$ and the minimum of the set $\{ f(0), f(1), f(2) \cdots \}$ is $1$.

In a multiple choice test there were 4 questions and 3 possible answers for each question. A group of students was tested and it turned out that for any three of them there was a question which the three students answered differently. What is the maximum number of students tested?

Find all function $f:\mathbb R^+ \rightarrow \mathbb R^+$ such that: \[f\left(\frac{f(x)}{x}+y\right)=1+f(y), \quad \forall x,y \in \mathbb R^+.\]

Find all positive integers $1 \le n \le 2008$ so that there exist a prime number $p \ge n$ such that $$\frac{2008^p + (n -1)!}{n}$$ is a positive integer.

The circle divides each side of an equilateral triangle into three equal parts. Prove that the sum of the squares of the distances from any point of this circle to the vertices of the triangle is constant.

Let $V$ be a point in the exterior of a circle of center $O$, and let $T_1,T_2$ be the points where the tangents from $V$ touch the circle. Let $T$ be an arbitrary point on the small arc $T_1T_2$. The tangent in $T$ at the circle intersects the line $VT_1$ in $A$, and the lines $TT_1$ and $VT_2$ intersect in $B$. We denote by $M$ the intersection of the lines $TT_1$ and $AT_2$. Prove that the lines $OM$ and $AB$ are perpendicular.

To connect to the OFM site, Alice must choose a password. The latter must be consisting of $n$ characters among the following $27$ characters: $$A, B, C, . . ., Y , Z, \#$$ We say that a password $m$ is [i]redundant [/i] if we can color in red and blue a block of consecutive letters of $m$ in such a way that the word formed from the red letters is identical to the word formed from blue letters. For example, the password $H\#ZBZJBJZ$ is redundant, because it contains the [color=#00f]ZB[/color][color=#f00]Z[/color][color=#00f]J[/color][color=#f00]BJ[/color] block, where the word $ZBJ$ appears in both blue and red. At otherwise, the $ABCACB$ password is not redundant. Show that, for any integer $n \ge 1$, there exist at least $18^n$ passwords of length $n$, that is to say formed of $n$ characters each, which are not redundant.

Let $n$ be a positive integer and let $A$, $B$ be two complex nonsingular $n \times n$ matrices such that \[A^2B-2ABA+BA^2=0.\] Prove that the matrix $AB^{-1}A^{-1}B-I_n$ is nilpotent.

Let $ABCD$ be an isosceles trapezoid with $AB = 1$, $BC = DA = 5$, $CD = 7$. Let $P$ be the intersection of diagonals $AC$ and $BD$, and let $Q$ be the foot of the altitude from $D$ to $BC$. Let $PQ$ intersect $AB$ at $R$. Compute $\sin \angle RP D$

Find the least real number $m$ such that with all $5$ equilaterial triangles with sum of areas $m$ we can cover an equilaterial triangle with side 1. [i]O. Mushkarov, N. Nikolov[/i]

There are $10$ consecutive 30-digit numbers. We write the biggest divisor for every number ( divisor is not equal number). Prove that some written numbers ends with same digit.

New license plates consist of two letters, three digits, and two letters (from the English alphabet of$ 26$ letters). What is the largest possible number of such license plates if it is required that every two of them differ at no less than two positions?

If $a$ and $b$ are positive integers such that $a^2-b^4= 2009$, find $a+b$.