There are $n$ triangles inscribed in a circle and all $3n$ of their vertices are different. Prove that it is possible to put a boy in one of the vertices in each triangle, and a girl in the other, so that boys and girls alternate on a circle.

For any positive real $r$, let $d(r)$ be the distance of the nearest lattice point from the circle center the origin and radius $r$. Show that $d(r)$ tends to zero as $r$ tends to infinity.

There are $n$ points on a circle ($n > 1$). Denote them with $P_1,P_2, P_3, ..., P_n$ such that the polyline $P_1P_2P_3... P_n$ does not intersect itself. In how many ways is this possible?

Consider a circle and a point $A$ outside it. We start moving from $A$ along a closed broken line consisting of segments of tangents to the circle (the segment itself should not necessarily be tangent to the circle) and terminate back at $A$. (On the links of the broken line are solid.) We label parts of the segments with a plus sign if we approach the circle and with a minus sign otherwise. Prove that the sum of the lengths of the segments of our path, with the signs given, is zero. [img]https://cdn.artofproblemsolving.com/attachments/3/0/8d682813cf7dfc88af9314498b9afcecdf77d2.png[/img]

Using cardboard equilateral triangles of side length $1$, an equilateral triangle of side length $2^{2004}$ is formed. An equilateral triangle of side $1$ whose center coincides with the center of the large triangle is removed. Determine if it is possible to completely cover the remaining surface, without overlaps or holes, using only pieces in the shape of an isosceles trapezoid, each of which is created by joining three equilateral triangles of side $1$.

Let $\mathcal S$ be a set of $16$ points in the plane, no three collinear. Let $\chi(S)$ denote the number of ways to draw $8$ lines with endpoints in $\mathcal S$, such that no two drawn segments intersect, even at endpoints. Find the smallest possible value of $\chi(\mathcal S)$ across all such $\mathcal S$. [i]Ankan Bhattacharya[/i]

Every point in the plane was colored in red or blue. Prove that one the two following statements is true: $\bullet$ there exist two red points at distance $1$ from each other; $\bullet$ there exist four blue points $B_1$, $B_2$, $B_3$, $B_4$ such that the points $B_i$ and $B_j$ are at distance $|i - j|$ from each other, for all integers $i $ and $j$ such as $1 \le i \le 4$ and $1 \le j \le 4$.

On a circle $4n$ points are chosen ($n \ge 1$). The points are alternately colored yellow and blue. The yellow points are divided into $n$ pairs and the points in each pair are connected with a yellow line segment. In the same manner the blue points are divided into $n$ pairs and the points in each pair are connected with a blue segment. Assume that no three of the segments pass through a single point. Show that there are at least $n$ intersection points of blue and yellow segments.

There is a $19\times19$ board. Is it possible to mark some $1\times 1$ squares so that each of $10\times 10$ squares contain different number of marked squares?

The lines $\ell_1$ and \ell_2 are parallel. The points $A_1,A_2, ...,A_7$ are on $\ell_1$ and the points $B_1,B_2,...,B_8$ are on $\ell_2$. The points are arranged in such a way that the number of internal intersections among the line segments is maximized (example Figure). The [b]greatest number[/b] of intersection points is [img]https://cdn.artofproblemsolving.com/attachments/4/9/92153dce5a48fcba0f5175d67e0750b7980e84.png[/img] A. $580$ B. $585$ C. $588$ D. $590$ E. $593$

Five points are given in the plane that each of $10$ triangles they define has area greater than $2$. Prove that there exists a triangle of area greater than $3$.

The maximum number of solid regular tetrahedrons can be placed against each other so that one of their edges coincides with a given line segment in space? [hide=original wording]Hoeveel massieve regelmatige viervlakken kan men maximaal tegen mekaar plaatsen zodat ´e´en van hun ribben samenvalt met een gegeven lijnstuk in de ruimte?[/hide]

There is a king in the lower left corner of a chessboard of dimensions $6$ and $6$. In one move, he can move either one cell to the right, or one cell up, or one cell diagonally - to the right and up. How many different paths can the king take to the upper right corner of the board?

Given positive integer $ n \ge 5 $ and a convex polygon $P$, namely $ A_1A_2...A_n $. No diagonals of $P$ are concurrent. Proof that it is possible to choose a point inside every quadrilateral $ A_iA_jA_kA_l (1\le i<j<k<l\le n) $ not on diagonals of $P$, such that the $ \tbinom{n}{4} $ points chosen are distinct, and any segment connecting these points intersect with some diagonal of P.

Does there exist a set $S$ of $100$ points in a plane such that the center of mass of any $10$ points in $S$ is also a point in $S$?

Given are $50$ points in the plane, no three of them belonging to a same line. Each of these points is colored using one of four given colors. Prove that there is a color and at least $130$ scalene triangles with vertices of that color.

Five points are chosen on the sphere, no three of them lying on a great circle (a great circle is the intersection of the sphere with some plane passing through the sphere’s centre). Two great circles not containing any of the chosen points are called equivalent if one of them can be moved to the other without passing through any chosen points. (a) How many nonequivalent great circles not containing any chosen points can be drawn on the sphere? (b) Answer the same problem, but with $n$ chosen points.

From $25$ points in a plane, both of whose coordinates are integers of the set $\{-2,-1, 0, 1, 2\}$, some $17$ points are marked. Prove that there are three points on one line, one of them is the midpoint of two others.

A strip consists of $n$ squares which are numerated in their order by integers $1,2,3,..., n$. In the beginning, one square is empty while each remaining square contains one piece. Whenever a square contains a piece and its some neighbouring square contains another piece while the square immediately following the neighbouring square is empty, one may raise the first piece over the second one to the empty square, removing the second piece from the strip. Find all possibilites which square can be initially empty, if it is possible to reach a state where the strip contains only one piece and a) $n = 2008$, b) $n = 2009$.

Let $P_1,P_2,P_3,P_4$ be four distinct points in the plane. Suppose $\ell_1,\ell_2, … , \ell_6$ are closed segments in that plane with the following property: Every straight line passing through at least one of the points $P_i$ meets the union $\ell_1 \cup \ell_2\cup … \cup\ell_6$ in exactly two points. Prove or disprove that the segments $\ell_i$ necessarily form a hexagon.

No matter how two copies of a convex polygon are placed inside a square, they always have a common point. Prove that no matter how three copies of the same polygon are placed inside this square, they also have a common point.

To [i]dissect [/i] a polygon means to divide it into several regions by cutting along finitely many line segments. For example, the diagram below shows a dissection of a hexagon into two triangles and two quadrilaterals: [img]https://cdn.artofproblemsolving.com/attachments/0/a/378e477bcbcec26fc90412c3eada855ae52b45.png[/img] An [i]integer-ratio[/i] right triangle is a right triangle whose side lengths are in an integer ratio. For example, a triangle with sides $3,4,5$ is an[i] integer-ratio[/i] right triangle, and so is a triangle with sides $\frac52 \sqrt3 ,6\sqrt3, \frac{13}{2} \sqrt3$. On the other hand, the right triangle with sides$ \sqrt2 ,\sqrt5, \sqrt7$ is not an [i]integer-ratio[/i] right triangle. Determine, with proof, all integers $n$ for which it is possible to completely [i]dissect [/i] a regular $n$-sided polygon into [i]integer-ratio[/i] right triangles.

How many ways are there to paint an $m \times n$ board, so that each square is painted blue, white, brown or gold, and in each $2 \times 2$ square there is one square of each color?

Faith has four different integer length segments. It turned out that any three of them can form a triangle. What is the smallest total length of this set of segments?

Given $n>3$ points in the plane such that no three of the points are collinear. Does there exist a circle passing through (at least) $3$ of the given points and not containing any other of the $n$ points in its interior ?