Let $S=\{(x,y,z)\in \mathbb{Z}^3\}$ the set of points with integer coordinates in the space. Gugu has infinitely many solid spheres. All with radii $\ge (\frac{\pi}2)^3$. Is it possible for Gugu to cover all points of $S$ with his spheres?

Consider the part of a lattice given by the corners $(0, 0), (n, 0), (n, 2)$ and $(0, 2)$. From a lattice point $(a, b)$ one can move to $(a + 1, b)$ or to $(a + 1, b + 1)$ or to $(a, b - 1$), provided that the second point is also contained in the part of the lattice. How many ways are there to move from $(0, 0)$ to $(n, 2)$ considering these rules?

A lattice point $(x, y, z) \in Z^3$ can be seen from the origin if the line from the origin does not contain any other lattice point $(x', y', z')$ with $$(x')^2 + (y')^2 + (z')^2 < x^2 + y^2 + z^2.$$ Let $p$ be the probability that a randomly selected point on the cubic lattice $Z^3$ can be seen from the origin. Given that $$\frac{1}{p}= \sum^{\infty}_{n=i} \frac{k}{n^s}$$ for some integers $ i, k$, and $s$, find $i, k$ and $s$.

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.

Given $19$ points in the plane with integer coordinates, no three collinear, show that we can always find three points whose centroid has integer coordinates.

Given a positive integer $n$, determine the maximum number of lattice points in the plane a square of side length $n +\frac{1}{2n+1}$ may cover.

The infinite integer plane $Z\times Z = Z^2$ consists of all number pairs $(x, y)$, where $x$ and $y$ are integers. Let $a$ and $b$ be non-negative integers. We call any move from a point $(x, y)$ to any of the points $(x\pm a, y \pm b)$ or $(x \pm b, y \pm a) $ a $(a, b)$-knight move. Determine all numbers $a$ and $b$, for which it is possible to reach all points of the integer plane from an arbitrary starting point using only $(a, b)$-knight moves.

Find the number of rectangles who have the following properties: a) Have for vertices, points $(x,y)$ of plane $Oxy$ with $x,y$ non negative integers and $ x \le 8$ , $y\le 8$ b) Have sides parallel to axes c) Have area $E$, with $30<E\le 40$

We call a finite plane set $S$ consisting of points with integer coefficients a two-neighbour set, if for each point $(p, q)$ of $S$ exactly two of the points $(p +1, q), (p, q +1), (p-1, q), (p, q-1)$ belong to $S$. For which integers $n$ there exists a two-neighbour set which contains exactly $n$ points?

Let $R$, $S$, and $T$ be squares that have vertices at lattice points (i.e., points whose coordinates are both integers) in the coordinate plane, together with their interiors. The bottom edge of each square is on the x-axis. The left edge of $R$ and the right edge of $S$ are on the $y$-axis, and $R$ contains $\frac{9}{4}$ as many lattice points as does $S$. The top two vertices of $T$ are in $R \cup S$, and $T$ contains $\frac{1}{4}$ of the lattice points contained in $R \cup S$. See the figure (not drawn to scale). [asy] //kaaaaaaaaaante314 size(8cm); import olympiad; label(scale(.8)*"$y$", (0,60), N); label(scale(.8)*"$x$", (60,0), E); filldraw((0,0)--(55,0)--(55,55)--(0,55)--cycle, yellow+orange+white+white); label(scale(1.3)*"$R$", (55/2,55/2)); filldraw((0,0)--(0,28)--(-28,28)--(-28,0)--cycle, green+white+white); label(scale(1.3)*"$S$",(-14,14)); filldraw((-10,0)--(15,0)--(15,25)--(-10,25)--cycle, red+white+white); label(scale(1.3)*"$T$",(3.5,25/2)); draw((0,-10)--(0,60),EndArrow(TeXHead)); draw((-34,0)--(60,0),EndArrow(TeXHead));[/asy] The fraction of lattice points in $S$ that are in $S \cap T$ is 27 times the fraction of lattice points in $R$ that are in $R \cap T$. What is the minimum possible value of the edge length of $R$ plus the edge length of $S$ plus the edge length of $T$? $\textbf{(A) }336\qquad\textbf{(B) }337\qquad\textbf{(C) }338\qquad\textbf{(D) }339\qquad\textbf{(E) }340$

Some points with the integer coordinates are marked on the coordinate plane. Given a set of nonzero vectors. It is known, that if you apply the beginnings of those vectors to the arbitrary marked point, than there will be more marked ends of the vectors, than not marked. Prove that there is infinite number of marked points.

On the plane we consider $70$ points $A_1,A_2,...,A_{70}$ with integer coodinates. Suppose each pooints has weight $1$ and the centers of gravity of the triangles $ A_1A_2A_3$, $A_2A_3A_4$, $..$., $A_{68}A_{69}A_{70}$, $A_{69}A_{70}A_{1}$, $A_{70}A_{1}A_{2}$ have integer coodinates. Prove that the centers of gravity of any triple $A_i,A_j,...,A_{k}$ has integer coodinates.

A rectangle in xy Cartesian System is called latticed if all it's vertices have integer coordinates. a) Find a latticed rectangle of area $2013$, whose sides are not parallel to the axes. b) Show that if a latticed rectangle has area $2011$, then their sides are parallel to the axes.

Given is a rectangular plane coordinate system. (a) Prove that it is impossible to find an equilateral triangle whose vertices have integer coordinates. (b) In the plane the vertices $A, B$ and $C$ lie with integer coordinates in such a way that $AB = AC$. Prove that $\frac{d(A,BC)}{BC}$ is rational.

The Fibonacci sequence is given by equalities $$F_1=F_2=1, F_{k+2}=F_k+F_{k+1}, k\in N$$. a) Prove that for every $m \ge 0$, the area of ​​the triangle $A_1A_2A_3$ with vertices $A_1(F_{m+1},F_{m+2})$, $A_2 (F_{m+3},F_{m+4})$, $A_3 (F_{m+5},F_{m+6})$ is equal to $0.5$. b) Prove that for every $m \ge 0$ the quadrangle $A_1A_2A_4$ with vertices $A_1(F_{m+1},F_{m+2})$, $A_2 (F_{m+3},F_{m+4})$, $A_3 (F_{m+5},F_{m+6})$, $A_4 (F_{m+7},F_{m+8})$ is a trapezoid, whose area is equal to $2.5$. c) Prove that the area of ​​the polygon $A_1A_2...A_n$ , $n \ge3$ with vertices does not depend on the choice of numbers $m \ge 0$, and find this area.

We call a set of squares with sides parallel to the coordinate axes and vertices with integer coordinates friendly if any two of them have exactly two points in common. We consider friendly sets in which each of the squares has sides of length $n$. Determine the largest possible number of squares in such a friendly set.

Is there an equilateral triangle in the coordinate plane, both coordinates of each vertex of which are integers?

A point in the plane is called a node if both its coordinates are integers. Consider a triangle with vertices at nodes containing at least two nodes inside. Prove that there exists a pair of internal nodes such that a straight line connecting them either passes through a vertex or is parallel to side of the triangle.

A lattice point in the plane is a point both of whose coordinates are integers. Each lattice point has four neighboring points: upper, lower, left, and right. Let $k$ be a circle with radius $r \geq 2$, that does not pass through any lattice point. An interior boundary point is a lattice point lying inside the circle $k$ that has a neighboring point lying outside $k$. Similarly, an exterior boundary point is a lattice point lying outside the circle $k$ that has a neighboring point lying inside $k$. Prove that there are four more exterior boundary points than interior boundary points.

Given a square grid where the distance between two adjacent grid points is $1$. Can the distance between two grid points be $\sqrt5, \sqrt6, \sqrt7$ or $\sqrt{2007}$ ?

Consider all triangles $ABC$ in the cartesian plane whose vertices are at lattice points (i.e. with integer coordinates) and which contain exactly one lattice point (to be denoted $P$) in its interior. Let the line $AP$ meet $BC$ at $E$. Determine the maximum possible value of the ratio $\frac{AP}{PE}$.

Each vertex of a convex polygon has integer coordinates, and no side of this polygon is horizontal or vertical. Prove that the sum of the lengths of the segments of lines of the form $x = m$, $m$ an integer, that lie within the polygon is equal to the sum of the lengths of the segments of lines of the form $y = n$, $n$ an integer, that lie within the polygon. (G Galperin)

Suppose that each of the vertices of $ABC$ is a lattice point in the $xy$-plane and that there is exactly one lattice point $P$ in the interior of the triangle. The line $AP$ is extended to meet $BC$ at $E$. Determine the largest possible value for the ratio of lengths of segments $$\frac{|AP|}{|PE|}.$$

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.

Do there exist 2021 points with integer coordinates on the plane such that the pairwise distances between them are pairwise distinct consecutive integers?