For real number $a,$ find the minimum value of $\int_{0}^{\frac{\pi}{2}}\left|\frac{\sin 2x}{1+\sin^{2}x}-a\cos x\right| dx.$

In the Cartesian plane $XOY$, there is a rhombus $ABCD$ whose side lengths are all $4$ and $|OB|=|OD|=6$, where $O$ is the origin. [b](1)[/b] Prove that $|OA|\cdot |OB|$ is a constant. [b](2)[/b] Find the locus of $C$ if $A$ is a point on the semicircle \[(x-2)^2+y^2=4 \quad (2\le x\le 4).\]

In a magic square $n \times n$ composed from the numbers $1,2,\cdots,n^2$, the centers of any two squares are joined by a vector going from the smaller number to the bigger one. Prove that the sum of all these vectors is zero. (A magic square is a square matrix such that the sums of entries in all its rows and columns are equal.)

For which integers $n \geq 3$ does there exist a regular $n$-gon in the plane such that all its vertices have integer coordinates in a rectangular coordinate system?

Determine all real values of parameter $p$ such that the equation \[|x-2|+|y-3|+y=p\] is an equation of a ray in the plane $xy.$

Let B,C be fixed points and A be roving point. Let H, G be orthecentre and centroid of triagle ABC. Known midpoint of HG lies on BC, find locus of A

A fly and $k$ spiders are placed in some vertices of $2012 \times 2012$ lattice. One move consists of following: firstly, fly goes to some adjacent vertex or stays where it is and then every spider goes to some adjacent vertex or stays where it is (more than one spider can be in the same vertex). Spiders and fly knows where are the others all the time. a) Find the smallest $k$ so that spiders can catch the fly in finite number of moves, regardless of their initial position. b) Answer the same question for three-dimensional lattice $2012\times 2012\times 2012$. (Vertices in lattice are adjacent if exactly one coordinate of one vertex is different from the same coordinate of the other vertex, and their difference is equal to $1$. Spider catches a fly if they are in the same vertex.)

A particle is located on the coordinate plane at $ (5,0)$. Define a [i]move[/i] for the particle as a counterclockwise rotation of $ \pi/4$ radians about the origin followed by a translation of $ 10$ units in the positive $ x$-direction. Given that the particle's position after $ 150$ moves is $ (p,q)$, find the greatest integer less than or equal to $ |p|\plus{}|q|$.

Let $K$ be a convex polygon in the plane and suppose that $K$ is positioned in the coordinate system in such a way that \[\text{area } (K \cap Q_i) =\frac 14 \text{area } K \ (i = 1, 2, 3, 4, ),\] where the $Q_i$ denote the quadrants of the plane. Prove that if $K$ contains no nonzero lattice point, then the area of $K$ is less than $4.$

The $y$-intercepts, $P$ and $Q$, of two perpendicular lines intersecting at the point $A(6,8)$ have a sum of zero. What is the area of $\triangle APQ$? $ \textbf{(A)}\ 45\qquad\textbf{(B)}\ 48\qquad\textbf{(C)}\ 54\qquad\textbf{(D)}\ 60\qquad\textbf{(E)}\ 72 $

In the diagram, $ ABCD$ is a square, with $ U$ and $ V$ interior points of the sides $ AB$ and $ CD$ respectively. Determine all the possible ways of selecting $ U$ and $ V$ so as to maximize the area of the quadrilateral $ PUQV$. [img]http://i250.photobucket.com/albums/gg265/geometry101/CMO1992Number3.jpg[/img]

In a triangle $ABC$, let $D$ be the point on the segment $BC$ such that $AB+BD=AC+CD$. Suppose that the points $B$, $C$ and the centroids of triangles $ABD$ and $ACD$ lie on a circle. Prove that $AB=AC$.

Suppose that $\displaystyle{{v_1},{v_2},...,{v_d}}$ are unit vectors in $\displaystyle{{{\Bbb R}^d}}$. Prove that there exists a unitary vector $\displaystyle{u}$ such that $\displaystyle{\left| {u \cdot {v_i}} \right| \leq \frac{1}{{\sqrt d }}}$ for $\displaystyle{i = 1,2,...,d}$. [b]Note.[/b] Here $\displaystyle{ \cdot }$ denotes the usual scalar product on $\displaystyle{{{\Bbb R}^d}}$. [i]Proposed by Tomasz Tkocz, University of Warwick.[/i]

Describe the region $R$ consisting of the points $(a,b)$ of the cartesian plane for which both (possibly complex) roots of the polynomial $z^2+az+b$ have absolute value smaller than $1$.

Three concentric circles have radii $3$, $4$, and $5$. An equilateral triangle with one vertex on each circle has side length $s$. The largest possible area of the triangle can be written as $a+\frac{b}{c}\sqrt{d}$, where $a,b,c$ and $d$ are positive integers, $b$ and $c$ are relatively prime, and $d$ is not divisible by the square of any prime. Find $a+b+c+d$.

The coordinates of $ A,B$ and $ C$ are $ (5,5),(2,1)$ and $ (0,k)$ respectively. The value of $ k$ that makes $ \overline{AC}\plus{}\overline{BC}$ as small as possible is: $ \textbf{(A)}\ 3 \qquad\textbf{(B)}\ 4\frac{1}{2} \qquad\textbf{(C)}\ 3\frac{6}{7} \qquad\textbf{(D)}\ 4\frac{5}{6} \qquad\textbf{(E)}\ 2\frac{1}{7}$

Let $\omega$ be the circumcircle of $\triangle{ABC}$. $P$ is an interior point of $\triangle{ABC}$. $A_{1}, B_{1}, C_{1}$ are the intersections of $AP, BP, CP$ respectively and $A_{2}, B_{2}, C_{2}$ are the symmetrical points of $A_{1}, B_{1}, C_{1}$ with respect to the midpoints of side $BC, CA, AB$. Show that the circumcircle of $\triangle{A_{2}B_{2}C_{2}}$ passes through the orthocentre of $\triangle{ABC}$.

In parallelogram $ ABCD$, point $ M$ is on $ \overline{AB}$ so that $ \frac{AM}{AB} \equal{} \frac{17}{1000}$ and point $ N$ is on $ \overline{AD}$ so that $ \frac{AN}{AD} \equal{} \frac{17}{2009}$. Let $ P$ be the point of intersection of $ \overline{AC}$ and $ \overline{MN}$. Find $ \frac{AC}{AP}$.

Prove that the set of all the points with both coordinates begin rational numbers can be written as a reunion of two disjoint sets $ A$ and $ B$ such that any line that that is parallel with $ Ox$, and respectively $ Oy$ intersects $ A$, and respectively $ B$ in a finite number of points.

Is it possible to partition $3$-dimensional Euclidean space into $1979$ mutually isometric subsets?

A circle touches the sides $AB,BC, CD,DA$ of a square at points $K,L,M,N$ respectively, and $BU, KV$ are parallel lines such that $U$ is on $DM$ and $V$ on $DN$. Prove that $UV$ touches the circle.

Alice and Bob find themselves on a coordinate plane at time $t=0$ at $A(1,0)$ and $B(-1,0)$ respectively. They have no sense of direction, but they want to find each other. They each pick a direction independently and with uniform random probability. Both Alice and Bob travel at a constant speed of $1 \frac{unit}{min}$ in their chosen directions. They continue on their straight line paths forever, each hoping to catch sight of the other. They both have a $1$ unit radius of view; they can see something if and only if its distance from them is at most $1$ unit. What is the probability they never see each other?

In the Cartesian plane let $A = (1,0)$ and $B = \left( 2, 2\sqrt{3} \right)$. Equilateral triangle $ABC$ is constructed so that $C$ lies in the first quadrant. Let $P=(x,y)$ be the center of $\triangle ABC$. Then $x \cdot y$ can be written as $\tfrac{p\sqrt{q}}{r}$, where $p$ and $r$ are relatively prime positive integers and $q$ is an integer that is not divisible by the square of any prime. Find $p+q+r$.

Consider the set $\mathbb Q^2$ of points in $\mathbb R^2$, both of whose coordinates are rational. [b](a)[/b] Prove that the union of segments with vertices from $\mathbb Q^2$ is the entire set $\mathbb R^2$. [b](b)[/b] Is the convex hull of $\mathbb Q^2$ (i.e., the smallest convex set in $\mathbb R^2$ that contains $\mathbb Q^2$) equal to $\mathbb R^2$ ?

The polygon(s) formed by $y=3x+2$, $y=-3x+2$, and $y=-2$, is (are): $ \textbf{(A) }\text{An equilateral triangle}\qquad\textbf{(B) }\text{an isosceles triangle} \qquad\textbf{(C) }\text{a right triangle} \qquad$ $\textbf{(D) }\text{a triangle and a trapezoid}\qquad\textbf{(E) }\text{a quadrilateral} $