$40$ cells were marked on an infinite chessboard. Is it always possible to find a rectangle that contains $20$ marked cells? M. Evdokimov

Prove that for each vertex of a polyhedron it is possible to attach a natural number so that for each pair of vertices with a common edge, the attached numbers are not relatively prime (i.e. they have common divisors), and with each pair of vertices without a common edge the attached numbers are relatively prime. (Note: there are infinitely many prime numbers.)

The dimensions of a wooden octahedron are natural numbers. We painted all its surface (the six faces), cut it by planes parallel to the cubed faces of an edge unit and observed that exactly half of the cubes did not have any painted faces. Prove that the number of octahedra with such property is finite. (It may be useful to keep in mind that $\sqrt[3]{\frac{1}{2}}=1,79 ... <1,8$). [hide=original wording] Las dimensiones de un ortoedro de madera son enteras. Pintamos toda su superficie (las seis caras), lo cortamos mediante planos paralelos a las caras en cubos de una unidad de arista y observamos que exactamente la mitad de los cubos no tienen ninguna cara pintada. Probar que el número de ortoedros con tal propiedad es finito[/hide]

Prove that for any finite bipartite planar graph, a circle can be assigned to each vertex so that all circles are coplanar, the circles assigned to any two adjacent vertices are tangent to one another, while the circles assigned to any two distinct, non-adjacent vertices intersect in two points.

A configuration of several checkers at the centers of squares on a rectangular sheet of grid paper is called [i]boring [/i] if some four checkers occupy the vertices of a rectangle with sides parallel to those of the sheet. (a) Prove that any configuration of more than $3mn/4$ checkers on an $m\times n$ grid is boring. (b) Prove that any configuration of $26$ checkers on a $7\times 7$ grid is boring.

Let $S$ be a set of at least three points of the plane in general position. Prove that there exists a non-intersecting polygon whose vertices are exactly the points of $S$.

There are $n$ distinct lines in three-dimensional space such that no two lines are parallel and no three lines meet at one point. What is the maximal possible number of planes determined by these $n$ lines? We say that a plane is determined if it contains at least two of the lines.

Let be given $n\ge 3$ distinct points in the plane. Is it always possible to find a circle which passes through three of the points and contains none of the remaining points (a) inside the circle. (b) inside the circle or on its boundary?

Convex $n$-gon $P$, where $n> 3$, is cut into equal triangles by diagonals that do not intersect inside it. What are the possible values of $n$ if the $n$-gon is cyclic?

Given some square carpets with the total area $4$. Prove that they can fully cover the unit square.

Let $P_1$, $P_2$, $P_3$ be pairwise distinct parabolas in the plane. Find the maximum possible number of intersections between two or more of the $P_i$. In other words, find the maximum number of points that can lie on two or more of the parabolas $P_1$, $P_2$, $P_3$ .

The segments connecting the interior point of a convex non-sided $n$-gon with its vertices divide the $n$-gon into $n$ congruent triangles. For what is the smallest $n$ that is possible?

Consider the set $\mathbb Q^2$ of points in $\mathbb R^2$, both of whose coordinates are rational. [b](a)[/b] Prove that the union of segments with vertices from $\mathbb Q^2$ is the entire set $\mathbb R^2$. [b](b)[/b] Is the convex hull of $\mathbb Q^2$ (i.e., the smallest convex set in $\mathbb R^2$ that contains $\mathbb Q^2$) equal to $\mathbb R^2$ ?

Let $A$ be a set consisting of 6 points in the plane. denoted $n(A)$ as the number of the unit circles which meet at least three points of $A$. Find the maximum of $n(A)$

The base of a prism is an $n$-gon. We wish to colour its $2n$ vertices in three colours in such a way that every vertex is connected by edges to vertices of all three colours. (a) Prove that if $n$ is divisible by $3$, then the task is possible. {b) Prove that if the task is possible, then $n$ is divisible by $3$. (A Shapovalov)

Can one paint four points in the plane red and another four points black so that any three points of the same colour are vertices of a parallelogram whose fourth vertex is a point of the other colour? (NB Vassiliev)

What is the greatest number of rays in space beginning at one point and forming pairwise obtuse angles?

Let $A_1A_2...A_{2010}$ be a regular $2010$-gon. Find the number of obtuse triangles whose vertices are among $A_1$, $A_2$,$ ...$, $A_{2010}$.

Given is a convex polygon $ P$ with $ n$ vertices. Triangle whose vertices lie on vertices of $ P$ is called [i]good [/i] if all its sides are unit length. Prove that there are at most $ \frac {2n}{3}$ [i]good[/i] triangles. [i]Author: Vyacheslav Yasinskiy, Ukraine[/i]

We are given a cube with edges of length $n$ cm. At our disposal is a long piece of insulating tape of width $1$ cm. It is required to stick this tape to the cube. The tape may freely cross an edge of the cube on to a different face but it must always be parallel to an edge of the cube. It may not overhang the edge of a face or cross over a vertex. How many pieces of the tape are necessary in order to completely cover the cube? (You may assume that $n$ is an integer.) (A Spivak)

(a) Is it possible to place five wooden cubes in space so that each of them has a part of its face touching each of the others? (b) Answer the same question, but with $6$ cubes.

(a) A point $A$ is marked inside a sphere. Three perpendicular lines drawn through $A$ intersect the sphere at six points. Prove that the centre of gravity of these six points does not depend on the choice of such three lines. (b) An icosahedron with the centre $A$ is placed inside a sphere (its centre does not necessarily coincide with the centre of the sphere). The rays going from $A$ to the vertices of the icosahedron mark $12$ points on the sphere. Then the icosahedron is rotated about its centre. New rays mark new $12$ points on the sphere. Let $O$ and $N$ be the centres of mass of old and new points respectively. Prove that $O = N$.

From a squared sheet of paper of size $29 \times 29, 99$ pieces, each a $2\times 2$ square, are cut off (all cutting is along the lines bounding the squares). Prove that at least one more piece of size $2\times 2$ may be cut from the remaining part of the sheet. (S Fomin, Leningrad)

Points $H_1, H_2, ... , H_n$ are arranged in the plane so that each distance $H_iH_j \le 1$. The point $P$ is chosen to minimise $\max (PH_i)$. Find the largest possible value of $\max (PH_i)$ for $n = 3$. Find the best upper bound you can for $n = 4$.

An $L$ is an arrangement of $3$ adjacent unit squares formed by deleting one unit square from a $2 \times 2$ square. a) How many $L$s can be placed on an $8 \times 8$ board (with no interior points overlapping)? b) Show that if any one square is deleted from a $1987 \times 1987$ board, then the remaining squares can be covered with $L$s (with no interior points overlapping).