[b]polyhedral[/b] we call a $12$-gon in plane good whenever: first, it should be regular, second, it's inner plane must be filled!!, third, it's center must be the origin of the coordinates, forth, it's vertices must have points $(0,1)$,$(1,0)$,$(-1,0)$ and $(0,-1)$. find the faces of the [u]massivest[/u] polyhedral that it's image on every three plane $xy$,$yz$ and $zx$ is a good $12$-gon. (it's obvios that centers of these three $12$-gons are the origin of coordinates for three dimensions.) time allowed for this question is 1 hour.

Circles $\mathcal{C}_1$, $\mathcal{C}_2$, and $\mathcal{C}_3$ have their centers at (0,0), (12,0), and (24,0), and have radii 1, 2, and 4, respectively. Line $t_1$ is a common internal tangent to $\mathcal{C}_1$ and $\mathcal{C}_2$ and has a positive slope, and line $t_2$ is a common internal tangent to $\mathcal{C}_2$ and $\mathcal{C}_3$ and has a negative slope. Given that lines $t_1$ and $t_2$ intersect at $(x,y)$, and that $x=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$.

The vertices of the convex quadrilateral $ABCD$ lie on the parabola $y=x^2$. It is known that $ABCD$ is cyclic and $AC$ is a diameter of its circumcircle. Let $M$ and $N$ be the midpoints of the diagonals of $AC$ and $BD$ respectively. Find the length of the projection of the segment $MN$ on the axis $Oy$.

Several points are given in the plane. Suppose that for any three of them, there exists an orthogonal coordinate system (determined by the two axes and the unit length) in which these three points have integer coordinates. Prove that there exists an orthogonal coordinate system in which all the given points have integer coordinates.

What is the minimum value of $ f(x) \equal{} |x \minus{} 1| \plus{} |2x \minus{} 1| \plus{} |3x \minus{} 1| \plus{} \cdots \plus{} |119x \minus{} 1|$? $ \textbf{(A)}\ 49 \qquad \textbf{(B)}\ 50 \qquad \textbf{(C)}\ 51 \qquad \textbf{(D)}\ 52 \qquad \textbf{(E)}\ 53$

Let $E$ be a set of $n$ points in the plane $(n \geq 3)$ whose coordinates are integers such that any three points from $E$ are vertices of a nondegenerate triangle whose centroid doesnt have both coordinates integers. Determine the maximal $n.$

In the usual coordinate system $ xOy$ a line $ d$ intersect the circles $ C_1:$ $ (x\plus{}1)^2\plus{}y^2\equal{}1$ and $ C_2:$ $ (x\minus{}2)^2\plus{}y^2\equal{}4$ in the points $ A,B,C$ and $ D$ (in this order). It is known that $ A\left(\minus{}\frac32,\frac{\sqrt3}2\right)$ and $ \angle{BOC}\equal{}60^{\circ}$. All the $ Oy$ coordinates of these $ 4$ points are positive. Find the slope of $ d$.

Circle $\Gamma$ is centered at $(0, 0)$ in the plane with radius $2022\sqrt3$. Circle $\Omega$ is centered on the $x$-axis, passes through the point $A = (6066, 0)$, and intersects $\Gamma$ orthogonally at the point $P = (x, y)$ with $y > 0$. If the length of the minor arc $AP$ on $\Omega$ can be expressed as $\frac{m\pi}{n}$ forrelatively prime positive integers $m, n$, find $m + n$. (Two circles intersect orthogonally at a point $P$ if the tangent lines at $P$ form a right angle.)

Build the set of points $( x, y )$ on coordinate plane, that satisfies equality: \[ \sqrt{1-x^2}+\sqrt{1-y^2}=2-x^2-y^2.\]

The graph of $ y \equal{} x^6 \minus{} 10x^5 \plus{} 29x^4 \minus{} 4x^3 \plus{} ax^2$ lies above the line $ y \equal{} bx \plus{} c$ except at three values of $ x$, where the graph and the line intersect. What is the largest of those values? $ \textbf{(A)}\ 4 \qquad \textbf{(B)}\ 5 \qquad \textbf{(C)}\ 6 \qquad \textbf{(D)}\ 7 \qquad \textbf{(E)}\ 8$

In the county some pairs of towns connected by two-way non-stop flight. From any town we can flight to any other (may be not on one flight). Gives, that if we consider any cyclic (i.e. beginning and finish towns match) route, consisting odd number of flights, and close all flights of this route, then we can found two towns, such that we can't fly from one to other. Proved, that we can divided all country on $4$ regions, such that any flight connected towns from other regions.

The graphs of $ y \equal{} \minus{}|x \minus{} a| \plus{} b$ and $ y \equal{} |x \minus{} c| \plus{} d$ intersect at points $ (2,5)$ and $ (8,3)$. Find $ a \plus{} c$. $ \textbf{(A)}\ 7\qquad \textbf{(B)}\ 8\qquad \textbf{(C)}\ 10\qquad \textbf{(D)}\ 13\qquad \textbf{(E)}\ 18$

Given $S$ be the finite lattice (with integer coordinate) set in the $xy$-plane. $A$ is the subset of $S$ with most elements such that the line connecting any two points in $A$ is not parallel to $x$-axis or $y$-axis. $B$ is the subset of integer with least elements such that for any $(x,y)\in S$, $x \in B$ or $y \in B$ holds. Prove that $|A| \geq |B|$.

Find the smallest natural number $n$ that the following statement holds : Let $A$ be a finite subset of $\mathbb R^{2}$. For each $n$ points in $A$ there are two lines including these $n$ points. All of the points lie on two lines.

Given in the plane is a lattice and a grid rectangle with sides parallel to the coordinate axes. We divide the rectangle into grid triangles with area $\frac12$. Prove that the number of right angled triangles is at least twice as much as the shorter side of the rectangle. (A grid polygon is a polygon such that both coordinates of each vertex is an integer.)

In the coordinate plane, given a circle $K: x^2+y^2=1,\ C: y=x^2-2$. Let $l$ be the tangent line of $K$ at $P(\cos \theta,\ \sin \theta)\ (\pi<\theta <2\pi).$ Find the minimum area of the part enclosed by $l$ and $C$.

$ABCDA_{1}B_{1}C_{1}D_{1}$ is a cube with side length $4a$. Points $E$ and $F$ are taken on $(AA_{1})$ and $(BB_{1})$ such that $AE=B_{1}F=a$. $G$ and $H$ are midpoints of $(A_{1}B_{1})$ and $(C_{1}D_{1})$, respectively. Find the minimum value of the $CP+PQ$, where $P\in[GH]$ and $Q\in[EF]$.

Ayase randomly picks a number $x \in (0, 1]$ with uniform probability. He then draws the six points $(0, 0, 0),(x, 0, 0),(2x, 3x, 0),(5, 5, 2),(7, 3, 0),(9, 1, 4)$. If the expected value of the volume of the convex polyhedron formed by these six points can be written as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$, find $m + n$

The distance between two cells of an infinite chessboard is defined as the minimum nuber to moves needed for a king for move from one to the other.One the board are chosen three cells on a pairwise distances equal to $ 100$. How many cells are there that are on the distance $ 50$ from each of the three cells?

$56$ lines are drawn on a plane such that no three of them are concurrent. If the lines intersect at exactly $594$ points, what is the maximum number of them that could have the same slope?

The number of points common to the graphs of \[(x-y+2)(3x+y-4)=0\text{ and }(x+y-2)(2x-5y+7)=0\] is: $\textbf{(A) }2\qquad \textbf{(B) }4\qquad \textbf{(C) }6\qquad \textbf{(D) }16\qquad \textbf{(E) }\text{infinite}$

The vertices of a cube have coordinates $(0,0,0),(0,0,4),(0,4,0),(0,4,4),(4,0,0)$,$(4,0,4),(4,4,0)$, and $(4,4,4)$. A plane cuts the edges of this cube at the points $(0,2,0),(1,0,0),(1,4,4)$, and two other points. Find the coordinates of the other two points.

Define a parabola $C$ by $y=x^2+1$ on the coordinate plane. Let $s,\ t$ be real numbers with $t<0$. Denote by $l_1,\ l_2$ the tangent lines drawn from the point $(s,\ t)$ to the parabola $C$. (1) Find the equations of the tangents $l_1,\ l_2$. (2) Let $a$ be positive real number. Find the pairs of $(s,\ t)$ such that the area of the region enclosed by $C,\ l_1,\ l_2$ is $a$.

Let $O_1$ and $O_2$ be concentric circles with radii 4 and 6, respectively. A chord $AB$ is drawn in $O_1$ with length $2$. Extend $AB$ to intersect $O_2$ in points $C$ and $D$. Find $CD$.

Charlotte the cat is placed at the origin of the coordinate plane, such that the positive $x$ direction is pointing east, and the positive $y$ direction is pointing north. Then, every single lattice square (a unit square with vertices all on lattice points) in the first quadrant whose southwest vertex is a lattice point with both odd coordinates is completely removed. Charlotte can traverse the coordinate plane by drawing a segment between two valid vertices, given that they do not intersect a lattice square that has not been removed. Let $P_1$ and $P_2$ denote the distances of the first and second shortest paths Charlotte can take to $(5,7),$ respectively. Find $P_1-P_2.$ [i]Tiebreaker #4[/i]