A triangle is given, all the angles of which are smaller than $\phi$, where $\phi <2\pi / 3$. Prove that in space there is a point from which all sides of the triangle are visible at an angle $\phi$.

A lattice point is defined as a point on the plane with integer coordinates. Show that for all positive integers $n$, there is a circle on the plane with exactly n lattice points in its interior (not including its boundary).

Position the $4$ points on plane so that when measuring of all pairwise distances between them, it turned out only two different numbers. Find all such locations.

Let $m$ be a convex polygon in a plane, $l$ its perimeter and $S$ its area. Let $M\left( R\right) $ be the locus of all points in the space whose distance to $m$ is $\leq R,$ and $V\left(R\right) $ is the volume of the solid $M\left( R\right) .$ [i]a.)[/i] Prove that \[V (R) = \frac 43 \pi R^3 +\frac{\pi}{2} lR^2 +2SR.\] Hereby, we say that the distance of a point $C$ to a figure $m$ is $\leq R$ if there exists a point $D$ of the figure $m$ such that the distance $CD$ is $\leq R.$ (This point $D$ may lie on the boundary of the figure $m$ and inside the figure.) additional question: [i]b.)[/i] Find the area of the planar $R$-neighborhood of a convex or non-convex polygon $m.$ [i]c.)[/i] Find the volume of the $R$-neighborhood of a convex polyhedron, e. g. of a cube or of a tetrahedron. [b]Note by Darij:[/b] I guess that the ''$R$-neighborhood'' of a figure is defined as the locus of all points whose distance to the figure is $\leq R.$

$(SWE 3)$ Find the natural number $n$ with the following properties: $(1)$ Let $S = \{P_1, P_2, \cdots\}$ be an arbitrary finite set of points in the plane, and $r_j$ the distance from $P_j$ to the origin $O.$ We assign to each $P_j$ the closed disk $D_j$ with center $P_j$ and radius $r_j$. Then some $n$ of these disks contain all points of $S.$ $(2)$ $n$ is the smallest integer with the above property.

You are given some equilateral triangles and squares, all with side length 1, and asked to form convex $n$ sided polygons using these pieces. If both types must be used, what are the possible values of $n$, assuming that there is sufficient supply of the pieces?

In the plane we consider rectangles whose sides are parallel to the coordinate axes and have positive length. Such a rectangle will be called a [i]box[/i]. Two boxes [i]intersect[/i] if they have a common point in their interior or on their boundary. Find the largest $ n$ for which there exist $ n$ boxes $ B_1$, $ \ldots$, $ B_n$ such that $ B_i$ and $ B_j$ intersect if and only if $ i\not\equiv j\pm 1\pmod n$. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

A square is dissected into $n$ congruent non-convex polygons whose sides are parallel to the sides of the square, and no two of these polygons are parallel translates of each other. What is the maximum value of $n$? (4)

Prove that there exists a positive real number $N$ such that for arbitrary real numbers $a,b>N$ it is possible to cover the perimeter of a rectangle with side lengths $a$ and $b$ using non-overlapping unit disks (the unit disks can be tangent to each other). [i]Submitted by Benedek Váli, Budapest[/i]

On the sides of triangle $\vartriangle ABC$, $17$ points are added, so that there are $20$ points in total (including the vertices of $\vartriangle ABC$.) What is the maximum possible number of (nondegenerate) triangles that can be formed by these points.

Is it possible to divide a $6 \times 6$ chessboard into $18$ rectangles, each either $1 \times 2$ or $2 \times 1$, and to draw exactly one diagonal on each rectangle such that no two of these diagonals have a common endpoint? (A Shapovalov)

Let $n$ be a natural number and $L = Z^2$ the set of points on the plane with integer coordinates. Every point in $L$ is colored now in one of the colors red or green. Show that there are $n$ different points $x_1,...,x_n \in L$ all of which have the same color and whose center of gravity is also in $L$ and is of the same color.

Find the smallest constant $c$ such that for every $4$ points in a unit square there are two a distance $\leq c$ apart.

Show that if three points are inside are closed square of unit side, then some pair of them are within $\sqrt{6}-\sqrt{2}$ units apart.

Each square of an $n \times n$ grid is coloured either blue or red, where $n$ is a positive integer. There are $k$ blue cells in the grid. Pat adds the sum of the squares of the numbers of blue cells in each row to the sum of the squares of the numbers of blue cells in each column to form $S_B$. He then performs the same calculation on the red cells to compute $S_R$. If $S_B- S_R = 50$, determine (with proof) all possible values of $k$.

We are given $30$ non-zero vectors in $3$ dimensional space. Prove that among these there are two such that the angle between them is less than $45^o$.

The six-pointed star in the figure is regular: all interior angles of the small triangles are equal. Each of the thirteen marked points is assigned a color, green or red. Prove that there are always three points of the same color, which are the vertices of an equilateral triangle.

A set of points of the plane is called [i] obtuse-angled[/i] if every three of it's points are not collinear and every triangle with vertices inside the set has one angle $ >91^o$. Is it correct that every finite [i] obtuse-angled[/i] set can be extended to an infinite [i]obtuse-angled[/i] set? (UK)

Four frogs sit on the vertices of a square, one on each vertex. They jump in arbitrary order but not simultaneously. Each frog jumps to the point symmetrical to its take-off position with respect to the centre of gravity of the three other frogs. Can one of them jump (at a given time) exactly on to one of the others (considering their locations as points)? (A Andzans)

The point $O{}$ is given in the plane. Find all natural numbers $n{}$ for which $n{}$ points in the plane can be colored red, so that for any two red points $A{}$ and $B{}$ there is a third red point $C{}$ is such that $O{}$ lies strictly inside the triangle $ABC$. [i]From the folklore[/i]

Find all integers $n \geq 3$ with the following property: there exist $n$ distinct points on the plane such that each point is the circumcentre of a triangle formed by 3 of the points.

On the plane are given a convex $n$-gon $P_1P_2....P_n$ and a point $Q$ inside it, not lying on any of its diagonals. Prove that if $n$ is even, then the number of triangles $P_iP_jP_k$ containing the point $Q$ is even.

Let $C_1, ..., C_d$ be compact and connected sets in $R^d$, and suppose that each convex hull of $C_i$ contains the origin. Prove that for every i there is a $c_i \in C_i$ for which the origin is contained in the convex hull of the points $c_1, ..., c_d$.

Given $n \ge 4$ points in the plane such that any four of them are the vertices of a convex quadrilateral, prove that these points are the vertices of a convex polygon.

A cube of dimensions $20 \times 20 \times 20$ is constructed with blocks of $1 \times 2 \times 2$. Prove that there is a line that passes through the cube but not any block.