At what $n$ can a regular $n$-gon be cut by disjoint diagonals into $n- 2$ isosceles (including equilateral) triangles?

Given $5$ points in the plane, no three of them being collinear. Show that among these $5$ points, we can always find $4$ points forming a convex quadrilateral.

Prove that for each $k$ points in the plane, no three collinear and having integral distances from each other. If we have an infinite set of points with integral distances from each other, then all points are collinear. [i](Anonymous314)[/i] PS. wording needs to be fixed , [url=http://www.mathcenter.net/forum/showthread.php?t=7288]source[/url]

Prove that this triangle cut out of paper can be folded so that the surface of a regular unit tetradragon (i.e., a triangular pyramid, all edges of which are equal to $1$) is obtained if: a) this triangle is isosceles, the lateral sides are equal to $2$ , the angle between them is $120^o$, b) two sides of this triangle are equal to $2$ and $2\sqrt3$, the angle between them is $150^o$.

The [i]fractional distance[/i] between two points $(x_1,y_1)$ and $(x_2,y_2)$ is defined as \[ \sqrt{ \left\| x_1 - x_2 \right\|^2 + \left\| y_1 - y_2 \right\|^2},\]where $\left\| x \right\|$ denotes the distance between $x$ and its nearest integer. Find the largest real $r$ such that there exists four points on the plane whose pairwise fractional distance are all at least $r$.

Consider a right-angled triangle whose legs are $1$ cm long. Suppose that each point of the triangle was assigned a color from the set of Brown, Blue, Green and Orange colors. It proves that, whatever way this was done, there is at least one pair of points of the same color at a distance equal to or greater than $2-\sqrt 2$ cm from each other.

Prove that for every positive integer $m$ we can find a finite set $S$ of points in the plane, such that given any point $A$ of $S$, there are exactly $m$ points in $S$ at unit distance from $A$.

Determine all integers $n \geq 3$ for which there exists a conguration of $n$ points in the plane, no three collinear, that can be labelled $1$ through $n$ in two different ways, so that the following condition be satisfied: For every triple $(i,j,k), 1 \leq i < j < k \leq n$, the triangle $ijk$ in one labelling has the same orientation as the triangle labelled $ijk$ in the other, except for $(i,j,k) = (1,2,3)$.

In a plane we have $n$ lines, no two of which are parallel or perpendicular, and no three of which are concurrent. A cartesian system of coordinates is chosen for the plane with one of the lines as the $x$-axis. A point $P$ is located at the origin of the coordinate system and starts moving along the positive $x$-axis with constant velocity. Whenever $P$ reaches the intersection of two lines, it continues along the line it just reached in the direction that increases its $x$-coordinate. Show that it is possible to choose the system of coordinates in such a way that $P$ visits points from all $n$ lines.

Prove that for every positive integer $m$ we can find a finite set $S$ of points in the plane, such that given any point $A$ of $S$, there are exactly $m$ points in $S$ at unit distance from $A$.

Let $K$ be a cube with edge $n$, where $n>2$ is an even integer. Cube $K$ is divided into $n^3$ unit cubes. We call any set of $n^2$ unit cubes lying on the same horizontal or vertical level a layer. We dispose of $\frac{n^3}4$ colors, in each of which we paint exactly $4$ unit cubes. Prove that we can always select $n$ unit cubes of distinct colors, no two of which lie on the same layer.

Prove that any triangle can be cut by at most into $3$ parts, from which an isosceles triangle is formed.

The points $A_1,B_1,C_1,D_1$ and $A_2,B_2,C_2,D_2$ are orthogonal projections of the $ABCD$ tetrahedron vertices on two planes. Prove that it is possible to move one of the planes to provide the parallelness of lines $(A_1A_2), (B_1B_2), (C_1C_2)$ and $(D_1D_2)$ .

There are several settlements on the bank of the Big Round Lake. Some of them are connected with the regular direct ship lines. Two settlements are connected if and only if two next (counterclockwise) to each ones are not connected. Prove that you can move from the arbitrary settlement to another arbitrary settlement, having used not more than three ships.

Can a square of side length $5$ be covered by three squares of side length $4$?

We are given an angle $0^o < \phi \le 180^o$ and a circular disc. An ant begins its journey from an interior point of the disc, travelling in a straight line in a certain direction. When it reaches the edge of the disc, it does the following: it turns clockwise by the angle $\phi $, and if its new direction does not point towards the interior of the disc, it turns by the angle $\phi $ again, and repeats this until it faces the interior. Then it continues its journey in this new direction and turns as before every time when it reaches the edge. For what values of $\phi $ is it true that for any starting point and initial direction the ant eventually returns to its starting position?

A set consisting of $n$ points of a plane is called an isosceles $n$-point if any three of its points are located in vertices of an isosceles triangle. Find all natural numbers for which there exist isosceles $n$-points.

Is it possible to place $1965$ points in a square with side $1$ so that any rectangle of area $1/200$ with sides parallel to the sides of the square contains at least one of these points inside?

Consider a regular 2n-gon $ P$,$A_1,A_2,\cdots ,A_{2n}$ in the plane ,where $n$ is a positive integer . We say that a point $S$ on one of the sides of $P$ can be seen from a point $E$ that is external to $P$ , if the line segment $SE$ contains no other points that lie on the sides of $P$ except $S$ .We color the sides of $P$ in 3 different colors (ignore the vertices of $P$,we consider them colorless), such that every side is colored in exactly one color, and each color is used at least once . Moreover ,from every point in the plane external to $P$ , points of most 2 different colors on $P$ can be seen .Find the number of distinct such colorings of $P$ (two colorings are considered distinct if at least one of sides is colored differently). [i]Proposed by Viktor Simjanoski, Macedonia[/i] JBMO 2017, Q4

Let $n$ be a non-zero natural number, $n \ge 5$. Consider $n$ distinct points in the plane, each colored or white, or black. For each natural $k$ , a move of type $k, 1 \le k <\frac {n} {2}$, means selecting exactly $k$ points and changing their color. Determine the values of $n$ for which, whatever $k$ and regardless of the initial coloring, there is a finite sequence of $k$ type moves, at the end of which all points have the same color.

The faces of a convex polyhedron are similar triangles. Prove that this polyhedron has two pairs of congruent faces.

Find all positive $r{}$ satisfying the following condition: For any $d > 0$, there exist two circles of radius $r{}$ in the plane that do not contain lattice points strictly inside them and such that the distance between their centers is $d{}$.

$2015$ points are given in a plane such that from any five points we can choose two points with distance less than $1$ unit. Prove that $504$ of the given points lie on a unit disc.

A unit square is cut by $n$ straight lines . Prove that in at least one of these parts one can completely fit a square with side $\frac{1}{n+1}$ [hide=original wording]Одиничний квадрат розрізано $n$ прямими на частини. Доведіть, що хоча б в одній з цих частин можна повністю розмістити квадрат зі стороною $\frac{1}{n+1}$[/hide] [hide=notes] The selection panel jury made a mistake because the solution known to it turned out to be incorrect. As it turned out, the assertion of the problem is still correct, although it cannot be proved by simple methods, see. article: Keith Ball. Тhe plank problem for symmetric bodies // Іпѵепііопез МаіЬешаІіеае. — 1991. — Ѵоі. 104, по. 1. — Р. 535-543. [url]https://arxiv.org/abs/math/9201218[/url][/hide]

Let $T(n)$ be the number of dissimilar (non-degenerate) triangles with all side lengths integral and $\leq n$. Find $T(n+1)-T(n)$.