Plane $A$ passes through the points $(1, 0, 0)$, $(0, 1, 0)$, and $(0, 0, 1)$. Plane $B$ is parallel to plane $A$, but passes through the point $(1, 0, 1)$. Find the distance between planes $A$ and $B$.

A lattice point is a point on the coordinate plane with integer coefficients. Prove or disprove : there exists a finite set $S$ of lattice points such that for every line $l$ in the plane with slope $0,1,-1$, or undefined, either $l$ and $S$ intersect at exactly $2022$ points, or they do not intersect.

A cubical cake with edge length $ 2$ inches is iced on the sides and the top. It is cut vertically into three pieces as shown in this top view, where $ M$ is the midpoint of a top edge. The piece whose top is triangle $ B$ contains $ c$ cubic inches of cake and $ s$ square inches of icing. What is $ c\plus{}s$? [asy]unitsize(1cm); defaultpen(linewidth(.8pt)+fontsize(8pt)); draw((-1,-1)--(1,-1)--(1,1)--(-1,1)--cycle); draw((1,1)--(-1,0)); pair P=foot((1,-1),(1,1),(-1,0)); draw((1,-1)--P); draw(rightanglemark((-1,0),P,(1,-1),4)); label("$M$",(-1,0),W); label("$C$",(-0.1,-0.3)); label("$A$",(-0.4,0.7)); label("$B$",(0.7,0.4));[/asy]$ \textbf{(A)}\ \frac{24}{5} \qquad \textbf{(B)}\ \frac{32}{5} \qquad \textbf{(C)}\ 8\plus{}\sqrt5 \qquad \textbf{(D)}\ 5\plus{}\frac{16\sqrt5}{5} \qquad \textbf{(E)}\ 10\plus{}5\sqrt5$

On the plane, a Cartesian coordinate system is chosen. Given points $ A_1,A_2,A_3,A_4$ on the parabola $ y \equal{} x^2$, and points $ B_1,B_2,B_3,B_4$ on the parabola $ y \equal{} 2009x^2$. Points $ A_1,A_2,A_3,A_4$ are concyclic, and points $ A_i$ and $ B_i$ have equal abscissas for each $ i \equal{} 1,2,3,4$. Prove that points $ B_1,B_2,B_3,B_4$ are also concyclic.

At most how many points with integer coordinates are there over a circle with center of $(\sqrt{20}, \sqrt{10})$ in the $xy$-plane? $ \textbf{(A)}\ 8 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 1 \qquad\textbf{(E)}\ \text{None} $

What is the graph of $y^4+1=x^4+2y^2$ in the coordinate plane? $ \textbf{(A)}\ \textbf{Two intersecting parabolas} \qquad \textbf{(B)}\ \textbf{Two nonintersecting parabolas} \qquad \textbf{(C)}\ \textbf{Two intersecting circles} \qquad \textbf{(D)}\ \textbf{A circle and a hyperbola} \qquad \textbf{(E)}\ \textbf{A circle and two parabolas}$

Let $ AD$ is centroid of $ ABC$ triangle. Let $ (d)$ is the perpendicular line with $ AD$. Let $ M$ is a point on $ (d)$. Let $ E, F$ are midpoints of $ MB, MC$ respectively. The line through point $ E$ and perpendicular with $ (d)$ meet $ AB$ at $ P$. The line through point $ F$ and perpendicular with $ (d)$ meet $ AC$ at $ Q$. Let $ (d')$ is a line through point $ M$ and perpendicular with $ PQ$. Prove $ (d')$ always pass a fixed point.

Find the complex numbers $ a,b $ having the properties that $ |a|=|b|=1=\bar{a} +\bar{b} -ab. $

Does there exist an infinite set $ M$ of straight lines on the coordinate plane such that (i) no two lines are parallel, and (ii) for any integer point there is a line from $ M$ containing it?

A point in the plane with a cartesian coordinate system is called a [i]mixed point[/i] if one of its coordinates is rational and the other one is irrational. Find all polynomials with real coefficients such that their graphs do not contain any mixed point.

In the Cartesian plane, let $S_{i,j} = \{(x,y)\mid i \le x \le j\}$. For $i=0,1,\ldots,2012$, color $S_{i,i+1}$ pink if $i$ is even and gray if $i$ is odd. For a convex polygon $P$ in the plane, let $d(P)$ denote its pink density, i.e. the fraction of its total area that is pink. Call a polygon $P$ [i]pinxtreme[/i] if it lies completely in the region $S_{0,2013}$ and has at least one vertex on each of the lines $x=0$ and $x=2013$. Given that the minimum value of $d(P)$ over all non-degenerate convex pinxtreme polygons $P$ in the plane can be expressed in the form $\frac{(1+\sqrt{p})^2}{q^2}$ for positive integers $p,q$, find $p+q$. [i]Victor Wang.[/i]

Let $A=(0,0)$ and $B=(b,2)$ be points on the coordinate plane. Let $ABCDEF$ be a convex equilateral hexagon such that $\angle FAB=120^\circ,$ $\overline{AB}\parallel \overline{DE},$ $\overline{BC}\parallel \overline{EF,}$ $\overline{CD}\parallel \overline{FA},$ and the y-coordinates of its vertices are distinct elements of the set $\{0,2,4,6,8,10\}.$ The area of the hexagon can be written in the form $m\sqrt{n},$ where $m$ and $n$ are positive integers and n is not divisible by the square of any prime. Find $m+n.$

Divide a $ 2\times 4 $ rectangle into $ 8 $ unit squares to obtain a set of $ 15 $ vertices denoted by $ \mathcal{M} . $ Find the points $ A\in\mathcal{M} $ that have the property that the set $ \mathcal{M}\setminus \{ A\} $ can form $ 7 $ pairs $ \left( A_1,B_1\right) ,\left( A_2,B_2\right) ,\ldots ,\left( A_7,B_7\right)\in\mathcal{M}\times\mathcal{M} $ such that $$ \overrightarrow{A_1B_1} +\overrightarrow{A_2B_2} +\cdots +\overrightarrow{A_7B_7} =\overrightarrow{O} . $$

The graphs of the equations \[ y=k, \qquad y=\sqrt{3}x+2k, \qquad y=-\sqrt{3}x+2k, \] are drawn in the coordinate plane for $k=-10,-9,-8,\ldots,9,10.$ These 63 lines cut part of the plane into equilateral triangles of side $2/\sqrt{3}.$ How many such triangles are formed?

On a board are drawn the points $A,B,C,D$. Yetti constructs the points $A^\prime,B^\prime,C^\prime,D^\prime$ in the following way: $A^\prime$ is the symmetric of $A$ with respect to $B$, $B^\prime$ is the symmetric of $B$ wrt $C$, $C^\prime$ is the symmetric of $C$ wrt $D$ and $D^\prime$ is the symmetric of $D$ wrt $A$. Suppose that Armpist erases the points $A,B,C,D$. Can Yetti rebuild them? $\star \, \, \star \, \, \star$ [b]Note.[/b] [i]Any similarity to real persons is purely accidental.[/i]

For $n$ an odd positive integer, the unit squares of an $n\times n$ chessboard are coloured alternately black and white, with the four corners coloured black. A [i]tromino[/i] is an $L$-shape formed by three connected unit squares. $(a)$ For which values of $n$ is it possible to cover all the black squares with non-overlapping trominoes lying entirely on the chessboard? $(b)$ When it is possible, find the minimum number of trominoes needed.

In a tetrahedral $ABCD$, given that $\angle ADB=\angle BDC =\angle CDA=\frac{\pi}{3}$, $AD=BD=3$, and $CD=2$. Find the radius of the circumsphere of $ABCD$.

Let $A,B,C$ be three points with integer coordinates in the plane and $K$ a circle with radius $R$ passing through $A,B,C$. Show that $AB\cdot BC\cdot CA\ge 2R$, and if the centre of $K$ is in the origin of the coordinates, show that $AB\cdot BC\cdot CA\ge 4R$.

Let $\mathcal P$ be the set of all points in $\mathbb R^n$ with rational coordinates. For the points $A,B \in \mathcal l{P}$, one can move from $A$ to $B$ if the distance $AB$ is $1$. Prove that every point in $\mathcal l{ P}$ can be reached from any other point in $\mathcal{P}$ by a finite sequence of moves if and only if $n \geq 5$.

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}\]

Polyhedron $ABCDEFG$ has six faces. Face $ABCD$ is a square with $AB=12;$ face $ABFG$ is a trapezoid with $\overline{AB}$ parallel to $\overline{GF},$ $BF=AG=8,$ and $GF=6;$ and face $CDE$ has $CE=DE=14.$ The other three faces are $ADEG, BCEF,$ and $EFG.$ The distance from $E$ to face $ABCD$ is 12. Given that $EG^2=p-q\sqrt{r},$ where $p, q,$ and $r$ are positive integers and $r$ is not divisible by the square of any prime, find $p+q+r.$

Let $\triangle ABC$ have $AB=6$, $BC=7$, and $CA=8$, and denote by $\omega$ its circumcircle. Let $N$ be a point on $\omega$ such that $AN$ is a diameter of $\omega$. Furthermore, let the tangent to $\omega$ at $A$ intersect $BC$ at $T$, and let the second intersection point of $NT$ with $\omega$ be $X$. The length of $\overline{AX}$ can be written in the form $\tfrac m{\sqrt n}$ for positive integers $m$ and $n$, where $n$ is not divisible by the square of any prime. Find $100m+n$. [i]Proposed by David Altizio[/i]

A marker is placed at the origin of an integer lattice. Calvin and Hobbes play the following game. Calvin starts the game and each of them takes turns alternatively. At each turn, one can choose two (not necessarily distinct) integers $a, b$, neither of which was chosen earlier by any player and move the marker by $a$ units in the horizontal direction and $b$ units in the vertical direction. Hobbes wins if the marker is back at the origin any time after the first turn. Prove or disprove that Calvin can prevent Hobbes from winning. Note: A move in the horizontal direction by a positive quantity will be towards the right, and by a negative quantity will be towards the left (and similar directions in the vertical case as well).

A semicircle of diameter $ 1$ sits at the top of a semicircle of diameter $ 2$, as shown. The shaded area inside the smaller semicircle and outside the larger semicircle is called a lune. Determine the area of this lune. [asy]unitsize(2.5cm); defaultpen(fontsize(10pt)+linewidth(.8pt)); filldraw(Circle((0,.866),.5),grey,black); label("1",(0,.866),S); filldraw(Circle((0,0),1),white,black); draw((-.5,.866)--(.5,.866),linetype("4 4")); clip((-1,0)--(1,0)--(1,2)--(-1,2)--cycle); draw((-1,0)--(1,0)); label("2",(0,0),S);[/asy]$ \textbf{(A)}\ \frac {1}{6}\pi \minus{} \frac {\sqrt {3}}{4} \qquad \textbf{(B)}\ \frac {\sqrt {3}}{4} \minus{} \frac {1}{12}\pi \qquad \textbf{(C)}\ \frac {\sqrt {3}}{4} \minus{} \frac {1}{24}\pi\qquad\textbf{(D)}\ \frac {\sqrt {3}}{4} \plus{} \frac {1}{24}\pi$ $ \textbf{(E)}\ \frac {\sqrt {3}}{4} \plus{} \frac {1}{12}\pi$

Aaron the ant walks on the coordinate plane according to the following rules. He starts at the origin $p_0=(0,0)$ facing to the east and walks one unit, arriving at $p_1=(1,0)$. For $n=1,2,3,\dots$, right after arriving at the point $p_n$, if Aaron can turn $90^\circ$ left and walk one unit to an unvisited point $p_{n+1}$, he does that. Otherwise, he walks one unit straight ahead to reach $p_{n+1}$. Thus the sequence of points continues $p_2=(1,1), p_3=(0,1), p_4=(-1,1), p_5=(-1,0)$, and so on in a counterclockwise spiral pattern. What is $p_{2015}$? $ \textbf{(A) } (-22,-13)\qquad\textbf{(B) } (-13,-22)\qquad\textbf{(C) } (-13,22)\qquad\textbf{(D) } (13,-22)\qquad\textbf{(E) } (22,-13) $