This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 99

2011 IMAR Test, 2

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

2024 New Zealand MO, 7

Some of the $80960$ lattice points in a $40\times2024$ lattice are coloured red. It is known that no four red lattice points are vertices of a rectangle with sides parallel to the axes of the lattice. What is the maximum possible number of red points in the lattice?

2023 China Team Selection Test, P23

Given a prime $p$ and a real number $\lambda \in (0,1)$. Let $s$ and $t$ be positive integers such that $s \leqslant t < \frac{\lambda p}{12}$. $S$ and $T$ are sets of $s$ and $t$ consecutive positive integers respectively, which satisfy $$\left| \left\{ (x,y) \in S \times T : kx \equiv y \pmod p \right\}\right| \geqslant 1 + \lambda s.$$Prove that there exists integers $a$ and $b$ that $1 \leqslant a \leqslant \frac{1}{ \lambda}$, $\left| b \right| \leqslant \frac{t}{\lambda s}$ and $ka \equiv b \pmod p$.

2012 CHMMC Fall, 4

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

1994 Nordic, 2

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?

1994 Tuymaada Olympiad, 8

Prove that in space there is a sphere containing exactly $1994$ points with integer coordinates.

KoMaL A Problems 2022/2023, A. 833

Some lattice points in the Cartesian coordinate system are colored red, the rest of the lattice points are colored blue. Such a coloring is called [i]finitely universal[/i], if for any finite, non-empty $A\subset \mathbb Z$ there exists $k\in\mathbb Z$ such that the point $(x,k)$ is colored red if and only if $x\in A$. $a)$ Does there exist a finitely universal coloring such that each row has finitely many lattice points colored red, each row is colored differently, and the set of lattice points colored red is connected? $b)$ Does there exist a finitely universal coloring such that each row has a finite number of lattice points colored red, and both the set of lattice points colored red and the set of lattice points colored blue are connected? A set $H$ of lattice points is called [i]connected[/i] if, for any $x,y\in H$, there exists a path along the grid lines that passes only through lattice points in $H$ and connects $x$ to $y$. [i]Submitted by Anett Kocsis, Budapest[/i]

2013 JBMO Shortlist, 4

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.

1990 All Soviet Union Mathematical Olympiad, 530

A cube side $100$ is divided into a million unit cubes with faces parallel to the large cube. The edges form a lattice. A prong is any three unit edges with a common vertex. Can we decompose the lattice into prongs with no common edges?

2002 All-Russian Olympiad Regional Round, 9.7

[b](9.7)[/b] On the segment $[0, 2002]$ its ends and the point with coordinate $d$ are marked, where $d$ is a coprime number to $1001$. It is allowed to mark the midpoint of any segment with ends at the marked points, if its coordinate is integer. Is it possible, by repeating this operation several times, to mark all the integer points on a segment? [b](10.7)[/b] On the segment $[0, 2002]$ its ends and $n-1 > 0$ integer points are marked so that the lengths of the segments into which the segment $ [0, 2002]$ is divided are corpime in the total (i.e., have no common divisor greater than $1$). It is allowed to divide any segment with marked ends into $n$ equal parts and mark the division points if they are all integers. (The point can be marked a second time, but it remains marked.) Is it possible, by repeating this operation several times, mark all the integer points on the segment? [b](11.8)[/b] On the segment $ [0,N]$ its ends and $2 $ more points are marked so that the lengths segments into which the segment $[0,N]$ is divided are integer and coprime in total. If there are two marked points $A$ and $B$ such that the distance between them is a multiple of $3$, then we can divide from cutting $AB$ by $3$ equal parts, mark one of the division points and erase one of the points $A, B$. Is it true that for several such actions you can mark any predetermined integer point of the segment $[0,N]$?

2022 AMC 12/AHSME, 5

Let the [i]taxicab distance[/i] between points $(x_1,y_1)$ and $(x_2,y_2)$ in the coordinate plane is given by $|x_1-x_2|+|y_1-y_2|$. For how many points $P$ with integer coordinates is the taxicab distance between $P$ and the origin less than or equal to $20$? $\textbf{(A) }441\qquad\textbf{(B) }761\qquad\textbf{(C) }841\qquad\textbf{(D) }921\qquad\textbf{(E) }924$

1976 Bundeswettbewerb Mathematik, 1

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.

1989 Greece National Olympiad, 2

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.

2021 Dutch Mathematical Olympiad, 3

A frog jumps around on the grid points in the plane, from one grid point to another. The frog starts at the point $(0, 0)$. Then it makes, successively, a jump of one step horizontally, a jump of $2$ steps vertically, a jump of $3$ steps horizontally, a jump of $4$ steps vertically, et cetera. Determine all $n > 0$ such that the frog can be back in $(0, 0)$ after $n$ jumps.

2010 Federal Competition For Advanced Students, P2, 4

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?

1995 Czech and Slovak Match, 3

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

2011 Tournament of Towns, 2

In the coordinate space, each of the eight vertices of a rectangular box has integer coordinates. If the volume of the solid is $2011$, prove that the sides of the rectangular box are parallel to the coordinate axes.

2003 BAMO, 3

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

2022 Israel TST, 2

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.

1998 Moldova Team Selection Test, 11

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.

Russian TST 2015, P1

Let $P(x, y)$ and $Q(x, y)$ be polynomials in two variables with integer coefficients. The sequences of integers $a_0, a_1,\ldots$ and $b_0, b_1,\ldots$ satisfy \[a_{n+1}=P(a_n,b_n),\quad b_{n+1}=Q(a_n,b_n)\]for all $n\geqslant 0$. Let $m_n$ be the number of integer points of the coordinate plane, lying strictly inside the segment with endpoints $(a_n,b_n)$ and $(a_{n+1},b_{n+1})$. Prove that the sequence $m_0,m_1,\ldots$ is non-decreasing.

2002 All-Russian Olympiad Regional Round, 10.2

A convex polygon on a plane contains at least $m^2+1$ points with integer coordinates. Prove that it contains $m+1$ points with integer coordinates that lie on the same line.

2010 Korea Junior Math Olympiad, 8

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.

Durer Math Competition CD 1st Round - geometry, 2009.D4

If all vertices of a triangle on the square grid are grid points, then the triangle is called a [i]lattice[/i] triangle. What is the area of the lattice triangle with (one) of the smallest area, if one grid has area $1$ square unit?