Let $ABC$ be an acute triangle , with altitudes $AD,BE$ and $CF$. Circle of diameter $AD$ intersects the sides $AB,AC$ in $M,N$ respevtively. Let $P,Q$ be the intersection points of $AD$ with $EF$ and $MN$ respectively. Show that $Q$ is the midpoint of $PD$.

A sequence of numbers $a_1, a_2 , \dots a_m$ is a [i]geometric sequence modulo n of length m[/i] for $n,m \in \mathbb{Z}^+$ if for every index $i$, $a_i \in \{ 0, 1, 2, \dots , m-1\}$ and there exists an integer $k$ such that $n | a_{j+1} - ka_{j}$ for $1 \leq j \leq m-1$. How many geometric sequences modulo $14$ of length $14$ are there?

$(YUG 3)$ Let four points $A_i (i = 1, 2, 3, 4)$ in the plane determine four triangles. In each of these triangles we choose the smallest angle. The sum of these angles is denoted by $S.$ What is the exact placement of the points $A_i$ if $S = 180^{\circ}$?

A square sheet of paper $ABCD$ is folded straight in such a way that point $B$ hits to the midpoint of side $CD$. In what ratio does the fold line divide side $BC$?

Let $m$ be a positive integer, and consider a $m\times m$ checkerboard consisting of unit squares. At the centre of some of these unit squares there is an ant. At time $0$, each ant starts moving with speed $1$ parallel to some edge of the checkerboard. When two ants moving in the opposite directions meet, they both turn $90^{\circ}$ clockwise and continue moving with speed $1$. When more than $2$ ants meet, or when two ants moving in perpendicular directions meet, the ants continue moving in the same direction as before they met. When an ant reaches one of the edges of the checkerboard, it falls off and will not re-appear. Considering all possible starting positions, determine the latest possible moment at which the last ant falls off the checkerboard, or prove that such a moment does not necessarily exist. [i]Proposed by Toomas Krips, Estonia[/i]

Find all pairs of integers $a,b$ for which there exists a polynomial $P(x) \in \mathbb{Z}[X]$ such that product $(x^2+ax+b)\cdot P(x)$ is a polynomial of a form \[ x^n+c_{n-1}x^{n-1}+\cdots+c_1x+c_0 \] where each of $c_0,c_1,\ldots,c_{n-1}$ is equal to $1$ or $-1$.

A dessert chef prepares the dessert for every day of a week starting with Sunday. The dessert each day is either cake, pie, ice cream, or pudding. The same dessert may not be served two days in a row. There must be cake on Friday because of a birthday. How many different dessert menus for the week are possible? $ \textbf{(A)}\ 729\qquad\textbf{(B)}\ 972\qquad\textbf{(C)}\ 1024\qquad\textbf{(D)}\ 2187\qquad\textbf{(E)}\ 2304 $

Let $T$ be a tree with $n$ vertices; that is, a connected simple graph on $n$ vertices that contains no cycle. For every pair $u$, $v$ of vertices, let $d(u,v)$ denote the distance between $u$ and $v$, that is, the number of edges in the shortest path in $T$ that connects $u$ with $v$. Consider the sums \[W(T)=\sum_{\substack{\{u,v\}\subseteq V(T)\\ u\neq v}}d(u,v) \quad \text{and} \quad H(T)=\sum_{\substack{\{u,v\}\subseteq V(T)\\ u\neq v}}\frac{1}{d(u,v)}\] Prove that \[W(T)\cdot H(T)\geq \frac{(n-1)^3(n+2)}{4}.\]

Let $p,q,r$ be primes such that for all positive integer $n$, $$n^{pqr}\equiv n (\mod{pqr})$$ Prove that this happens if and only if $p,q,r$ are pairwise distinct and $LCM(p-1,q-1,r-1)|pqr-1$

Does there exist a solution to the equation \[x^{2}+y^{2}+z^{2}+u^{2}+v^{2}=xyzuv-65\] in integers with $x, y, z, u, v$ greater than $1998$?

Find all functions $f: Q^{+}\rightarrow R$ such that $f(x)+f(y)+2xyf(xy)=\frac{f(xy)}{f(x+y)}$ for all $x,y\in Q^{+}$

A convex pentagon has the property that each of its diagonals cuts off a triangle of unit area. Find the area of the pentagon.

Let $I$ be the set of points $(x,y)$ in the Cartesian plane such that $$x>\left(\frac{y^4}{9}+2015\right)^{1/4}$$ Let $f(r)$ denote the area of the intersection of $I$ and the disk $x^2+y^2\le r^2$ of radius $r>0$ centered at the origin $(0,0)$. Determine the minimum possible real number $L$ such that $f(r)<Lr^2$ for all $r>0$.

Seven points are given in space, no four of which are on a plane. Each of the segments with the endpoints in these points is painted black or red. Prove that there are two monochromatic triangles (not necessarily both of the same color) with no common edge. Does the statement hold for six points?

Let $n\geq3$ be an integer. We say that an arrangement of the numbers $1$, $2$, $\dots$, $n^2$ in a $n \times n$ table is [i]row-valid[/i] if the numbers in each row can be permuted to form an arithmetic progression, and [i]column-valid[/i] if the numbers in each column can be permuted to form an arithmetic progression. For what values of $n$ is it possible to transform any row-valid arrangement into a column-valid arrangement by permuting the numbers in each row?