Let $P$ be a point chosen uniformly at random in the interior of the unit square with vertices at $(0,0), (1,0), (1,1)$, and $(0,1)$. The probability that the slope of the line determined by $P$ and the point $\left(\frac58, \frac38 \right)$ is greater than $\frac12$ can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Let $ a,b,c\in\mathbb{C}^* $ pairwise distinct, having the same absolute value, and satisfying: $$ a^2+b^2+c^2-ab-bc-ca=0. $$ Prove that $ a,b,c $ represents the affixes of the vertices of a right or equilateral triangle.

A certain function $f$ has the properties that $f(3x)=3f(x)$ for all positive real values of $x$, and that $f(x)=1-\mid x-2 \mid$ for $1\leq x \leq 3$. Find the smallest $x$ for which $f(x)=f(2001)$.

Two sequences of integers, $ a_1, a_2, a_3, \ldots$ and $ b_1, b_2, b_3, \ldots$, satisfy the equation \[ (a_n \minus{} a_{n \minus{} 1})(a_n \minus{} a_{n \minus{} 2}) \plus{} (b_n \minus{} b_{n \minus{} 1})(b_n \minus{} b_{n \minus{} 2}) \equal{} 0 \] for each integer $ n$ greater than $ 2$. Prove that there is a positive integer $ k$ such that $ a_k \equal{} a_{k \plus{} 2008}$.

Each point with integral coordinates in the plane is coloured white or blue. Prove that one can choose a colour so that for every positive integer $ n $ there exists a triangle of area $ n $ having its vertices of the chosen colour.

Let $C$ be the circle of radius $12$ centered at $(0, 0)$. What is the length of the shortest path in the plane between $(8\sqrt3, 0)$ and $(0, 12 \sqrt2)$ that does not pass through the interior of $C$?

Find the number of $(a_1,a_2, ... ,a_{2014})$ permutations of the $(1,2, . . . ,2014)$ such that, for all $1\leq i<j\leq2014$, $i+a_i \leq j+a_j$.

$A$ is the point $(1,0)$, $L$ is the line $y = kx$ (where $k > 0$). For which points $P(t,0)$ can we find a point $Q$ on $L$ such that $AQ$ and $QP$ are perpendicular?

Answer the questions as below. (1) Find the local minimum of $y=x(1-x^2)e^{x^2}.$ (2) Find the total area of the part bounded the graph of the function in (1) and the $x$-axis.

Let $ABCDEF$ be a convex hexagon such that $\angle B+\angle D+\angle F=360^{\circ }$ and \[ \frac{AB}{BC} \cdot \frac{CD}{DE} \cdot \frac{EF}{FA} = 1. \] Prove that \[ \frac{BC}{CA} \cdot \frac{AE}{EF} \cdot \frac{FD}{DB} = 1. \]

A [i]lattice point[/i] in the Cartesian plane is a point whose coordinates are both integers. A [i]lattice polygon[/i] is a polygon all of whose vertices are lattice points. Let $\Gamma$ be a convex lattice polygon. Prove that $\Gamma$ is contained in a convex lattice polygon $\Omega$ such that the vertices of $\Gamma$ all lie on the boundary of $\Omega$, and exactly one vertex of $\Omega$ is not a vertex of $\Gamma$.

Let $a,b,c$ be real numbers satisfying $a<b<c,a+b+c=6,ab+bc+ac=9$. Prove that $0<a<1<b<3<c<4$ [hide="Solution"] Let $abc=k$, then $a,b,c\ (a<b<c)$ are the roots of cubic equation $x^3-6x^2+9x-k=0\Longleftrightarrow x(x-3)^2=k$ that is to say, $a,b,c\ (a<b<c)$ are the $x$-coordinates of the interception of points between $y=x(x-3)^2$ and $y=k$. $y=x(x-3)^2$ have local maximuml value of $4$ at $x=1$ and local minimum value of $0$ at $x=3$. Since the $x$-coordinate of the interception point between $y=x(x-3)^2$ and $y=4$ which is the tangent line at local maximum point $(1,4)$ is a point $(4,4)$,Moving the line $y=k$ so that the two graphs $y=x(x-3)^2$ and $y=k$ have the distinct three interception points,we can find that the range of $a,b,c$ are $0<a<1,1<b<3,3<c<4 $,we are done.[/hide]

For $ s,t \in \mathbb{N}$, consider the set $ M\equal{}\{ (x,y) \in \mathbb{N} ^2 | 1 \le x \le s, 1 \le y \le t \}$. Find the number of rhombi with the vertices in $ M$ and the diagonals parallel to the coordinate axes.

Let $f(x) = ax^2 + bx+ c$ and $g(x) = cx^2 + bx + a$. If $|f(0)| \leq 1, |f(1)| \leq 1, |f(-1)| \leq 1$, prove that for $|x| \leq 1$, [b](a)[/b] $|f(x)| \leq 5/4$, [b](b)[/b] $|g(x)| \leq 2$.

For constants $a,\ b,\ c,\ d$ consider a process such that the point $(p,\ q)$ is mapped onto the point $(ap+bq,\ cp+dq)$. Note : $(a,\ b,\ c,\ d)\neq (1,\ 0,\ 0,\ 1)$. Let $k$ be non-zero constant. All points of the parabola $C: y=x^2-x+k$ are mapped onto $C$ by the process. (1) Find $a,\ b,\ c,\ d$. (2) Let $A'$ be the image of the point $A$ by the process. Find all values of $k$ and the coordinates of $A$ such that the tangent line of $C$ at $A$ and the tangent line of $C$ at $A'$ formed by the process are perpendicular at the origin.

Consider in the plane a finite set of segments such that the sum of their lengths is less than $\sqrt{2}$. Prove that there exists an infinite unit square grid covering the plane such that the lines defining the grid do not intersect any of the segments. [i]Vasile Pop[/i]

The coordinate of an object is given as a function of time by $x = 8t - 3t^2$, where $x$ is in meters and $t$ is in seconds. Its average velocity over the interval from $ t = 1$ to $t = 2 \text{ s}$ is $ \textbf{(A)}\ -2\text{ m/s}\qquad\textbf{(B)}\ -1\text{ m/s}\qquad\textbf{(C)}\ -0.5\text{ m/s}\qquad\textbf{(D)}\ 0.5\text{ m/s}\qquad\textbf{(E)}\ 1\text{ m/s} $

Let $r$ be a nonzero real number. The values of $z$ which satisfy the equation \[ r^4z^4 + (10r^6-2r^2)z^2-16r^5z+(9r^8+10r^4+1) = 0 \] are plotted on the complex plane (i.e. using the real part of each root as the x-coordinate and the imaginary part as the y-coordinate). Show that the area of the convex quadrilateral with these points as vertices is independent of $r$, and find this area.

Compute the number of lattice points bounded by the quadrilateral formed by the points $(0, 0)$, $(0, 140)$, $(140, 0)$, and $(100, 100)$ (including the quadrilateral itself). A lattice point on the $xy$ -plane is a point $(x, y)$, where both $x$ and $y$ are integers.

Players $A$ and $B$ play the following game on the coordinate plane. Player $A$ hides a nut at one of the points with integer coordinates, and player $B$ tries to find this hidden nut. In one move $B$ can choose three different points with integer coordinates, then $A$ tells whether these three points together with the nut's point lie on the same circle or not. Can $B$ be guaranteed to find the nut in a finite number of moves?

Let $n \geq2$ be an integer number and $D_n$ the set of all the points $(x,y)$ in the plane such that its coordinates are integer numbers with: $-n \le x \le n$ and $-n \le y \le n$. (a) There are three possible colors in which the points of $D_n$ are painted with (each point has a unique color). Show that with any distribution of the colors, there are always two points of $D_n$ with the same color such that the line that contains them does not go through any other point of $D_n$. (b) Find a way to paint the points of $D_n$ with 4 colors such that if a line contains exactly two points of $D_n$, then, this points have different colors.

Let $ABC$ be a triangle with sides $AB = 6$, $BC = 10$, and $CA = 8$. Let $M$ and $N$ be the midpoints of $BA$ and $BC$, respectively. Choose the point $Y$ on ray $CM$ so that the circumcircle of triangle $AMY$ is tangent to $AN$. Find the area of triangle $NAY$.

Point $P$ is taken inside the square $ABCD$ such that $BP + DP=25$, $CP - AP = 15$ and $\angle$[b]ABP =[/b] $\angle$[b]ADP[/b]. What is the radius of the circumcircle of $ABCD$?

Let $n$ be a positive integer. Given $n^2$ points in a unit square, prove that there exists a broken line of length $2n + 1$ that passes through all the points. [i]Allen Yuan[/i]

Triangles $ ABC$ and $ ADE$ have areas $ 2007$ and $ 7002,$ respectively, with $ B \equal{} (0,0),$ $ C \equal{} (223,0),$ $ D \equal{} (680,380),$ and $ E \equal{} (689,389).$ What is the sum of all possible x-coordinates of $ A?$ $ \textbf{(A)}\ 282 \qquad \textbf{(B)}\ 300 \qquad \textbf{(C)}\ 600 \qquad \textbf{(D)}\ 900 \qquad \textbf{(E)}\ 1200$