In some of the $ 1\times1 $ squares of a square garden $ 50\times50 $ we've grown apple, pomegranate and peach trees (At most one tree in each square). We call a $ 1\times1 $ square a [i]room[/i] and call two rooms [i]neighbor[/i] if they have one common side. We know that a pomegranate tree has at least one apple neighbor room and a peach tree has at least one apple neighbor room and one pomegranate neighbor room. We also know that an empty room (a room in which there’s no trees) has at least one apple neighbor room and one pomegranate neighbor room and one peach neighbor room. Prove that the number of empty rooms is not greater than $ 1000. $

For every positive integer $x$, let $k(x)$ denote the number of composite numbers that do not exceed $x$. Find all positive integers $n$ for which $(k (n))! $ lcm $(1, 2,..., n)> (n - 1) !$ .

Let $A$ be point in the exterior of the circle $\mathcal C$. Two lines passing through $A$ intersect the circle $\mathcal C$ in points $B$ and $C$ (with $B$ between $A$ and $C$) respectively in $D$ and $E$ (with $D$ between $A$ and $E$). The parallel from $D$ to $BC$ intersects the second time the circle $\mathcal C$ in $F$. Let $G$ be the second point of intersection between the circle $\mathcal C$ and the line $AF$ and $M$ the point in which the lines $AB$ and $EG$ intersect. Prove that \[ \frac 1{AM} = \frac 1{AB} + \frac 1{AC}. \]

Let $a_1=1,$ $a_2=2,$ $a_n=2a_{n-1}+a_{n-2},$ $n=3,4,\cdots.$ Prove that for any integer $n\geq5,$ $a_n$ has at least one prime factor $p,$ such that $p\equiv 1\pmod{4}.$

Let $N$ denote the number of ordered pairs of sets $(A, B)$ such that $A \cup B$ is a size-$999$ subset of $\{1,2,\dots,1997\}$ and $(A \cap B) \cap \{1,2\} = \{1\}$. If $m$ and $k$ are integers such that $3^m5^k$ divides $N$, compute the the largest possible value of $m+k$. [i]Proposed by Michael Tang[/i]

A circle of radius $4$ is inscribed in a triangle $ABC$. We call $D$ the touchpoint between the circle and side BC. Let $CD =8$, $DB= 10$. What is the length of the sides $AB$ and $AC$?

Kim's flight took off from Newark at 10:34 AM and landed in Miami at 1:18 PM. Both cities are in the same time zone. If her flight took $ h$ hours and $ m$ minutes, with $ 0<m<60$, what is $ h\plus{}m$? $ \textbf{(A)}\ 46 \qquad \textbf{(B)}\ 47 \qquad \textbf{(C)}\ 50 \qquad \textbf{(D)}\ 53 \qquad \textbf{(E)}\ 54$

Find all positive integer pairs $(m, n)$ such that $m- n$ is a positive prime number and $mn$ is a perfect square. Justify your answer.

Show that $n!=a^{n-1}+b^{n-1}+c^{n-1}$ has only finitely many solutions in positive integers. [i]Proposed by Dorlir Ahmeti, Albania[/i]

Four perpendiculars are drawn from four vertices of a convex pentagon to the opposite sides. If these four lines pass through the same point, prove that the perpendicular from the fifth vertex to the opposite side also passes through this point.

Suppose $(a_1,a_2,a_3,a_4)$ is a 4-term sequence of real numbers satisfying the following two conditions: [list] [*] $a_3=a_2+a_1$ and $a_4=a_3+a_2$; [*] there exist real numbers $a,b,c$ such that \[an^2+bn+c=\cos(a_n)\] for all $n\in\{1,2,3,4\}$. [/list] Compute the maximum possible value of \[\cos(a_1)-\cos(a_4)\] over all such sequences $(a_1,a_2,a_3,a_4)$.

Forty-nine students solve a set of 3 problems. The score for each problem is a whole number of points from 0 to 7. Prove that there exist two students $ A$ and $ B$ such that, for each problem, $ A$ will score at least as many points as $ B.$

A circle can be drawn around the quadrilateral $ABCD$. $K$ is a point on the diagonal $BD$ . The straight line $CK$ intersects the side $AD$ at the point $M$. Prove that the circles circumscribed around the triangles $BCK$ and $ACM$ are tangent.

Consider a polynomial $P(x) = \prod^9_{j=1}(x+d_j),$ where $d_1, d_2, \ldots d_9$ are nine distinct integers. Prove that there exists an integer $N,$ such that for all integers $x \geq N$ the number $P(x)$ is divisible by a prime number greater than 20. [i]Proposed by Luxembourg[/i]

For a positive integer $n$, ($n\ge 2$), find the number of sets with $2n + 1$ points $P_0, P_1,..., P_{2n}$ in the coordinate plane satisfying the following as its elements: - $P_0 = (0, 0),P_{2n}= (n, n)$ - For all $i = 1,2,..., 2n - 1$, line $P_iP_{i+1}$ is parallel to $x$-axis or $y$-axis and its length is $1$. - Out of $2n$ lines$P_0P_1, P_1P_2,..., P_{2n-1}P_{2n}$, there are exactly $4$ lines that are enclosed in the domain $y \le x$.

The triangle $ABC$ has a right angle at $A$. The centre of the circumcircle is called $O$, and the base point of the normal from $O$ to $AC$ is called $D$. The point $E$ lies on $AO$ with $AE = AD$. The angle bisector of $\angle CAO$ meets $CE$ in $Q$. The lines $BE$ and $OQ$ intersect in $F$. Show that the lines $CF$ and $OE$ are parallel.

A set $S$ of four distinct points is given in the plane. It is known that for any point $X\in S$ the remaining points can be denoted by $Y,Z$ and $W$ so that $|XY|=|XZ|+|XW|$ Prove that all four points lie on a line.

[b]3.[/b] Let $k$ and $K$ be concentric circles on the plane, and let $k$ be contained inside $K$. Assume that $k$ is covered by a finite system of convex angular domains with vertices on $K$. Prove that the sum of the angles of the domains is not less than the angle under which $k$ can be seen from a point of $K$. ([b]G.38[/b]) [Zs.. Páles]

Let $ ABC$ be a triangle with $ BC \equal{} 2007$, $ CA \equal{} 2008$, $ AB \equal{} 2009$. Let $ \omega$ be an excircle of $ ABC$ that touches the line segment $ BC$ at $ D$, and touches extensions of lines $ AC$ and $ AB$ at $ E$ and $ F$, respectively (so that $ C$ lies on segment $ AE$ and $ B$ lies on segment $ AF$). Let $ O$ be the center of $ \omega$. Let $ \ell$ be the line through $ O$ perpendicular to $ AD$. Let $ \ell$ meet line $ EF$ at $ G$. Compute the length $ DG$.

Three lines are drawn parallel to each of the three sides of $\triangle ABC$ so that the three lines intersect in the interior of $ABC$. The resulting three smaller triangles have areas $1$, $4$, and $9$. Find the area of $\triangle ABC$. [asy] defaultpen(linewidth(0.7)); size(120); pair relpt(pair P, pair Q, real a, real b) { return (a*Q+b*P)/(a+b); } pair B = (0,0), C = (1,0), A = (0.3, 0.8), D = relpt(relpt(A,B,3,3),relpt(A,C,3,3),1,2); draw(A--B--C--cycle); label("$A$",A,N); label("$B$",B,S); label("$C$",C,S); filldraw(relpt(A,B,2,4)--relpt(A,B,3,3)--D--cycle, gray(0.7)); filldraw(relpt(A,C,1,5)--relpt(A,C,3,3)--D--cycle, gray(0.7)); filldraw(relpt(C,B,2,4)--relpt(B,C,1,5)--D--cycle, gray(0.7));[/asy]

Define a [i]small[/i] prime to be a prime under $1$ billion. Find the sum of all [i]small[/i] primes of the form $20^n + 1$, given that the answer is greater than $1000$. [i]Lightning 3.3[/i]

Let $O$ and $A$ be two points in the plane with $OA = 30$, and let $\Gamma$ be a circle with center $O$ and radius $r$. Suppose that there exist two points $B$ and $C$ on $\Gamma$ with $\angle ABC = 90^{\circ}$ and $AB = BC$. Compute the minimum possible value of $\lfloor r \rfloor.$

Define the [i]quasi-primes[/i] as follows. $\bullet$ The first quasi-prime is $q_1 = 2$ $\bullet$ For $n \ge 2$, the $n^{th}$ quasi-prime $q_n$ is the smallest integer greater than $q_{n_1}$ and not of the form $q_iq_j$ for some $1 \le i \le j \le n - 1$. Determine, with proof, whether or not $1000$ is a quasi-prime.

A multiple choice examination consists of $20$ questions. The scoring is $+5$ for each correct answer, $-2$ for each incorrect answer, and $0$ for each unanswered question. John's score on the examination is $48$. What is the maximum number of questions he could have answered correctly? $\text{(A)}\ 9 \qquad \text{(B)}\ 10 \qquad \text{(C)}\ 11 \qquad \text{(D)}\ 12 \qquad \text{(E)}\ 16$

Two bodies simultaneously emerge from points $A$ and $B$ towards each other. Every time each body finds itself at point $A$ or point $B$, it changes the direction of its movement to the opposite (the absolute values of the velocities of both bodies are constant). A body that initially leaves point $A$ travels the path $AB$ in $101$ seconds. A body that initially left point $B$ travels the same path $AB$ in $201$ seconds. After $2 \cdot 101 \cdot 201$ seconds, each body will be at its starting point. How many times during this time will the first body overtake the second?