Given points $P(-1,-2)$ and $Q(4,2)$ in the $xy$-plane; point $R(1,m)$ is taken so that $PR+RQ$ is a minimum. Then $m$ equals: $\textbf{(A) }-\tfrac35\qquad \textbf{(B) }-\tfrac25\qquad \textbf{(C) }-\tfrac15\qquad \textbf{(D) }\tfrac15\qquad \textbf{(E) }\text{either }-\tfrac15\text{ or }\tfrac15$

Let $S$ be the square one of whose diagonals has endpoints $(0.1,0.7)$ and $(-0.1,-0.7)$. A point $v=(x,y)$ is chosen uniformly at random over all pairs of real numbers $x$ and $y$ such that $0\le x \le 2012$ and $0 \le y \le 2012$. Let $T(v)$ be a translated copy of $S$ centered at $v$. What is the probability that the square region determined by $T(v)$ contains exactly two points with integer coordinates in its interior? $ \textbf{(A)}\ 0.125\qquad\textbf{(B)}\ 0.14\qquad\textbf{(C)}\ 0.16\qquad\textbf{(D)}\ 0.25\qquad\textbf{(E)}\ 0.32 $

On the coordinate plane, draw all points$ M(x, y)$, the coordinates of which satisfy the inequalities $$\cos(x + y)^2 \le \cos(x - y)^2, \,\,\, 0 \le x^3, \,\,\, 0 \le y^3.$$

A rectangle formed by the lines of checkered paper is divided into figures of three kinds: isosceles right triangles (1) with base of two units, squares (2) with unit side, and parallelograms (3) formed by two sides and two diagonals of unit squares (figures may be oriented in any way). Prove that the number of figures of the third kind is even. [img]http://up.iranblog.com/Files7/dda310bab8b6455f90ce.jpg[/img]

$A,B,C$ and $D$ are points on the parabola $y = x^2$ such that $AB$ and $CD$ intersect on the $y$-axis. Determine the $x$-coordinate of $D$ in terms of the $x$-coordinates of $A,B$ and $C$, which are $a, b$ and $c$ respectively.

In tetrahedron $ABCD$, vertex $D$ is connected with $D_0$, the centrod if $\triangle ABC$. Line parallel to $DD_0$ are drawn through $A,B$ and $C$. These lines intersect the planes $BCD, CAD$ and $ABD$ in points $A_2, B_1,$ and $C_1$, respectively. Prove that the volume of $ABCD$ is one third the volume of $A_1B_1C_1D_0$. Is the result if point $D_o$ is selected anywhere within $\triangle ABC$?

Let $ABCD$ be a quadrilateral inscribed in circle $\omega$. Define $E = AA \cap CD$, $F = AA \cap BC$, $G = BE \cap \omega$, $H = BE \cap AD$, $I = DF \cap \omega$, and $J = DF \cap AB$. Prove that $GI$, $HJ$, and the $B$-symmedian are concurrent. [i]Proposed by Robin Park[/i]

On the coordinate plane, let $C$ be a circle centered $P(0,\ 1)$ with radius 1. let $a$ be a real number $a$ satisfying $0<a<1$. Denote by $Q,\ R$ intersection points of the line $y=a(x+1) $ and $C$. (1) Find the area $S(a)$ of $\triangle{PQR}$. (2) When $a$ moves in the range of $0<a<1$, find the value of $a$ for which $S(a)$ is maximized. [i]2011 Tokyo University entrance exam/Science, Problem 1[/i]

Let $u_{jk}$ be a real number for each $j=1,2,3$ and each $k=1,2$ and let $N$ be an integer such that \[\max_{1\le k \le 2} \sum_{j=1}^3 |u_{jk}| \leq N\] Let $M$ and $l$ be positive integers such that $l^2 <(M+1)^3$. Prove that there exist integers $\xi_1,\xi_2,\xi_3$ not all zero, such that \[\max_{1\le j \le 3}\xi_j \le M\ \ \ \ \text{and} \ \ \ \left|\sum_{j=1}^3 u_{jk}\xi_k\right| \le \frac{MN}{l} \ \ \ \ \text{for k=1,2}\]

How many hours does it take a train traveling at an average rate of $ 40$ mph between stops to travel $ a$ miles it makes $ n$ stops of $ m$ minutes each? $ \textbf{(A)}\ \frac{3a\plus{}2mn}{120} \qquad \textbf{(B)}\ 3a\plus{}2mn \qquad \textbf{(C)}\ \frac{3a\plus{}2mn}{12} \qquad \textbf{(D)}\ \frac{a\plus{}mn}{40} \qquad \textbf{(E)}\ \frac{a\plus{}40mn}{40}$

Let $L$ be the line with slope $\tfrac{5}{12}$ that contains the point $A=(24,-1)$, and let $M$ be the line perpendicular to line $L$ that contains the point $B=(5,6)$. The original coordinate axes are erased, and line $L$ is made the $x$-axis, and line $M$ the $y$-axis. In the new coordinate system, point $A$ is on the positive $x$-axis, and point $B$ is on the positive $y$-axis. The point $P$ with coordinates $(-14,27)$ in the original system has coordinates $(\alpha,\beta)$ in the new coordinate system. Find $\alpha+\beta$.

Consider an acute triangle $ABC$ of area $S$. Let $CD \perp AB$ ($D \in AB$), $DM \perp AC$ ($M \in AC$) and $DN \perp BC$ ($N \in BC$). Denote by $H_1$ and $H_2$ the orthocentres of the triangles $MNC$, respectively $MND$. Find the area of the quadrilateral $AH_1BH_2$ in terms of $S$.

Let $ ABCDEF$ be a regular hexagon. Let $ G$, $ H$, $ I$, $ J$, $ K$, and $ L$ be the midpoints of sides $ AB$, $ BC$, $ CD$, $ DE$, $ EF$, and $ AF$, respectively. The segments $ AH$, $ BI$, $ CJ$, $ DK$, $ EL$, and $ FG$ bound a smaller regular hexagon. Let the ratio of the area of the smaller hexagon to the area of $ ABCDEF$ be expressed as a fraction $ \frac {m}{n}$ where $ m$ and $ n$ are relatively prime positive integers. Find $ m \plus{} n$.

Consider the real number axis (i. e. the $x$-axis of a Cartesian coordinate system). We mark the points $1$, $2$, ..., $2n$ on this axis. A flea starts at the point $1$. Now it jumps along the real number axis; it can jump only from a marked point to another marked point, and it doesn't visit any point twice. After the ($2n-1$)-th jump, it arrives at a point from where it cannot jump any more after this rule, since all other points are already visited. Hence, with its $2n$-th jump, the flea breaks this rule and gets back to the point $1$. Assume that the sum of the (non-directed) lengths of the first $2n-1$ jumps of the flea was $n\left(2n-1\right)$. Show that the length of the last ($2n$-th) jump is $n$.

An equilateral triangle is inscribed in the ellipse whose equation is $x^2+4y^2=4.$ One vertex of the triangle is $(0,1),$ one altitude is contained in the $y$-axis, and the length of each side is $\sqrt{\frac mn},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

In a planar coordinate system we got four pieces on positions with coordinates. You can make a move according to the following rule: You can move a piece to a new position if there is one of the other pieces in the middle of the old and new position. Initially the four pieces have positions $ \{(0,0),(0,1),(1,0),(1,1)\}$. Given a finite number of moves can you yield the configuration $ \{(0,0), (1,1), (3,0), (2, \minus{} 1)\}$ ?

There are ten coins a line, which are indistinguishable. It is known that two of them are false and have consecutive positions on the line. For each set of positions, you may ask how many false coins it contains. Is it possible to identify the false coins by making only two of those questions, without knowing the answer to the first question before making the second?

For how many integer value of $ m$ does the lines $ 13x\plus{}11y \equal{} 700$ and $ y \equal{} mx\minus{}1$ intersect in a point with integer valued coordinats? A. None B. 1 C. 2 D. 3 E. Infinitely many

In each cell of an $n\times n$ board is a lightbulb. Initially, all of the lights are off. Each move consists of changing the state of all of the lights in a row or of all of the lights in a column (off lights are turned on and on lights are turned off). Show that if after a certain number of moves, at least one light is on, then at this moment at least $n$ lights are on.

At what $a$ does the graph of the function $y = x^4+x^3+ax$ have an axis of symmetry parallel to the axis $Oy$?

Suppose the curve $ C: y \equal{} ax^3 \plus{} 4x\ (a\neq 0)$ has a common tangent line at the point $ P$ with the hyperbola $ xy \equal{} 1$ in the first quadrant. (1) Find the value of $ a$ and the coordinate of the point $ P$. (2) Find the volume formed by the revolution of the solid of the figure bounded by the line segment $ OP$ and the curve $ C$ about the line $ OP$. [color=green][Edited.][/color]

Is it possible to write a positive integer in every cell of an infinite chessboard, in such a manner that, for all positive integers $m, n$, the sum of numbers in every $m\times n$ rectangle is divisible by $m + n$ ?

In triangle $ABC$, $M\in(BC)$, $\frac{BM}{BC}=\alpha$, $N\in(CA)$, $\frac{CN}{CA}=\beta$, $P\in(AB)$, $\frac{AP}{AB}=\gamma$. Let $AM\cap BN=\{D\}$, $BN\cap CP=\{E\}$, $CP\cap AM=\{F\}$. Prove that $S_{DEF}=S_{BMD}+S_{CNE}+S_{APF}$ iff $\alpha+\beta+\gamma=1$.

Let $P_1$, $P_2$, $\ldots$, $P_{1993} = P_0$ be distinct points in the $xy$-plane with the following properties: (i) both coordinates of $P_i$ are integers, for $i = 1, 2, \ldots, 1993$; (ii) there is no point other than $P_i$ and $P_{i+1}$ on the line segment joining $P_i$ with $P_{i+1}$ whose coordinates are both integers, for $i = 0, 1, \ldots, 1992$. Prove that for some $i$, $0 \leq i \leq 1992$, there exists a point $Q$ with coordinates $(q_x, q_y)$ on the line segment joining $P_i$ with $P_{i+1}$ such that both $2q_x$ and $2q_y$ are odd integers.

Unit cubes are made into beads by drilling a hole through them along a diagonal. The beads are put on a string in such a way that they can move freely in space under the restriction that the vertices of two neighboring cubes are touching. Let $ A$ be the beginning vertex and $ B$ be the end vertex. Let there be $ p \times q \times r$ cubes on the string $ (p, q, r \geq 1).$ [i](a)[/i] Determine for which values of $ p, q,$ and $ r$ it is possible to build a block with dimensions $ p, q,$ and $ r.$ Give reasons for your answers. [i](b)[/i] The same question as (a) with the extra condition that $ A \equal{} B.$