For which integers $n \geq 3$ does there exist a regular $n$-gon in the plane such that all its vertices have integer coordinates in a rectangular coordinate system?

Every point with integer coordinates in the plane is the center of a disk with radius $1/1000$. (1) Prove that there exists an equilateral triangle whose vertices lie in different discs. (2) Prove that every equilateral triangle with vertices in different discs has side-length greater than $96$. [i]Radu Gologan, Romania[/i] [hide="Remark"] The "> 96" in [b](b)[/b] can be strengthened to "> 124". By the way, part [b](a)[/b] of this problem is the place where I used [url=http://mathlinks.ro/viewtopic.php?t=5537]the well-known "Dedekind" theorem[/url]. [/hide]

Q. A light source at the point $(0, 16)$ in the co-ordinate plane casts light in all directions. A disc(circle along ith it's interior) of radius $2$ with center at $(6, 10)$ casts a shadow on the X-axis. The length of the shadow can be written in the form $m\sqrt{n}$ where $m, n$ are positive integers and $n$ is squarefree. Find $m + n$.

$f$ is a function on the set of complex numbers such that $f(z)=1/(z*)$, where $z*$ is the complex conjugate of $z$. $S$ is the set of complex numbers $z$ such that the real part of $f(z)$ lies between $1/2020$ and $1/2018$. If $S$ is treated as a subset of the complex plane, the area of $S$ can be expressed as $m× \pi$ where $m$ is an integer. What is the value of $m$?

In a virtually-made world, each citizen, which is assumed to be a point (i.e. without area) and labelled as $1, 2, ...$. To fight against a pandemic, these citizens are required to get vaccinated. After they get vaccinated, they need to be observed for a period of time. Now assume the location that the citizens get observe is a circumference with radius $\frac{1}{4}$ on the plane. For the safety reason, it is required for distance between $m$-th citizen and $n$-th citizen $d_{m, n}$ satisfying the following: $(m+n)d_{m, n}\geq 1$ Here what we consider is the distance on the circumference i.e. the arc length of minor arc formed by two points. Then (a) Choose one of the following which fits the situation in reality. A. The location for observation can mostly have $8$ citizens. B. The location for observation can have the upper limit on the number of citizens which is larger than $8$. C. The location for observation can have any number of citizens. (b) Prove your answer in (a).

What is the perimeter of the boundary of the region consisting of all points which can be expressed as $(2u-3w,v+4w)$ with $0 \le u \le 1$, $0 \le v \le 1$, and $0 \le w \le 1$? \\ \\ $\textbf{(A) } 10\sqrt{3} \qquad \textbf{(B) } 10 \qquad \textbf{(C) } 12 \qquad \textbf{(D) } 18 \qquad \textbf{(E) } 16$

Consider the following subsets of the plane:$$C_1=\Big\{(x,y)~:~x>0~,~y=\frac1x\Big\} $$ and $$C_2=\Big\{(x,y)~:~x<0~,~y=-1+\frac1x\Big\}$$ Given any two points $P=(x,y)$ and $Q=(u,v)$ of the plane, their distance $d(P,Q)$ is defined by $$d(P,Q)=\sqrt{(x-u)^2+(y-v)^2}$$ Show that there exists a unique choice of points $P_0\in C_1$ and $Q_0\in C_2$ such that $$d(P_0,Q_0)\leqslant d(P,Q)\quad\forall ~P\in C_1~\text{and}~Q\in C_2.$$

A triangle in the coordinate plane has vertices $A(\log_21,\log_22)$, $B(\log_23,\log_24)$, and $C(\log_27,\log_28)$. What is the area of $\triangle ABC$? $ \textbf{(A) }\log_2\frac{\sqrt3}7\qquad \textbf{(B) }\log_2\frac3{\sqrt7}\qquad \textbf{(C) }\log_2\frac7{\sqrt3}\qquad \textbf{(D) }\log_2\frac{11}{\sqrt7}\qquad \textbf{(E) }\log_2\frac{11}{\sqrt3}\qquad $

Every point with integer coordinates in the plane is the center of a disk with radius $1/1000$. (1) Prove that there exists an equilateral triangle whose vertices lie in different discs. (2) Prove that every equilateral triangle with vertices in different discs has side-length greater than $96$. [i]Radu Gologan, Romania[/i] [hide="Remark"] The "> 96" in [b](b)[/b] can be strengthened to "> 124". By the way, part [b](a)[/b] of this problem is the place where I used [url=http://mathlinks.ro/viewtopic.php?t=5537]the well-known "Dedekind" theorem[/url]. [/hide]

What is the area of the region in the coordinate plane defined by the inequality \[\left||x|-1\right|+\left||y|-1\right|\leq 1?\] $\textbf{(A)}~4\qquad\textbf{(B)}~8\qquad\textbf{(C)}~10\qquad\textbf{(D)}~12\qquad\textbf{(E)}~15$

Let $p$ be an odd prime and $n$ a positive integer. In the coordinate plane, eight distinct points with integer coordinates lie on a circle with diameter of length $p^{n}$. Prove that there exists a triangle with vertices at three of the given points such that the squares of its side lengths are integers divisible by $p^{n+1}$. [i]Proposed by Alexander Ivanov, Bulgaria[/i]

Let $n\ge3$ be an integer. Prove that there is a set of $n$ points in the plane such that the distance between any two points is irrational and each set of three points determines a non-degenerate triangle with rational area.

Giiven $\Delta ABC$, $\angle CAB=75^{\circ}$ and $\angle ACB=45^{\circ}$. $BC$ is extended to $T$ so that $BC=CT$. Let $M$ be the midpoint of the segment $AT$. Find $\angle BMC$.