$PQ$ is a chord of parabola $y^2=2px(p>0)$ and $PQ$ pass its focus $F$. Line $l$ is its directrix. Projection of $PQ$ on $l$ is $MN$. The area of curved surface that $PQ$ rotate around $l$ is $S_1$, the area of spherical surface of the ball with diameter of $MN$ is $S_2$, then $\text{(A)}S_1>S_2\qquad\text{(B)}S_1<S_2\qquad\text{(C)}S_1\geq S_2\qquad\text{(D)}$ Not sure

Kostya marked the points $A(0, 1), B(1, 0), C(0, 0)$ in the coordinate plane. On the legs of the triangle ABC he marked the points with coordinates $(\frac{1}{2},0), (\frac{1}{3},0), \cdots, (\frac{1}{n+1},0)$ and $(0,\frac{1}{2}), (0,\frac{1}{3}), \cdots, (0,\frac{1}{n+1}).$ Then Kostya joined each pair of marked points with a segment. Sasha drew a $1 \times n$ rectangle and joined with a segment each pair of integer points on its border. As a result both the triangle and the rectangle are divided into polygons by the segments drawn. Who has the greater number of polygons: Sasha or Kostya? [i](M. Alekseyev )[/i]

Consider the infinite grid of lattice points in $\mathbb{Z}^3$. Little D and Big Z play a game, where Little D first loses a shoe on an unmunched point in the grid. Then, Big Z munches a shoe-free plane perpendicular to one of the coordinate axes. They continue to alternate turns in this fashion, with Little D's goal to lose a shoe on each of $n$ consecutive lattice points on a line parallel to one of the coordinate axes. Determine all $n$ for which Little D can accomplish his goal. [i]David Yang.[/i]

In a triangle $ABC$, let $I$ be its incenter; $Q$ the point at which the incircle touches the line $AC$; $E$ the midpoint of $AC$ and $K$ the orthocenter of triangle $BIC$. Prove that the line $KQ$ is perpendicular to the line $IE$.

Externally tangent circles with centers at points $A$ and $B$ have radii of lengths $5$ and $3$, respectively. A line externally tangent to both circles intersects ray $AB$ at point $C$. What is $BC$? $ \textbf{(A)}\ 4 \qquad\textbf{(B)}\ 4.8 \qquad\textbf{(C)}\ 10.2 \qquad\textbf{(D)}\ 12 \qquad\textbf{(E)}\ 14.4 $

Is it possible to split all straight lines in a plane into the pairs of perpendicular lines, so that every line belongs to a single pair?

Niki and Kyle play a triangle game. Niki first draws $\triangle ABC$ with area $1$, and Kyle picks a point $X$ inside $\triangle ABC$. Niki then draws segments $\overline{DG}$, $\overline{EH}$, and $\overline{FI}$, all through $X$, such that $D$ and $E$ are on $\overline{BC}$, $F$ and $G$ are on $\overline{AC}$, and $H$ and $I$ are on $\overline{AB}$. The ten points must all be distinct. Finally, let $S$ be the sum of the areas of triangles $DEX$, $FGX$, and $HIX$. Kyle earns $S$ points, and Niki earns $1-S$ points. If both players play optimally to maximize the amount of points they get, who will win and by how much?

Let $\omega$ be incircle of $ABC$. $P$ and $Q$ are on $AB$ and $AC$, such that $PQ$ is parallel to $BC$ and is tangent to $\omega$. $AB,AC$ touch $\omega$ at $F,E$. Prove that if $M$ is midpoint of $PQ$, and $T$ is intersection point of $EF$ and $BC$, then $TM$ is tangent to $\omega$. [i]By Ali Khezeli[/i]

For a positive integer $n$, let denote $C_n$ the figure formed by the inside and perimeter of the circle with center the origin, radius $n$ on the $x$-$y$ plane. Denote by $N(n)$ the number of a unit square such that all of unit square, whose $x,\ y$ coordinates of 4 vertices are integers, and the vertices are included in $C_n$. Prove that $\lim_{n\to\infty} \frac{N(n)}{n^2}=\pi$.

Calculate the lower bound of the areas of convex hexagons whose vertices all have integer coordinates.

Let $P$ be the quadratic function such that $P(0) = 7$, $P(1) = 10$, and $P(2) = 25$. If $a$, $b$, and $c$ are integers such that every positive number $x$ less than 1 satisfies \[ \sum_{n = 0}^\infty P(n) x^n = \frac{ax^2 + bx + c}{{(1 - x)}^3}, \] compute the ordered triple $(a, b, c)$.

There is a complex number $ z$ with imaginary part $ 164$ and a positive integer $ n$ such that \[ \frac {z}{z \plus{} n} \equal{} 4i. \]Find $ n$.

In rectangular coodinate system $Oxy$, consider the line $y=3x$ and point $A(4,3)$. Find on the line $y=3x$, point $B\ne O$ such that the area of triangle $OBC$ is the minimum possible, where $C= AB\cap Ox$.

The problems are really difficult to find online, so here are the problems. P1. It is known that two positive integers $m$ and $n$ satisfy $10n - 9m = 7$ dan $m \leq 2018$. The number $k = 20 - \frac{18m}{n}$ is a fraction in its simplest form. a) Determine the smallest possible value of $k$. b) If the denominator of the smallest value of $k$ is (equal to some number) $N$, determine all positive factors of $N$. c) On taking one factor out of all the mentioned positive factors of $N$ above (specifically in problem b), determine the probability of taking a factor who is a multiple of 4. I added this because my translation is a bit weird. [hide=Indonesian Version] Diketahui dua bilangan bulat positif $m$ dan $n$ dengan $10n - 9m = 7$ dan $m \leq 2018$. Bilangan $k = 20 - \frac{18m}{n}$ merupakan suatu pecahan sederhana. a) Tentukan bilangan $k$ terkecil yang mungkin. b) Jika penyebut bilangan $k$ terkecil tersebut adalah $N$, tentukan semua faktor positif dari $N$. c) Pada pengambilan satu faktor dari faktor-faktor positif $N$ di atas, tentukan peluang terambilnya satu faktor kelipatan 4.[/hide] P2. Let the functions $f, g : \mathbb{R} \to \mathbb{R}$ be given in the following graphs. [hide=Graph Construction Notes]I do not know asymptote, can you please help me draw the graphs? Here are its complete description: For both graphs, draw only the X and Y-axes, do not draw grids. Denote each axis with $X$ or $Y$ depending on which line you are referring to, and on their intercepts, draw a small node (a circle) then mark their $X$ or $Y$ coordinates only (since their other coordinates are definitely 0). Graph (1) is the function $f$, who is a quadratic function with -2 and 4 as its $X$-intercepts and 4 as its $Y$-intercept. You also put $f$ right besides the curve you have, preferably just on the right-up direction of said curve. Graph (2) is the function $g$, which is piecewise. For $x \geq 0$, $g(x) = \frac{1}{2}x - 2$, whereas for $x < 0$, $g(x) = - x - 2$. You also put $g$ right besides the curve you have, on the lower right of the line, on approximately $x = 2$.[/hide] Define the function $g \circ f$ with $(g \circ f)(x) = g(f(x))$ for all $x \in D_f$ where $D_f$ is the domain of $f$. a) Draw the graph of the function $g \circ f$. b) Determine all values of $x$ so that $-\frac{1}{2} \leq (g \circ f)(x) \leq 6$. P3. The quadrilateral $ABCD$ has side lengths $AB = BC = 4\sqrt{3}$ cm and $CD = DA = 4$ cm. All four of its vertices lie on a circle. Calculate the area of quadrilateral $ABCD$. P4. There exists positive integers $x$ and $y$, with $x < 100$ and $y > 9$. It is known that $y = \frac{p}{777} x$, where $p$ is a 3-digit number whose number in its tens place is 5. Determine the number/quantity of all possible values of $y$. P5. The 8-digit number $\overline{abcdefgh}$ (the original problem does not have an overline, which I fixed) is arranged from the set $\{1, 2, 3, 4, 5, 6, 7, 8\}$. Such number satisfies $a + c + e + g \geq b + d + f + h$. Determine the quantity of different possible (such) numbers.

Squares $ BCA_{1}A_{2}$ , $ CAB_{1}B_{2}$ , $ ABC_{1}C_{2}$ are outwardly drawn on sides of triangle $ \triangle ABC$. If $ AB_{1}A'C_{2}$ , $ BC_{1}B'A_{2}$ , $ CA_{1}C'B_{2}$ are parallelograms then prove that: (i) Lines $ BC$ and $ AA'$ are orthogonal. (ii)Triangles $ \triangle ABC$ and $ \triangle A'B'C'$ have common centroid

The graph of the line $ y \equal{} mx \plus{} b$ is shown. Which of the following is true? [asy]import math; unitsize(8mm); defaultpen(linewidth(1pt)+fontsize(6pt)); dashed=linetype("4 4")+linewidth(.8pt); draw((-2,-2.5)--(-2,2.5)--(2.5,2.5)--(2.5,-2.5)--cycle,white); label("$-1$",(-1,0),SW); label("$1$",(1,0),SW); label("$2$",(2,0),SW); label("$1$",(0,1),NE); label("$2$",(0,2),NE); label("$-1$",(0,-1),SW); label("$-2$",(0,-2),SW); drawline((0,0),(1,0)); drawline((0,0),(0,1)); drawline((0,0.8),(1.8,0)); drawline((1,0),(1,1),dashed); drawline((2,0),(2,1),dashed); drawline((-1,0),(-1,1),dashed); drawline((0,1),(1,1),dashed); drawline((0,2),(1,2),dashed); drawline((0,-1),(1,-1),dashed); drawline((0,-2),(1,-2),dashed);[/asy] $ \textbf{(A)}\ mb < \minus{} 1 \qquad \textbf{(B)}\ \minus{} 1 < mb < 0 \qquad \textbf{(C)}\ mb \equal{} 0$ $ \textbf{(D)}\ 0 < mb < 1\qquad \textbf{(E)}\ mb > 1$

Given are three points $A(2,\ 0,\ 2),\ B(1,\ 1,\ 0),\ C(0,\ 0,\ 3)$ in the coordinate space. Find the volume of the solid of a triangle $ABC$ generated by a rotation about $z$-axis.

In the coordinate plane a rectangle with vertices $ (0, 0),$ $ (m, 0),$ $ (0, n),$ $ (m, n)$ is given where both $ m$ and $ n$ are odd integers. The rectangle is partitioned into triangles in such a way that [i](i)[/i] each triangle in the partition has at least one side (to be called a “good” side) that lies on a line of the form $ x \equal{} j$ or $ y \equal{} k,$ where $ j$ and $ k$ are integers, and the altitude on this side has length 1; [i](ii)[/i] each “bad” side (i.e., a side of any triangle in the partition that is not a “good” one) is a common side of two triangles in the partition. Prove that there exist at least two triangles in the partition each of which has two good sides.

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 a plane we have $n$ lines, no two of which are parallel or perpendicular, and no three of which are concurrent. A cartesian system of coordinates is chosen for the plane with one of the lines as the $x$-axis. A point $P$ is located at the origin of the coordinate system and starts moving along the positive $x$-axis with constant velocity. Whenever $P$ reaches the intersection of two lines, it continues along the line it just reached in the direction that increases its $x$-coordinate. Show that it is possible to choose the system of coordinates in such a way that $P$ visits points from all $n$ lines.

Let line $ AC$ be perpendicular to line $ CE$. Connect $ A$ to $ D$, the midpoint of $ CE$, and connect $ E$ to $ B$, the midpoint of $ AC$. If $ AD$ and $ EB$ intersect in point $ F$, and $ \overline{BC} \equal{} \overline{CD} \equal{} 15$ inches, then the area of triangle $ DFE$, in square inches, is: $ \textbf{(A)}\ 50 \qquad \textbf{(B)}\ 50\sqrt {2} \qquad \textbf{(C)}\ 75 \qquad \textbf{(D)}\ \frac {15}{2}\sqrt {105} \qquad \textbf{(E)}\ 100$

A $n \times n \times n$ cube is constructed using $1 \times 1 \times 1$ cubes, some of them black and others white, such that in each $n \times 1 \times 1$, $1 \times n \times 1$, and $1 \times 1 \times n$ subprism there are exactly two black cubes, and they are separated by an even number of white cubes (possibly 0). Show it is possible to replace half of the black cubes with white cubes such that each $n \times 1 \times 1$, $1 \times n \times 1$ and $1 \times 1 \times n$ subprism contains exactly one black cube.

Goldfish are sold at $ 15$ cents each. The rectangular coordinate graph showing the cost of $ 1$ to $ 12$ goldfish is: $ \textbf{(A)}\ \text{a straight line segment} \qquad \\ \textbf{(B)}\ \text{a set of horizontal parallel line segments}\qquad \\ \textbf{(C)}\ \text{a set of vertical parallel line segments}\qquad \\ \textbf{(D)}\ \text{a finite set of distinct points}\qquad \textbf{(E)}\ \text{a straight line}$

Calculate the area of the intersection of the interior of the ellipse $\frac{x^2}{16}+ \frac{y^2}{4}= 1$ with the circle bounded by the circumference $(x -2)^2 + (y - 1)^2 = 5$.

Let $A$, $B$ and $C$ be equidistant points on the circumference of a circle of unit radius centered at $O$, and let $P$ be any point in the circle's interior. Let $a$, $b$, $c$ be the distances from $P$ to $A$, $B$, $C$ respectively. Show that there is a triangle with side lengths $a$, $b$, $c$, and that the area of this triangle depends only on the distance from $P$ to $O$.