Is it true that for each natural number $n$ there exist a circle, which contains exactly $n$ points with integer coordinates?

The points $P = (a, b)$ and $Q = (c, d)$ are in the first quadrant of the $xy$ plane, and $a, b, c$ and $d$ are integers satisfying $a < b, a < c, b < d$ and $c < d$. A route from point $P$ to point $Q$ is a broken line consisting of unit steps in the directions of the positive coordinate axes. An allowed route is a route not touching the line $x = y$. Tetermine the number of allowed routes.

Regular hexagon $ABCDEF$ has vertices $A$ and $C$ at $(0,0)$ and $(7,1)$ respectively. What is its area? (A)$20\sqrt{3}$ (B)$20\sqrt{2}$ (C)$25\sqrt{3}$ (D)None of these

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]

A grasshopper is hopping in the angle $x\ge 0, y\ge 0$ of the coordinate plane (that means that it cannot land in the point with negative coordinate). If it is in the point $(x,y)$, it can either jump to the point $(x+1,y-1)$, or to the point $(x-5,y+7)$. Draw a set of such an initial points $(x,y)$, that having started from there, a grasshopper cannot reach any point farther than $1000$ from the point $(0,0)$. Find its area.

Describe the amount of points $P(x, y)$ that are twice as far apart $A(3, 0)$ as to $0(0, 0)$.

An ant is moving on the cooridnate plane, starting form point $(0,-1)$ along a straight line until it reaches the $x$- axis at point $(x,0)$ where $x$ is a real number. After it turns $90^o$ to the left and moves again along a straight line until it reaches the $y$-axis . Then it again turns left and moves along a straight line until it reaches the $x$-axis, where it once more turns left by $90^o$ and moves along a straight line until it finally reached the $y$-axis. Can both the length of the ant's journey and distance between it's initial and final point be: (a) rational numbers ? (b) integers? Justify your answers PS. Collected [url=https://artofproblemsolving.com/community/c949609_2019_nigerian_senior_mo_round_4]here[/url]

The circle having $(0,0)$ and $(8,6)$ as the endpoints of a diameter intersects the $x$-axis at a second point. What is the $x$-coordinate of this point? $\textbf{(A)}\ 4\sqrt2 \qquad \textbf{(B)}\ 6\qquad \textbf{(C)}\ 5\sqrt2 \qquad \textbf{(D)}\ 8 \qquad \textbf{(E)}\ 6\sqrt2$

A closed recticular polygon with 100 sides (may be concave) is given such that it's vertices have integer coordinates, it's sides are parallel to the axis and all it's sides have odd length. Prove that it's area is odd.

Let ${A}$ be a finite collection of squares in the coordinate plane such that the vertices of all squares that belong to ${A}$ are ${(m, n), (m + 1, n), (m, n + 1)}$, and ${(m + 1, n + 1)}$ for some integers ${m}$ and ${n}$. Show that there exists a subcollection ${B}$ of ${A}$ such that ${B}$ contains at least ${25 \% }$ of the squares in ${A}$, but no two of the squares in ${B}$ have a common vertex.

Right triangle $ABC$ has side lengths $BC=6$, $AC=8$, and $AB=10$. A circle centered at $O$ is tangent to line $BC$ at $B$ and passes through $A$. A circle centered at $P$ is tangent to line $AC$ at $A$ and passes through $B$. What is $OP$? $\textbf{(A)} ~\frac{23}{8}\qquad\textbf{(B)} ~\frac{29}{10}\qquad\textbf{(C)} ~\frac{35}{12}\qquad\textbf{(D)} ~\frac{73}{25}\qquad\textbf{(E)} ~3$

Consider the points of intersection of the graphs $y = \cos x$ and $x = 100 \cos (100y)$ for which both coordinates are positive. Let $a$ be the sum of their $x$-coordinates and $b$ be the sum of their $y$-coordinates. Determine the value of $\frac{a}{b}$.

A moving particle starts at the point $\left(4,4\right)$ and moves until it hits one of the coordinate axes for the first time. When the particle is at the point $\left(a,b\right)$, it moves at random to one of the points $\left(a-1,b\right)$, $\left(a,b-1\right)$, or $\left(a-1,b-1\right)$, each with probability $\tfrac{1}{3}$, independently of its previous moves. The probability that it will hit the coordinate axes at $\left(0,0\right)$ is $\tfrac{m}{3^n}$, where $m$ and $n$ are positive integers, and $m$ is not divisible by $3$. Find $m+n$.

The points $P = (a, b)$ and $Q = (c, d)$ are in the first quadrant of the $xy$ plane, and $a, b, c$ and $d$ are integers satisfying $a < b, a < c, b < d$ and $c < d$. A route from point $P$ to point $Q$ is a broken line consisting of unit steps in the directions of the positive coordinate axes. An allowed route is a route not touching the line $x = y$. Tetermine the number of allowed routes.

For all integers $x,y$, a non-negative integer $f(x,y)$ is written on the point $(x,y)$ on the coordinate plane. Initially, $f(0,0) = 4$ and the value written on all remaining points is $0$. For integers $n, m$ that satisfies $f(n,m) \ge 2$, define '[color=#9a00ff]Seehang[/color]' as the act of reducing $f(n,m)$ by $1$, selecting 3 of $f(n,m+1), f(n,m-1), f(n+1,m), f(n-1,m)$ and increasing them by 1. Prove that after a finite number of '[color=#0f0][color=#9a00ff]Seehang[/color][/color]'s, it cannot be $f(n,m)\le 1$ for all integers $n,m$.

A cubical box with sides of length $7$ has vertices at $(0,0,0)$, $(7,0,0)$, $(0,7,0)$, $(7,7,0)$, $(0,0,7)$, $(7,0,7)$, $(0,7,7)$, $(7,7,7)$. The inside of the box is lined with mirrors and from the point $(0,1,2)$, a beam of light is directed to the point $(1,3,4)$. The light then reflects repeatedly off the mirrors on the inside of the box. Determine how far the beam of light travels before it first returns to its starting point at $(0,1,2)$.

Through the point $F(0,\frac{1}{4})$ of the coordinate plane two perpendicular lines pass, that intersect parabola $y=x^2$ at points $A,B,C,D$ ($A_x<B_x<C_x<D_x$) The difference of projections of segments $AD$ and $BC$ onto the $Ox$ line is $m$ Find the area of $ABCD$

A closed recticular polygon with 100 sides (may be concave) is given such that it's vertices have integer coordinates, it's sides are parallel to the axis and all it's sides have odd length. Prove that it's area is odd.

On the coordinate plane, at some points with integer coordinates, there is a pebble (a finite number of pebbles). It is allowed to make the following move: select a pair of pebbles, take some vector $\vec{a}$ with integer coordinates and then move one of the selected pebbles to vector $\vec{a}$, and the other to the opposite vector $-\vec{a}$; it is forbidden that there should be more than one pebble at one point. Is it always possible to achieve a situation in which all the pebbles lie on the same straight line in a few moves? [i] K. Ivanov [/i]

Prove that it is impossible to draw a convex quadrangle, with one diagonal equal to doubled another, the angle between them $45$ degrees, on the coordinate plane, so, that all the vertices' coordinates would be integers.

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]

The lines with equations $ax-2y=c$ and $2x+by=-c$ are perpendicular and intersect at $(1, -5)$. What is $c$? $\textbf{(A) } -13\qquad \textbf{(B) } -8\qquad \textbf{(C) } 2\qquad \textbf{(D) } 8\qquad \textbf{(E) } 13$

A triangle with vertices as $A=(1,3)$, $B=(5,1)$, and $C=(4,4)$ is plotted on a $6\times5$ grid. What fraction of the grid is covered by the triangle? $\textbf{(A) }\frac{1}{6} \qquad \textbf{(B) }\frac{1}{5} \qquad \textbf{(C) }\frac{1}{4} \qquad \textbf{(D) }\frac{1}{3} \qquad \textbf{(E) }\frac{1}{2}$ [asy] draw((1,0)--(1,5),linewidth(.5)); draw((2,0)--(2,5),linewidth(.5)); draw((3,0)--(3,5),linewidth(.5)); draw((4,0)--(4,5),linewidth(.5)); draw((5,0)--(5,5),linewidth(.5)); draw((6,0)--(6,5),linewidth(.5)); draw((0,1)--(6,1),linewidth(.5)); draw((0,2)--(6,2),linewidth(.5)); draw((0,3)--(6,3),linewidth(.5)); draw((0,4)--(6,4),linewidth(.5)); draw((0,5)--(6,5),linewidth(.5)); draw((0,0)--(0,6),EndArrow); draw((0,0)--(7,0),EndArrow); draw((1,3)--(4,4)--(5,1)--cycle); label("$y$",(0,6),W); label("$x$",(7,0),S); label("$A$",(1,3),dir(230)); label("$B$",(5,1),SE); label("$C$",(4,4),dir(50)); [/asy]

The vertices of a quadrilateral lie on the graph of $y = \ln x$, and the $x$-coordinates of these vertices are consecutive positive integers. The area of the quadrilateral is $\ln \frac{91}{90}$. What is the $x$-coordinate of the leftmost vertex? $\textbf{(A)}\ 6\qquad\textbf{(B)}\ 7\qquad\textbf{(C)}\ 10\qquad\textbf{(D)}\ 12\qquad\textbf{(E)}\ 13$

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]