Given a 15×1515 \times 1515×15 board, some pairs of centers of adjacent (sharing a side) cells are connected by line segments in such a way that a closed, non-self-intersecting polygonal chain is formed, symmetric with respect to one of the diago…
Place 9 points on a plane so that no four points are collinear, but among any six points, there are three that are collinear. (In the illustration, draw all the lines on which three marked points lie.)
Inside a convex pentagon, there are two points located. Prove that it is possible to select a quadrilateral with vertices at the vertices of the pentagon such that both selected points are inside this quadrilateral.
Let MMM be a set of nnn points in the plane such that: 1. There are 7 points in MMM that form the vertices of a convex heptagon. 2. For any 5 points in MMM, if these 5 points form a convex pentagon, then the interior of this…
Consider an infinite grid G\mathcal GG of unit square cells. A chessboard polygon is a simple polygon (i.e. not self-intersecting) whose sides lie along the gridlines of G\mathcal GG . Nikolai chooses a chessboard polygon FFF and c…
A construction set consists of a collection of rectangular parallelepipeds. All of these can be placed in a box that also has the shape of a rectangular parallelepiped. In a defective set, one dimension of each parallelepiped turned out to…
In a plane, there are 2n2n2n red lines and nnn blue lines, none of which are parallel, and no three lines intersect at the same point. Prove that among the regions into which they divide the plane, there are at least nnn regions bounded solel…
Can a 6×66 \times 66×6 square be cut into 1×41 \times 41×4 rectangles? What is the necessary and sufficient condition to cut an m×nm \times nm×n rectangle into 1×k1 \times k1×k rectangles?
In the xyxyxy-plane, a triangle has vertices with coordinates (x,y)(x, y)(x,y), where xxx and yyy are integers satisfying 1⩽x⩽41 \leqslant x \leqslant 41⩽x⩽4 and 1⩽y⩽41 \leqslant y \leqslant 41⩽y⩽4. How many such triangles are there? (Source: 44th American High Sch…
Welcome to the USAYNO, where each question has a yes/no answer. Choose any subset of the following six problems to answer. If you answer nnn problems and get them all correct, you will receive max(0,(n−1)(n−2))\max(0, (n-1)(n-2))max(0,(n−1)(n−2)) points. If an…
In the plane, there are nnn rectangles with parallel sides. The sides of distinct rectangles lie on distinct lines. The boundaries of the rectangles divide the plane into connected regions. A region is considered nice if it contains at…
There are 100 distinct points chosen on a circle. Peter and Catherine are playing a game. On the first turn, Peter selects three triangles with vertices at the chosen points, and thereafter each player in turn selects one such triangle. At…
A rectangle with the side lengths aaa and bbb with a<ba <ba<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 tim…
The plane is partitioned into congruent regular hexagons. Of these hexagons, some 199819981998 are marked. Show that one can select 666666666 of the marked hexagons in such a way that no two of them share a vertex.
Let {Ri}1≤i≤n\{R_i\}_{1\leq i\leq n}{Ri}1≤i≤n be a family of disjoint closed rectangular surfaces with total area 4 such that their projections of the OxOxOx axis is an interval. Prove that there exist a triangle with vertices in…
Do there exist 100 triangles such that none of them can be covered by the other 99?
Given n>4n > 4n>4 points in the plane, some of which are colored red and the rest black, with no three points of the same color collinear, show that we can find three points of the same color such that two of the points do not have a point…
Given a rectangle on the coordinate plane with integer coordinates of its vertices, which is not a square, prove that it is possible to draw several lines parallel to the sides of the rectangle so that the rectangle is divided into squares…
Given a convex polygon An+1A_{n+1}An+1 with n+1n+1n+1 sides (where n≥2n \geq 2n≥2), partition the polygon into n−1n-1n−1 triangles using n−2n-2n−2 non-intersecting diagonals (referred to as a triangulation of An+1A_{n+1}An+1). How many differen…
In a square with an area of 5, nine polygons, each with an area of 1, are placed. Prove that some two of them must have an intersection area of at least 1/91 / 91/9.