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: 2

TNO 2024 Senior, 3

In the Cartesian plane, each point with integer coordinates is colored either red, green, or blue. It is possible to form right isosceles triangles ($45^\circ - 90^\circ - 45^\circ$) using colored points as vertices. Prove that regardless of how the coloring is done, there always exists a right isosceles triangle such that all its vertices are either the same color or all different colors.

2022 Tuymaada Olympiad, 6

Kostya marked the points $A(0, 1), B(1, 0), C(0, 0)$ in the coordinate plane. On the legs of the triangle ABC he marked the points with coordinates $(\frac{1}{2},0), (\frac{1}{3},0), \cdots, (\frac{1}{n+1},0)$ and $(0,\frac{1}{2}), (0,\frac{1}{3}), \cdots, (0,\frac{1}{n+1}).$ Then Kostya joined each pair of marked points with a segment. Sasha drew a $1 \times n$ rectangle and joined with a segment each pair of integer points on its border. As a result both the triangle and the rectangle are divided into polygons by the segments drawn. Who has the greater number of polygons: Sasha or Kostya? [i](M. Alekseyev )[/i]