For positive integers $n$ consider the lattice points $S_n=\{(x,y,z):1\le x\le n, 1\le y\le n, 1\le z\le n, x,y,z\in \mathbb N\}.$ Is it possible to find a positive integer $n$ for which it is possible to choose more than $n\sqrt{n}$ lattice points from $S_n$ such that for any two chosen lattice points at least two of the coordinates of one is strictly greater than the corresponding coordinates of the other? [I]Proposed by Endre Csóka, Budapest[/i]

The area of a convex polygon in the plane is equally shared by the four standard quadrants, and all non-zero lattice points lie outside the polygon. Show that the area of the polygon is less than $4$.

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|}.$$

Let $n,a,b,c$ be natural numbers. Every point on the coordinate plane with integer coordinates is colored in one of $n$ colors. Prove there exists $c$ triangles whose vertices are colored in the same color, which are pairwise congruent, and which have a side whose lenght is divisible by $a$ and a side whose lenght is divisible by $b$.

In the plane with coordinates $x,y$, find an example of a convex set $M$ that contains infinitely many lattice points (i.e. points with integer coordinates), but at the same time only finitely many lattice points from $M$ lie on each line in that plane.

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

Show for any positive integer $n$ that there exists a circle in the plane such that there are exactly $n$ grid points within the circle. (A grid point is a point having integer coordinates.)

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 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.

[b]4.[/b] We see, in Figures 1 and 2, examples of lock screens from a cellphone that only works with a password that is not typed but drawn with straight line segments. Those segments form a polygonal line with vertices in a lattice. When drawing the pattern that corresponds to a password, the finger can't lose contact with the screen. Every polygonal line corresponds to a sequence of digits and this sequence is, in fact, the password. The tracing of the polygonal obeys the following rules: [i]i.[/i] The tracing starts at some of the detached points which correspond to the digits from $1$ to $9$ (Figure 3). [i]ii.[/i] Each segment of the pattern must have as one of its extremes (on which we end the tracing of the segment) a point that has not been used yet. [i]iii.[/i] If a segment connects two points and contains a third one (its middle point), then the corresponding digit to this third point is included in the password. That does not happen if this point/digit has already been used. [i]iv.[/i] Every password has at least four digits. Thus, every polygonal line is associated to a sequence of four or more digits, which appear in the password in the same order that they are visited. In Figure 1, for instance, the password is 218369, if the first point visited was $2$. Notice how the segment connecting the points associated with $3$ and $9$ includes the points associated to digit $6$. If the first visited point were the $9$, then the password would be $963812$. If the first visited point were the $6$, then the password would be $693812$. In this case, the $6$ would be skipped, because it can't be repeated. On the other side, the polygonal line of Figure 2 is associated to a unique password. Determine the smallest $n (n \geq 4)$ such that, given any subset of $n$ digits from $1$ to $9$, it's possible to elaborate a password that involves exactly those digits in some order.

Nine lattice points (i.e. with integer coordinates) $P_1,P_2,...,P_9$ are given in space. Show that the midpoint of at least one of the segments $P_iP_j$ , where $1 \le i < j \le 9$, is a lattice point as well.

In a rectangle with vertices $(0, 0), (0, 2), (n,0),(n, 2)$, ($n$ is a positive integer) find the number of longest paths starting from $(0, 0)$ and arriving at $(n, 2)$ which satisfy the following: $\bullet$ At each movement, you can move right, up, left, down by $1$. $\bullet$ You cannot visit a point you visited before. $\bullet$ You cannot move outside the rectangle.

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}$.

A parallelogram is constructed on the coordinate plane, the coordinates of which are integers. It is known that inside the parallelogram and on its contour there are other (except vertices) points with integer coordinates. Prove that the area of ​​the parallelogram is not less than $3/2$.

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)

A rectangle with the side lengths $a$ and $b$ with $a <b$ should be placed in a right-angled coordinate system so that there is no point with integer coordinates in its interior or on its edge. Under what necessary and at the same time sufficient conditions for $a$ and $b$ is this possible?

Let $a$ and $b$ be two positive integers satifying $gcd(a, b) = 1$. Consider a pawn standing on the grid point $(x, y)$. A step of type A consists of moving the pawn to one of the following grid points: $(x+a, y+a),(x+a,y-a), (x-a, y + a)$ or $(x - a, y - a)$. A step of type B consists of moving the pawn to $(x + b,y + b),(x + b,y - b), (x - b,y + b)$ or $(x - b,y - b)$. Now put a pawn on $(0, 0)$. You can make a (nite) number of steps, alternatingly of type A and type B, starting with a step of type A. You can make an even or odd number of steps, i.e., the last step could be of either type A or type B. Determine the set of all grid points $(x,y)$ that you can reach with such a series of steps.

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

Let $a$ and $b$ be two positive integers satifying $gcd(a, b) = 1$. Consider a pawn standing on the grid point $(x, y)$. A step of type A consists of moving the pawn to one of the following grid points: $(x+a, y+a),(x+a,y-a), (x-a, y + a)$ or $(x - a, y - a)$. A step of type B consists of moving the pawn to $(x + b,y + b),(x + b,y - b), (x - b,y + b)$ or $(x - b,y - b)$. Now put a pawn on $(0, 0)$. You can make a (nite) number of steps, alternatingly of type A and type B, starting with a step of type A. You can make an even or odd number of steps, i.e., the last step could be of either type A or type B. Determine the set of all grid points $(x,y)$ that you can reach with such a series of steps.

A lattice point is a point $(x, y)$ with both $x$ and $y$ integers. Find, with proof, the smallest $n$ such that every set of $n$ lattice points contains three points that are the vertices of a triangle with integer area. (The triangle may be degenerate, in other words, the three points may lie on a straight line and hence form a triangle with area zero.)

Consider the line (E): $5x-10y+3=0$ . Prove that: a) Line $(E)$ doesn't pass through points with integer coordinates. b) There is no point $A(a_1,a_2)$ with $ a_1,a_2 \in \mathbb{Z}$ with distance from $(E)$ less then $\frac{\sqrt3}{20}$.

Let $A,B,C$ be nodes of the lattice $Z\times Z$ such that inside the triangle $ABC$ lies a unique node $P$ of the lattice. Denote $E = AP \cap BC$. Determine max $\frac{AP}{PE}$ , over all such configurations.

Call a point in the Cartesian plane with integer coordinates a $lattice$ $point$. Given a finite set $\mathcal{S}$ of lattice points we repeatedly perform the following operation: given two distinct lattice points $A, B$ in $\mathcal{S}$ and two distinct lattice points $C, D$ not in $\mathcal{S}$ such that $ACBD$ is a parallelogram with $AB > CD$, we replace $A, B$ by $C, D$. Show that only finitely many such operations can be performed. [I]Proposed by Joe Benton, United Kingdom.[/i]

Define a [b]ring[/b] in the plane to be the set of points at a distance of at least $r$ and at most $R$ from a specific point $O$, where $r<R$ are positive real numbers. Rings are determined by the three parameters $(O, R, r)$. The area of a ring is labeled $S$. A point in the plane for which both its coordinates are integers is called an integer point. [b]a)[/b] For each positive integer $n$, show that there exists a ring not containing any integer point, for which $S>3n$ and $R<2^{2^n}$. [b]b)[/b] Show that each ring satisfying $100\cdot R<S^2$ contains an integer point.

Find all positive integer $k$ such that one can find a number of triangles in the Cartesian plane, the centroid of each triangle is a lattice point, the union of these triangles is a square of side length $k$ (the sides of the square are not necessarily parallel to the axis, the vertices of the square are not necessarily lattice points), and the intersection of any two triangles is an empty-set, a common point or a common edge.